Cod sursa(job #2852954)
Utilizator | Data | 19 februarie 2022 18:49:26 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 60 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.4 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
int n,i,j,k,ciur[2000001];
int main()
{
fin>>n;
ciur[0]=ciur[1]=1;
k=1;
for(i=3; i<=n; i+=2)
{
if(ciur[i]==0)
{
for(j=i*2; j<=n; j+=i)
ciur[j]=1;
k++;
}
}
fout<<k;
return 0;
}