Cod sursa(job #1037041)
Utilizator | Data | 19 noiembrie 2013 20:32:38 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.27 kb |
#include <fstream>
using namespace std;
ifstream f("ciur.in");
ofstream g("ciur.out");
long long i,j,n,nr;
char v[2000005];
int main()
{f>>n;
for(i=2;i<=n;i++)
v[i]=1;
for(i=2;i<=n;i++)
if(v[i]==1)
{nr++;
for(j=2*i;j<=n;j=j+i)
v[j]=0;
}
g<<nr;
return 0;
}