Cod sursa(job #3142098)
Utilizator | Data | 19 iulie 2023 10:50:55 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.44 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
int n , cnt;
bool v[2000005];
int main()
{
fin>>n;
v[0]=v[1]=1;
for(int i=2 ; i*i<=n ; i++){
if(v[i] == 0){
for(int j=i*i ; j<=n ; j+=i){
v[j]=1;
}
}
}
for(int i=2 ; i<=n ; i++)
if(v[i] == 0){
cnt++;
}
fout<<cnt;
return 0;
}