Cod sursa(job #2298902)
Utilizator | Data | 8 decembrie 2018 16:48:39 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.37 kb |
#include <iostream>
using namespace std;
int v[2000001];
int ciur(int n)
{
int nr=0,i,j;
for (i=2;i<n;i++)
v[i]=1;
for (i=4;i<n;i+=2)
v[i]=0;
for(i=3;i<n;i+=2)
{
for(j=2*i;j<n;j+=i)
v[j]=0;
}
for (i=2;i<n;i++)
if (v[i]==1)
nr++;
return nr;
}
int main()
{
int a;
cin>>a;
cout<<ciur(a);
return 0;
}