Cod sursa(job #2252029)
Utilizator | Data | 2 octombrie 2018 11:39:49 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | musai_must | Marime | 0.4 kb |
#include <fstream>
using namespace std;
ifstream f("ciur.in");
ofstream g("ciur.out");
char ciur[2000001];
int main(){
int 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]){
c++;
for(int j=2; j*i <= n; j ++)
ciur[i*j] = 0;
}
g << c;
f.close();
g.close();
}