Cod sursa(job #2858327)
Utilizator | Data | 27 februarie 2022 13:01:27 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.41 kb |
#include <fstream>
using namespace std;
ifstream in ("ciur.in");
ofstream out ("ciur.out");
bool ciur[2000001];
int main()
{
int n,i,g=0,cp;
in>>n;
for(i=2;i*i<=n;i++)
{
if(ciur[i]==0)
{
cp=i;
for(cp;cp*i<=n;cp++)
ciur[cp*i]=1;
}
}
for(i=2;i<=n;i++)
if(ciur[i]==0)
g++;
out<<g;
return 0;
}