Cod sursa(job #3182171)
Utilizator | Data | 8 decembrie 2023 18:29:46 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.52 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
char ciur[2000001];
int main()
{
for(int i=2;i*i<2000001;i++)
{
if(ciur[i]==0)
{
for(int d=i*i;d<2000001;d+=i)
{
ciur[d]=1;
}
}
}
ciur[1]=1;
ciur[0]=1;
int n,cnt=0;
fin>>n;
for(int i=2;i<=n;i++)
{
if(ciur[i]==0)
{
cnt++;
}
}
fout<<cnt;
}