Cod sursa(job #1037663)
Utilizator | Data | 20 noiembrie 2013 16:44:21 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.46 kb |
#include <fstream>
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
int c[2000001];
int main()
{
int i, n, nrp = 0;
fin >> n;
for ( i = 2; i * i <= n; i++ )
if ( c[i] == 0 )
for ( int j = i + i; j <= n; j += i )
c[j] = 1;
for ( i = 2; i <= n; i++ )
if ( !c[i] )
nrp++;
fout << nrp << '\n';
fin.close();
fout.close();
return 0;
}