HDU 1719--Friend【数学】

最新推荐文章于 2018-08-17 20:00:14 发布

阿阿阿阿_欢

最新推荐文章于 2018-08-17 20:00:14 发布

阅读量345

点赞数

分类专栏：数学 HDOJ

本文链接：https://blog.csdn.net/hpuhjh/article/details/44545621

版权

HDOJ 同时被 2 个专栏收录

183 篇文章 0 订阅

订阅专栏

数学

17 篇文章 0 订阅

订阅专栏

Friend

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

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

Sample Output

  
  
   
   YES!
YES!
NO!

思路：

首先，原式ab+a+b = ab+a+b+1-1 = (a+1)*(b+1)-1

令a = (a1+1)*(a2+1)-1;

b = (b1+1)*(b2+1)-1;

代入原式中可得：n = (a1+1)*(b1+1)*(a2+1)*(b2+1)-1;

因为原式的朋友数都是由1,2推到出来的

所以递推到最底层，那么(a1+1)*(b1+1)*(a2+1)*(b2+1)肯定是2,3的倍数（即是1+1,2+1）

所以最后就是要解决n+1得到的数到底是不是只有2,3这些因子。

#include<cstdio>
#include<cstring>

int main (){
	int n;
	while(scanf("%d",&n)!=EOF){
		n++;
		int p=0;
		if(n==1) p=1;//这里0，进行特殊处理了
		while(n!=1){
			if(n%2==0)
			n=n/2;
			else if(n%3==0)
			n=n/3;
			else {
				p=1;
				break;
			}
		}
		if(p) printf("NO!\n");
		else printf("YES!\n");
	}
	return 0;
}