Cod sursa(job #3038359)
Utilizator | Data | 27 martie 2023 11:54:32 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.34 kb |
#include <fstream>
using namespace std;
ifstream cin("ciur.in");
ofstream cout("ciur.out");
int i, j, n, m, nr;
bool f[2000002];
int main(){
cin>>n;
f[0]=f[1]=1;
for(i=2;i<=n;i++){
if(f[i]==0){
nr++;
for(j=i+i;j<=n;j+=i)
f[j]=1;
}
}
cout<<nr;
}