Cod sursa(job #389024)
Utilizator | Data | 31 ianuarie 2010 17:57:49 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.29 kb |
#include<fstream>
using namespace std;
short prim[2000001];
int n;
int main(){
ifstream f("ciur.in");
ofstream g("ciur.out");
f>>n;
int d,i,c=0;
for( d=2; d <= n; d++ ){
if(!prim[d]) c++;
for( i=d*d; i<=n; i+=d) prim[i]=1;
}
g<<c;
return 0;
}