Cod sursa(job #2085551)
Utilizator | Data | 10 decembrie 2017 13:21:22 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.4 kb |
#include <fstream>
using namespace std;
ifstream fin ("ciur.in");
ofstream fout ("ciur.out");
bool f[2000001];
int cnt;
int main()
{
int n;
fin>>n;
for ( int i = 2; i <= n; ++i )
if ( f[i] == 0 )
for ( int j = 2*i; j <= n; j += i )
f[j] = 1;
for ( int i = 2; i <= n; ++i )
if ( f[i] == 0 )
cnt++;
fout<<cnt;
}