Cod sursa(job #232824)
| Utilizator | Data | 16 decembrie 2008 08:56:24 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 30 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.54 kb |
// CIURUL LUI ERATOSTENE
#include <fstream.h>
#include <string.h>
int main()
{
int n, ok[30000], i, j, p = 0;
ifstream fin("ciur.in");
fin >> n;
fin.close();
ofstream fout("ciur.out");
for ( i = 0; i < n; ++i )
ok[i] = 1;
for ( i = 2; i*i < n; ++i )
if ( ok[i] )
{
j = 2;
while ( i * j <= n )
{
ok[i*j] = 0;
j++;
}
}
for ( i = 2; i <= n; ++i )
if ( ok[i] )
p++;
fout << p << '\n';
fout.close();
return 0;
}
