Cod sursa(job #2565939)
Utilizator | Data | 2 martie 2020 17:59:30 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 70 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.46 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin ("ciur.in");
ofstream fout ("ciur.out");
int n, i, j, c;
int fr[2000001];
int main()
{
fin >> n;
for(i = 2; i * i <= n; i++)
{
if(fr[i] == 0)
{
for(j = i * i; j <= n; j += i)
fr[j] = 1;
}
}
for(i = 2; i <= n; i++)
{
if(fr[i] == 0)
c++;
}
fout << c;
return 0;
}