Hdoj 1719 Friend 【数学】

Friend

Time Limit: 1000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)

Total Submission(s): 2003    Accepted Submission(s): 1007

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都是friend number

ab+a+b = (a+1)(b+1)-1;  设n是friend number 所以 n = (a+1)(b+1)-1;  但是a，b不一定只是1和2.也可以是(a+1)(b+1)-1，仔细推导一下就可知道friend number 一定是

（a+1）n次方和（b+1）m次方的乘积-1，（又因为1， 2是friend number）故 friend number 一定是2的n次方和3的m次方的乘积-1， 我们只需要令给出的n+1， 在对2和3除，看结果是否为1即可

代码：

#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <queue>
#include <vector>
using namespace std;
const int M = 105;
#define LL __int64

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