Cod sursa(job #1867936)
Utilizator | Data | 4 februarie 2017 14:02:22 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 50 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.37 kb |
#include <iostream>
#include <cmath>
#include <fstream>
using namespace std;
ofstream out;
ifstream in;
bool c[2000000];
int main(){
in.open("ciur.in");
out.open("ciur.out");
int n,s=0; in>>n;
for(int i=2; i<=n; ++i){
if(c[i]==0) ++s;
for(int j=i+i; j<=n; j+=i){
++c[j];
}
}
out<<s;
return 0;
}