Cod sursa(job #578909)
Utilizator | Data | 11 aprilie 2011 18:33:05 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 40 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.33 kb |
#include<fstream.h>
int n,nr;
bool v[2000000];
ifstream f("ciur.in");
ofstream g("ciur.out");
int main()
{
int i;
f>>n;
for(i=2; i<=n; i++)
{
if (!v[i])
{
nr=i;
while(nr<=n)
{
nr+=i;
v[nr]=true;
}
}
}
nr=0;
for (i=2; i<=n; i++)
if (!v[i])
++nr;
g<<nr;
return 0;
}