Pagini recente » Cod sursa (job #1840966) | Cod sursa (job #1154062) | Monitorul de evaluare | Cod sursa (job #1840943) | Cod sursa (job #1840978)
#include<stdio.h>
#include<stdbool.h>
int main(void) {
freopen("ciur.in", "r", stdin);
freopen("ciur.out", "w", stdout);
int N;
int primes = 0;
scanf("%d", &N);
bool numbers[N];
for(int i = 2; i <= N; i++){
numbers[i] = true;
}
int i = 2;
while(i<=N) {
if(numbers[i]) {
++primes;
for(int j=i*2;j<=N;j+=i) {
numbers[j]=false;
}
}
i++;
while(!numbers[i]) i++;
}
printf("%d\n", primes);
return 0;
}