Cod sursa(job #1124865)
| Utilizator | Data | 26 februarie 2014 14:08:29 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.45 kb |
#include <fstream>
#include <cstring>
using namespace std;
ifstream is("ciur.in");
ofstream os("ciur.out");
bool p[2000002];
int cnt, n;
int main()
{
memset(p, 1, sizeof(p) );
is >> n;
for ( int i = 2; i <= n; ++i )
if ( p[i] )
{
cnt++;
for ( int j = 2; j * i <= n; ++j )
p[i*j] = false;
}
os << cnt;
is.close();
os.close();
return 0;
}
