Friend number | ||||||
| ||||||
Description | ||||||
Friend number are defined recursively as follows. (1) numbers 1 and 2 are friend number; (2) if a and b are friend numbers, so is ab+a+b; (3) only the numbers defined in (1) and (2) are friend number. Now your task is to judge whether an integer is a friend number.
| ||||||
Input | ||||||
There are multiple test cases. For each test case: Line 1: A nonnegative integer a, 0<=a<=2^30.
| ||||||
Output | ||||||
For each test case, output one line, if a is a friend number, output "YES!", otherwise output "NO!". | ||||||
Sample Input | ||||||
3 13121 12131 | ||||||
Sample Output | ||||||
YES! YES! NO! 设Friendnumber = a+b+ab+1-1,变形为(a+1)(b+1)-1,然后再用(c+1)(d+1)-1代替其中的a,以此类推,直到最后推到a=1,b=2,代入得2^x + 3^y - 1.
|
Hust oj 2118 Friend number(递推)
最新推荐文章于 2022-09-02 15:26:29 发布