Cod sursa(job #1011516)
Utilizator | Data | 16 octombrie 2013 21:55:52 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.51 kb |
#include <fstream>
using namespace std;
ifstream cin("ciur.in");
ofstream cout("ciur.out");
int n, i, k, x[2000000],nr;
int main()
{
cin>>n;
for(i=2;i<=n;i++)
x[i]=1;
for(i=2;i<=n;i++)
if(x[i])
{
k=2*i;
while(k<=n)
{
x[k]=0;
k+=i;
}
}
for(i=2;i<=n;i++)
nr+=x[i];
cout<<nr;
cin.close();
cout.close();
return 0;
}