Cod sursa(job #2162853)
Utilizator | Data | 12 martie 2018 15:08:46 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.43 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("ciur.in");
ofstream g("ciur.out");
bool ciur[2000001];
int nr,n;
void solve(int n){
ciur[0]=ciur[1]=1;
for(int i=2; i<=n; ++i){
if(ciur[i]==0){
++nr;
for(int j=2; j<=n/i; ++j)
ciur[i*j]=1;
}
}
g<<nr<<'\n';
}
int main(){
f>>n;
solve(n);
return 0;
}