Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include<stdio.h>
- #include<math.h>
- bool prime[5001];
- int n , s , i , j;
- void rozl(int n) {
- bool k = false;
- int i;
- if (prime[n] == false) {
- s++;
- n--;
- if (prime[n] == false) {
- s += n;
- k = true;
- }
- }
- if (k == false) {
- for (i = sqrt(n) ; i <= n ; i++)
- if (n % i == 0) {
- break;
- }
- rozl(i);
- rozl(n / i);
- }
- }
- int main() {
- scanf("%i",&n);
- prime[1] = false;
- for (i = 2 ; i <= sqrt(n) ; i++)
- if (prime[i] == false)
- for (j = 2 ; j <= n / i ; j++)
- prime[j * i] = true;
- rozl(n);
- printf("%i",s);
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement