Friend
Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 2812 Accepted Submission(s): 1461
Problem 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 several lines in input, each line has a nunnegative integer a, 0<=a<=2^30.
Output
For the number a on each line of the input, if a is a friend number, output “YES!”, otherwise output “NO!”.
Sample Input
31312112131
Sample Output
YES!YES!NO!
题意:现在有一种朋友数字的定义是如果a和b都是这样的数字,那么a*b+a+b也是朋友数字,(a可以等于b)
现在确定1和2已经是朋友数字了,给你一个数字让你确定这个数字 是否为朋友数字。
思路:这道题的公式是可以化简的,a*b+a+b = a*(b+1)+b+1-1 = (a+1)*(b+1)-1;
假设:因为a为朋友数字,所以假设a是由这个式子推来的,a由a1和b1推来的,假设b由a2和b2推来的,(a1,a2,b1,b2都是朋友数字)那么有a=(a1+1)*(b1+1)-1; b=(a2+1)*(b2+1)-1;
带入上式得 ((a1+1)*(b1+1)-1+1)*((a2+1)*(b2+1)-1+1)-1;及 (a1+1)*(b1+1)*(a2+1)*(b2+1)-1;
式子中的a1,b1,a2,b2如果不是1或2的话,那么就一定还能进行拆分,所以到最后会拆分成()*()*()*()-1;
的形式,()的数量不确定,也就是说最后都会拆成1或者是2,那么这个朋友数字为2^n*3^m-1;
n和m未知,这种形式。到这里问题就解决了(特例:0要特判,NO!)
代码:
int main()
{
int t;
while(~scanf("%d",&t))
{
if(t==0)
{
printf("NO!\n");
continue;
}
t++;
while(t%2==0)
{
t>>=1;
}
while(t%3==0)
{
t=t/3;
}
if(t==1)
printf("YES!\n");
else
printf("NO!\n");
}
}