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