Cod sursa(job #392855)
Utilizator | Data | 8 februarie 2010 14:46:29 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.26 kb |
#include<fstream.h>
ifstream f("ciur.in");
ofstream g("ciur.out");
int n,nr,i,j,a[2000000];
int main(){
f>>n;
for (i=2;i<=n;i++)
a[i]=1;
for (i=2;i<=n;i++)
if(a[i]==1){
for (j=2*i;j<=n;j=j+i)
a[j]=0;
nr++;
}
g<<nr;
return 0;
}