Beautiful Divisors
CodeForces - 893BRecently Luba learned about a special kind of numbers that she calls beautiful numbers. The number is called beautiful iff its binary representation consists ofk?+?1 consecutive ones, and then k consecutive zeroes.
Some examples of beautiful numbers:
- 12 (110);
- 1102 (610);
- 11110002 (12010);
- 1111100002 (49610).
More formally, the number is beautiful iff there exists some positive integer k such that the number is equal to (2k?-?1)?*?(2k?-?1).
Luba has got an integer number n, and she wants to find its greatest beautiful divisor. Help her to find it!
The only line of input contains one number n (1?≤?n?≤?105) — the number Luba has got.
Output one number — the greatest beautiful divisor of Luba's number. It is obvious that the answer always exists.
Input
3
Output
1
Input
992
Output
496#include <stdio.h>int main() {int n,i,x= 1,y = 1,b,sum;scanf("%d",&n);for(i = 1;i < 20;i++){y = x;x *= 2;if(n % ((x - 1)*y) == 0)sum = (x - 1)*y;if(n < (x - 1)*y)break;}printf("%d\n",sum);return 0;
}