Cod sursa(job #2499175)
Utilizator | Data | 25 noiembrie 2019 16:42:04 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.44 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
int N,nr;
bool v[2000005];
int main()
{
fin >> N;
for(int i=3;i<=N;i+=2)
if(!v[i])
{
nr++;
for(int j=2;;j++)
{
if(i*j>N)
break;
v[i*j]=true;
}
}
fout << nr;
return 0;
}