Cod sursa(job #244874)
Utilizator | Data | 16 ianuarie 2009 10:52:04 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.32 kb |
#include<fstream>
using namespace std;
char ok[2000005];
int i,j,k;
long long N;
int main()
{ ifstream f ("ciur.in");
ofstream g ("ciur.out");
f>>N;
for(i=2;i*i<=N;i++)
if(!ok[i])
{
j=2;
while(i*j<=N) ok[i*j]='1', j++;
}
for(i=2;i<=N;i++)
if(!ok[i]) k++;
g<<k;
return 0;
}