Cod sursa(job #1537992)
Utilizator | Data | 28 noiembrie 2015 12:59:47 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.36 kb |
#include<iostream>
using namespace std;
bool v[2000001];
int main()
{
int n, i, j, nr;
cin>>n;
nr=0;
for(i=2; i<=n; i++)
if(v[i]==0)
for(j=i+1; j<=n; j++)
if(j%i==0)
v[j]=1;
for(i=2; i<=n; i++)
if(v[i]==0)
nr=nr+1;
cout<<nr<<endl;
return 0;
}