Cod sursa(job #1125955)
Utilizator | Data | 26 februarie 2014 20:27:51 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.38 kb |
#include<iostream>
#include<fstream>
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
int main()
{
int k=0,i,j,n;
bool ciur[2000000];
fin>>n;
for(i=2;i<=n;++i)
ciur[i]=true;
for(i=2;i<=n;++i)
if(ciur[i]==true)
for(j=i+i;j<=n;j=j+i)
ciur[j]=false;
for(i=2;i<=n;++i)
if(ciur[i]==true)
//cout<<i<<" ";
k++;
fout<<k;
return 0;
}