杭电OJ题1719 Friend 解题报告

Friend

Time Limit: 1000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 1320    Accepted Submission(s): 643

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!
  
  

 
————————————————————————————————————
通过公式可以推出friend number = (x^2)*(y^3)-1,即如果一个数可以被2整除，当一直除2直到不能整除时如果余下的数可以被3整除，最后可以一直被3整除直至1，那这个数为friend number

/****************************
 *Name:Friend.c
 *Tags:ACM water
 *Note:通过公式可以推出friend number = (x^2)*(y^3)-1,即如果一个数可以被2整除，当一直除2直到不能整除时如果余下的数可以被3整除，最后可以一直被3整除直至1，那这个数为friend number
 ****************************/

#include <stdio.h>

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