Cod sursa(job #503025)
Utilizator | Data | 21 noiembrie 2010 10:54:49 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.27 kb |
#include<fstream.h>
#define N 2000001
ifstream fin("ciur.in");
ofstream fout("ciur.out");
char s[N];
int main() {
int i,j,n,nr=0;
fin>>n;
for(i=2;i*i<=n;i++)
if(s[i]==0)
for(j=i;j*i<=n;j++) s[i*j]=1;
for(i=2;i<=n;i++) if(s[i]==0) nr++;
fout<<nr;
return 0;
}