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