Cod sursa(job #232950)
| Utilizator | Data | 16 decembrie 2008 15:25:57 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 10 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.41 kb |
#include <fstream>
using namespace std;
int main()
{
ifstream fin("ciur.in");
int i, j, n;
fin >> n;
fin.close();
bool ok[200005];
int nr = 0;
for ( i = 2; i <=n ; i++)
ok[i] = true;
for ( i = 2; i <= n; i++)
if ( ok[i] )
{
nr ++;
for ( j = i+1; j <= n; j += i )
ok[j] = false;
}
ofstream fout("ciur.out");
fout << nr << '\n';
fout.close();
return 0;
}
