HDU 1719 Friend(规律)

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
3
13121
12131

Sample Output
YES!
YES!
NO!

1和2 是朋友数
如果a和b是两个朋友数， 那么满足 m = a*b+a+b

同时 m = a*b+a+b –>
m = (a+1)(b+1)-1
–> m+1 = (a+1)(b+1)

所有朋友数都是由 1， 2 演变而来 那么所有朋友数+1 一定 对 （1+1） 和（2+1） 整除完 得 1 这就是规律

但有个特例就是0 0+1 也满足条件 但题目要说了 只有 1 2 所有0需要特判

code：

#include<cstdio>
#include<cstring>
#include<cmath>
#include<algorithm>
using namespace std;

int main()
{
    int n;
    while(~scanf("%d",&n))
    {
        if(n==0)
        {
            printf("NO!\n");
            continue;
        }
        n++;
        while(n%2==0)
        {
            n=n/2;
        }
        while(n%3==0)
        {
            n=n/3;
        }
        if(n==1)
        {
            printf("YES!\n");
        }
        else
        {
            printf("NO!\n");
        }
    }
    return 0;
}