Cod sursa(job #427633)
Utilizator | Data | 28 martie 2010 10:37:24 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.4 kb |
#include<fstream.h>
ifstream f("ciur.in");
ofstream g("ciur.out");
int n2,prim=0,j,n,i;
char a[2000001];
int main(){
f>>n;
i=2;
while(i<=n){
do{
++i;
}while(a[i]=='1' && i<=n);
for(j=i+i;j<=n;j+=i) a[j]='1';
prim++;
}
g<<prim-1<<'\n';
g.close();
return 0;
}