Cod sursa(job #1124551)
Utilizator | Data | 26 februarie 2014 12:41:49 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.31 kb |
#include<fstream>
using namespace std;
ifstream cin ("ciur.in");
ofstream cout("ciur.out");
int n,i,j,k;
bool ciur[1000000];
int main ()
{
cin>>n;
for (i=1;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;
return 0;
}