Cod sursa(job #2252959)
Utilizator | Data | 3 octombrie 2018 13:45:47 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 40 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.44 kb |
#include <fstream>
using namespace std;
int n,i,j,sol,f[2000010];
int main () {
ifstream fin ("ciur.in");
ofstream fout ("ciur.out");
fin>>n;
for (i=2;i<=n;i++){
if (f[i]==0){
for (j=i*2;j<=n;j+=i){
f[j]=1;
}
}
}
f[1]=1;
f[0]=1;
for (i=2;i<=n;i++){
if (f[i]==0){
sol++;
}
}
fout<<sol;
return 0;
}