Cod sursa(job #1695906)
Utilizator | Data | 27 aprilie 2016 23:15:43 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.44 kb |
#include <fstream>
using namespace std;
unsigned long N,cont,i,j;
bool ciur[2000012];
int main()
{
ifstream f("ciur.in");
ofstream g("ciur.out");
f>>N;
for(i=2;i<=N;i++)
ciur[i]=1;
for(i=2;i<=N;++i)
{
if (ciur[i])
{
cont++;
for(j=2*i;j<=N;j+=i)
ciur[j]=0;
}
}
g<<cont;
g.close();
return 0;
}