Cod sursa(job #2244355)
Utilizator | Data | 22 septembrie 2018 17:17:25 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.39 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin ("ciur.in");
ofstream fout ("ciur.out");
int n, i, j, nr;
bool a[2000005];
int main()
{
fin >> n;
for(i=2; i*i<=n; i++)
if(a[i] == 0)
for(j=i; i*j<=n; j++)
a[i*j] = 1;
for(i=2; i<=n; i++)
if(a[i] == 0)
nr++;
fout << nr;
return 0;
}