Cod sursa(job #303686)
Utilizator | Data | 10 aprilie 2009 10:38:44 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.4 kb |
#include<fstream>
using namespace std;
int N, cnt;
char prim[2000005];
int main(void)
{
int i,j;
ifstream f ("ciur.in");
ofstream g ("ciur.out");
f>>N;
for (i=2;i<=N;i++)
prim[i]=1;
for (i=2;i<=N;i++)
if (prim[i])
{
cnt++;
for (j=i+i;j<= N; j=j+i)
prim [j]=0;
}
g<<cnt;
return 0;
}