Cod sursa(job #505806)
| Utilizator | Data | 4 decembrie 2010 08:37:19 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 30 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.43 kb |
#include<iostream.h>
#include<fstream.h>
long i,j,k,n;
int a[2000001];
int main()
{
fstream f("ciur.in",ios::in);
fstream g("ciur.out",ios::out);
f>>n;
a[2]=1;
for(i=3;i<=n;i=i+2)
a[i]=1;
for(i=3;i<=n;i=i+2)
if(a[i]==1) {
j=2*i;
while(j<=n) {
a[j]=0;
j=j+i;
}
}
k=1;
for(i=3;i<=n;i=i+2)
if(a[i]==1)k++;
g<<k;
f.close();g.close();
return 0;
}
