Cod sursa(job #1333864)
| Utilizator | Data | 3 februarie 2015 17:30:27 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.49 kb |
#include <fstream>
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
bool C[2000001];
void Ciur()
{
for( int i = 2; i <= 1415; ++i )
{
if( !C[i] )
for( int j = i + i; j <= 2000000; j += i )
C[j] = 1;
}
}
int main()
{
C[0] = C[1] = 1;
int N; fin >> N;
Ciur();
int nr = 0;
for( int i = 1; i <= N; ++i )
if( !C[i] )
nr++;
fout << nr;
return 0;
}
