Cod sursa(job #1512548)
Utilizator | Data | 28 octombrie 2015 11:14:53 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.33 kb |
#include<iostream>
using namespace std;
const int N=2000001;
bool c[N];
int main()
{
int i,nr,j,n;
cin>>n;
for(i=2; i*i<N; i++)
{
if(not c[i])
{
for(j=i*i; j<N; j+=i)
c[j]=true;
}
}
nr=0;
for(i=2;i<=n;i++)
if(not c[i])
nr++;
cout<<nr;
return 0;
}