Cod sursa(job #1365973)
Utilizator | Data | 28 februarie 2015 17:24:45 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.35 kb |
#include <fstream>
using namespace std;
ifstream in("ciur.in");
ofstream out("ciur.out");
bool ciur[2000000];
int main(){
int d,n,i,nr=0;
in>>n;
for(d=2;d<=n;d++)
{
if(ciur[d]==0)
{
for(i=d*d;i<=n;i=i+d){
ciur[i]=1;}
nr++;
}
}
out<<nr;
return 0;
}