Cod sursa(job #2850719)
Utilizator | Data | 17 februarie 2022 13:54:57 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 50 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.4 kb |
#include <fstream>
using namespace std;
ifstream cin("ciur.in");
ofstream cout("ciur.out");
int n, m, i, j, nr, f[2000005];
int main(){
cin>>n;
f[0]=1;
f[1]=1;
for(i=2;i<=n;i++){
if(f[i]==0){
for(j=i+i;j<=n;j+=i){
f[j]=1;
}
}
}
for(i=2;i<=n;i++){
if(f[i]==0)
nr++;
}
cout<<nr<<" ";
}