Cod sursa(job #2052240)
Utilizator | Data | 30 octombrie 2017 12:00:30 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.49 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f ("ciur.in");
ofstream g ("ciur.out");
bool ciur[2000005];
int main(){
int n,j=2,nr=0;
f>>n;
for(int i=2;i<=n;i++)
ciur[i]=1;
for(int i=2;i<=n;i++){
if(ciur[i]==1){
for(int j=i*2;j<=n;j=j+i){
ciur[j]=0;
}
}
}
for(int i=2;i<=n;i++){
if(ciur[i]==1){
++nr;
}
}
g<<nr;
return 0;
}