Cod sursa(job #1816952)
Utilizator | Data | 27 noiembrie 2016 10:47:05 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.38 kb |
#include <fstream>
#include <iostream>
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
int i,n,d,nr;
bool ciur[2000002];
int main()
{
fin>>n;
ciur[1]=0;
ciur[2]=0;
for(i=2;i<=n;i++){
if(ciur[i]==0){
nr++;
for(d=i+i;d<=n;d=d+i)
ciur[d]=1;
}
}
fout<<nr;
}