Cod sursa(job #232841)
| Utilizator | Data | 16 decembrie 2008 09:23:38 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.69 kb |
#include <fstream>
#include <iomanip>
using namespace std;
bool ok[2000000];
int main()
{
ifstream fin("ciur.in");
ofstream fout("ciur.out");
int i, j, n, x = 0;
fin >> n;
for ( int i = 0; i < n; i++ )
ok[i] = true;
for ( i = 2; i*i <= n; i++ )
if ( ok[i] )
{
j = 2;
while ( i*j <= n )
{
ok[i*j] = false;
j++;
}
}
for ( i = 2; i <= n; i++ )
if ( ok[i] )
x++;
fout << x;
fin.close();
fout.close();
return 0;
}
