Cod sursa(job #2552802)
Utilizator | Data | 21 februarie 2020 11:10:35 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.52 kb |
#include <fstream>
using namespace std;
ifstream in("ciur.in");
ofstream out("ciur.out");
int n,cnt=0,k,m;
bool ciur[2000005];
int main()
{
in>>n;
for(int i=2;i*i<=n;i++)
{
if(ciur[i]==0){
k=2;
m=i * k;
while(m<=n)
{
ciur[m]=1;
m=i*k;
k++;
}
}
}
for(int i=2;i<=n;i++){
if(ciur[i]==0)
cnt++;
}
out<<cnt;
return 0;
}