Cod sursa(job #1554382)
Utilizator | Data | 21 decembrie 2015 12:24:32 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 20 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.41 kb |
#include <cstdio>
using namespace std;
int n,x,a[10000],nr=0;
void ciur()
{
for (int i=2; i<=n; i++)
{
if(a[i]==0)
{
for (int j=i+i;j<=n;j=j+i)
a[j]=1;
nr++;}
}
}
int main()
{
freopen ("ciur.in","r",stdin);
freopen ("ciur.out","w",stdout);
scanf ("%d",&n);
ciur();
printf("%d",nr);
return 0;
}