Cod sursa(job #864947)
Utilizator | Data | 25 ianuarie 2013 21:26:40 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.38 kb |
#include<fstream>
using namespace std;
int a[2000001],N,k;
int main()
{
ifstream cin("ciur.in");
ofstream cout("ciur.out");
cin>>N;
a[1]=1;
for(int i=2;i<=N;++i)
{
if(a[i]==0)
for(int j=2*i;j<=N;j=j+i)
a[j]=1;
}
for(int i=1;i<=N;++i)
if(a[i]==0)
++k;
cout<<k;
return 0;
}