hdu1719(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!

解题思路::

n=a*b+a+b---->;n+1=(a+1)*(b+1);---->1=(n+1)/((a+1)*(b+1));

一开始a=1,b=2;--->a+1=2;b+1=3;所以只要n为友好数,那么n+1一定能整除2和3

#include<stdio.h>

int main()
{
    int n;
    while(scanf("%d",&n)==1)
    {
        if(n>0)
        n++;
        if(n>0)
        while(n%2==0||n%3==0)
        {
            if(n%2==0)
            n/=2;

            if(n%3==0)
            n/=3;
        }
        if(n==1)
        {
            printf("YES!\n");
        }
        else
        printf("NO!\n");
    }
    return 0;
}