Cod sursa(job #2605615)
Utilizator | Data | 25 aprilie 2020 15:46:59 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 80 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.43 kb |
#include <stdio.h>
using namespace std;
short prim[2000001];
int k, x;
int main()
{
freopen("ciur.in", "r", stdin);
freopen("ciur.out", "w", stdout);
scanf("%d", &x);
prim[0]=1;
prim[1]=1;
for(int i=2;i<=x;i++)
{
if(prim[i]==0)
{
++k;
for(int j=i+i;j<=x;j+=i)
prim[j]=1;
}
}
printf("%d\n", k);
return 0;
}