Cod sursa(job #1714126)
Utilizator | Data | 7 iunie 2016 15:46:30 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.42 kb |
#include <cstdio>
using namespace std;
int n,nr,i,j;
bool v[2000005];
int main()
{
freopen("ciur.in", "r", stdin);
freopen("ciur.out", "w", stdout);
scanf("%d", &n);
v[0]=v[1]=1;
for(i=2;i*i<=n;i++)
{
if(v[i]==0)
{
for(j=i;j<=n/i;j++)
v[i*j]=1;
}
}
for(i=2;i<=n;i++)
if(v[i]==0)
nr++;
printf("%d",nr);
return 0;
}