Cod sursa(job #2567088)
Utilizator | Data | 3 martie 2020 15:05:13 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.4 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream f("ciur.in");
ofstream g("ciur.out");
int n,i,d,nr;
bool ciur[2000010];
int main()
{
f>>n;
ciur[0]=ciur[1]=1;
for(d=2;d*d<=n;d++)
{
if(ciur[d]==0)
{
for(i=d*d;i<=n;i+=d)
ciur[i]=1;
}
}
for(i=1;i<=n;i++)if(ciur[i]==0)nr++;
g<<nr;
return 0;
}