friend(hdoj 1719)
来源:互联网 发布:程序员的样子 编辑:程序博客网 时间:2024/05/22 13:28
Friend
Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2207 Accepted Submission(s): 1108
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.
(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
31312112131
Sample Output
YES!YES!NO!
Source
2007省赛集训队练习赛(2)
Recommend
lcy | We have carefully selected several similar problems for you: 1905 2082 1073 1715 1257
/*刚刚看到这道题的时候一心只想着打表,但是试了几次都超时,没想到有这种规律....c=ab+b+a=b(a+1)+b=(b+1)(a+1)-1,c+1=(b+1)(a+1),所以输入的数加一之后,它只要是2或者3的倍数就可以*/#include<stdio.h>#include<string.h> int main(){int n;while(scanf("%d",&n)!=EOF){if(n<1){printf("NO!\n");}else{n=n+1;while(n%2==0)n=n/2;while(n%3==0)n=n/3;if(n==1)printf("YES!\n");else printf("NO!\n");}}}
0 0
- friend(hdoj 1719)
- hdoj 1719 Friend(公式)
- HDOJ 题目1719 Friend(数学)
- Hdoj 1719 Friend 【数学】
- HDoj-1719-Friend-巧算巧解
- hdoj 1719 Friend
- HDOJ--1719--Friend
- hdoj 1719 Friend【数学题】
- hdoj 1719 Friend
- hdoj-1719-Friend
- hdoj 1719 Friend(找规律)
- HDOJ 1719 Friend(数学归纳)
- hdu(1719)Friend
- Friend(1719)
- Friend(1719)
- hdoj 6152 Friend-Graph
- HDOJ 题目4460 Friend Chains(树的最长链)
- friend(杭电1719)
- TLD(Tracking-Learning-Detection)学习与源码理解之(分类器)
- 自学QT之QMutableListIterator
- HDOJ--1097--A hard puzzle
- ORA-01788: 此查询块中要求 CONNECT BY 子句
- 【LeetCode】(59)Spiral Matrix II(Medium)
- friend(hdoj 1719)
- bbs---之spring mvc
- 黑马程序员----Java中的IO流学习笔记2
- 对抗赛 解题报告
- 自定义EditText实现未输入文字动画提醒效果
- 横论机器学习算法
- linux 创建NFS服务
- 【POJ3159】【差分系统】【dij+priority_queue】
- codeforces 401D D. Roman and Numbers(状态压缩dp+数论)