Cod sursa(job #1862009)
| Utilizator | Data | 29 ianuarie 2017 14:34:01 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.31 kb |
#include <iostream>
using namespace std;
int v[200000];
int main()
{
int i,j,x=0,n;
cin>>n;
for(i=2;i<=n;i++)
{
if(v[i]==0)
for(j=i+i;j<=n;j=j+i)
v[j]=1;
}
for(i=2;i<=n;i++)
{
if(v[i]==0)
x++;
}
cout<<x;
return 0;
}
