Cod sursa(job #2702060)
Utilizator | Data | 2 februarie 2021 18:41:19 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.43 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
bool ciur[2000001];
int main()
{
int cnt=0, n;
fin>>n;
for(int i = 2;i<=n;i++)
ciur[i]=true;
for(int i=2;i<=n;i++)
if(ciur[i]==true)
{
cnt++;
for(int j=i+i;j<=n;j=j+i)
ciur[j]=false;
}
fout<<cnt;
return 0;
}