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