Cod sursa(job #2722538)
Utilizator | Data | 12 martie 2021 22:57:09 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 70 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.49 kb |
#include <iostream>
#include <fstream>
using namespace std;
int n , ciur[2000005] ;
int main()
{
ifstream fin("ciur.in");
ofstream fout("ciur.out");
fin>>n;
int nr=0 ,i , j;
for(i=2 ; i<=n ; i++){
if(i*i<=n)
if(ciur[i]==0){
for( j=i*2 ; j<=n ; j+=i){
ciur[j]=1;
}
}
}
for(int i=2 ; i<=n ; i++){
if(ciur[i]==0)
nr++;
}
fout<<nr;
return 0;
}