Cod sursa(job #2376603)
| Utilizator | Data | 8 martie 2019 16:40:34 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.44 kb |
#include <fstream>
#include <iostream>
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
int main() {
int n;
int count=0;
fin >> n;
bool prim[2000005];
for(int i=2;i<=n;i++) {
prim[i]=1;
}
for(int i=2;i<=n;i++) {
if(prim[i]) {
count++;
for(int j=i+i;j<=n;j+=i) {
prim[j]=0;
}
}
}
fout << count;
return 0;
}
