Cod sursa(job #1178393)
| Utilizator | Data | 26 aprilie 2014 15:00:21 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 60 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.47 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("ciur.in");
ofstream g("ciur.out");
int n, s;
bool v[2000001];
int main()
{
f >> n;
for ( int i = 2; i <= n; i++)
v[i]= 1;
for ( int i = 2; i * i<= n; i += 1)
for ( int j = 2; j * i <= n; j += 1 )
v[i*j] = 0;
for ( int i = 2; i <= n; i++)
if( v[i] == 1)
s++;
g << s;
f.close();
g.close();
return 0;
}
