Cod sursa(job #1906677)
| Utilizator | Data | 6 martie 2017 15:43:07 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.46 kb |
#include <bits/stdc++.h>
using namespace std;
bool a[2000001];
int n,nr;
void cit()
{
freopen("ciur.in","r",stdin);
freopen("ciur.out","w",stdout);
}
void ciur()
{
a[1]=1;
for(int i=2;i<=n;i++)
if(a[i]==0)
for(int j=2;j*i<=n;j++)
a[i*j]=1;
}
int main()
{
cit();
scanf("%d",&n);
ciur();
for(int i=2;i<=n;i++)
if(a[i]==0) nr++;
printf("%d\n",nr);
return 0;
}
