Cod sursa(job #1193466)
Utilizator | Data | 31 mai 2014 20:37:42 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.39 kb |
#include<fstream>
using namespace std;
const int MAX=2000001;
bool prim[2000001];
int nr=0;
int main(){
ifstream fin("ciur.in");
ofstream fout("ciur.out");
long n;
fin>>n;
for(int i=2;i<=n;i++)
prim[i]=true;
for(int i=2;i<=n;i++){
if(prim[i]){
nr++;
for(int j=2*i;j<=n;j+=i)
prim[j]=false;
}
}
fout<<nr;
}