Cod sursa(job #1418078)
Utilizator | Data | 11 aprilie 2015 21:24:23 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.41 kb |
#include <fstream>
using namespace std;
ifstream is("ciur.in");
ofstream os("ciur.out");
int n;
bool ok[2000002];
int cnt;
int main()
{
is >> n;
for (int i = 2; i*i <= n; ++i)
if ( !ok[i] )
for (int j = 2; j*i <= n; ++j)
ok[i*j] = true;
for (int i = 2; i <= n; ++i)
if ( !ok[i] )
cnt++;
os << cnt;
is.close();
os.close();
return 0;
}