Cod sursa(job #1922102)
| Utilizator | Data | 10 martie 2017 16:01:02 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 60 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.48 kb |
#include <stdio.h>
using namespace std;
bool ciur[2000001];
void eratostene(int n)
{
int i, j;
for(i = 2; i <= n; i++) {
for(j = 2; i*j <= n; j++)
ciur[i*j] = true;
}
}
int main()
{
freopen("ciur.in","r",stdin);
freopen("ciur.out","w",stdout);
int n, i, nr = 0;
scanf("%d",&n);
ciur[1] = true;
eratostene(n);
for(i=1;i<=n;i++)
if(!ciur[i])
nr++;
printf("%d",nr);
return 0;
}
