Cod sursa(job #1810735)
Utilizator | Data | 20 noiembrie 2016 15:13:40 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 20 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.43 kb |
#include <cstdio>
using namespace std;
int n,d;
bool a[100];
int main()
{
freopen ("ciur.in","r",stdin);
freopen ("ciur.out","w",stdout);
scanf("%i",&n);
for(int i=2;i<=n;i++)
a[i]=true;
for(int i=2;i<=n;i++)
{
if(a[i]==true)
{
d++;
for(int j=i+i;j<=n;j+=i)
a[j]=false;
}
}
printf("%i",d);
return 0;
}