Cod sursa(job #680223)
Utilizator | Data | 14 februarie 2012 23:45:27 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.36 kb |
#include <fstream>
using namespace std;
long i,N,j,c;
bool a[2000002];
int main()
{
ifstream f("ciur.in");
ofstream g("ciur.out");
f>>N;
for (i=2; i<=N; i++)
a[i]=1;
for (i=2; i<=N; i++)
if (a[i]==1)
{
c++;
for (j=i+i; j<=N; j=j+i)
a[j]=0;
}
g<<c;
return 0;
}