Cod sursa(job #1863686)
Utilizator | Data | 31 ianuarie 2017 09:22:31 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.48 kb |
#include<cstdio>
#define N 1000000
int main()
{
bool c[N+1];
static int n,nr;
freopen("ciur.in","r",stdin);
freopen("ciur.out","w",stdout);
scanf("%d",&n);
for(int i=2; i*i<=n; i++)
{
if(!c[i])
{
for(int j=i*i; j<=n; j+=i)
{
c[j]=true;
}
}
}
for(int i=2; i<=n; i++)
{
if(!c[i])
{
nr++;
}
}
printf("%d",nr);
return 0;
}