Cod sursa(job #1113639)
Utilizator | Data | 20 februarie 2014 19:45:34 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.36 kb |
#include <fstream>
using namespace std;
int N,k;
bool viz[2000005];
int main()
{
ifstream f("ciur.in");
f>>N;
f.close();
for( int i=2;i<=N;i++)
if( viz[i] == 0 )
{ for( int j=i*i; j <= N; j+=i) viz[j]=1;
++k;
}
ofstream g("ciur.out");
g<<k;
g.close();
return 0;
}