Pagini recente » Cod sursa (job #2211818) | Cod sursa (job #2504010) | Cod sursa (job #2039258) | Cod sursa (job #1248548) | Cod sursa (job #2000800)
///Ciurul lui Eratosthenes
#include <stdio.h>
#include <stdlib.h>
#define MAX 2000000
int n;
char ciur[MAX];
int main()
{
freopen("ciur.in", "r", stdin);
freopen("ciur.out", "w", stdout);
int i, j, nr = 0;
scanf("%d",&n);
for(int i = 2 ; i * i <= n ; i++)
for(int j = 2 ; i * j <= n ; j ++)
ciur[j] = 1;
for( i = 2; i<= n; i++)
if(ciur[i]==0)
nr++;
printf("%d",nr);
return 0;
}