Cod sursa(job #1126877)
Utilizator | Data | 27 februarie 2014 10:14:00 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 20 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.33 kb |
#include <fstream>
using namespace std;
int main()
{ ifstream cin("ciur.in");
ofstream cout("ciur.out");
int i,j,n,k=0;
bool ciur[1000];
cin>>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)
k++;
}
cout<<k;
return 0;
}