691人阅读 评论(0)

# Friend

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

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=a*b+a+b=a*b+a+b+1-1=(a+1)*(b+1)-1

#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <limits.h>
#include <malloc.h>
#include <ctype.h>
#include <math.h>
#include <string>
#include <iostream>
#include <algorithm>
using namespace std;
#include <stack>
#include <queue>
#include <vector>
#include <deque>
#include <set>
#include <map>
#define INF 999999999
#define eps 0.00001
#define LL __int64
#define pi acos(-1.0)

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

*/

0
0

* 以上用户言论只代表其个人观点，不代表CSDN网站的观点或立场
个人资料
• 访问：143694次
• 积分：3802
• 等级：
• 排名：第8776名
• 原创：240篇
• 转载：6篇
• 译文：0篇
• 评论：21条
友链
阅读排行