Cod sursa(job #2251318)
Utilizator | Data | 1 octombrie 2018 13:29:56 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 60 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.4 kb |
#include <fstream>
using namespace std;
ifstream f("ciur.in");
ofstream g("ciur.out");
int main(){
int ciur[2000001], n, c=0;
f >> n;
for(int i=1; i<=n ; i++)
ciur[i] =1;
for (int i=2; i<=n ;i++)
if(ciur[i] == 1){
c++;
for(int j=2; j*i <= n; j ++)
ciur[i*j] = 0;
}
g << c;
f.close();
g.close();
}