Cod sursa(job #2570327)
Utilizator | Data | 4 martie 2020 16:11:54 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.36 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream in("ciur.in");
ofstream out("ciur.out");
int n,nr;
bool ciur[2000005];
int main()
{
in>>n;
ciur[0]=ciur[1]=1;
for(int i=2;i<=n;i++)
if(ciur[i]==0)
{
nr++;
for(int j=2;i*j<=n;j++)
ciur[i*j]=1;
}
out<<nr;
return 0;
}