hdu2143
来源:互联网 发布:重生网络女主播txt 编辑:程序博客网 时间:2024/06/12 18:58
转自 http://blog.csdn.net/ysc504/article/details/8505630
box
Time Limit: 3000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 5323 Accepted Submission(s): 1023
Problem Description
One day, winnie received a box and a letter. In the letter, there are three integers and five operations(+,-,*,/,%). If one of the three integers can be calculated by the other two integers using any operations only once.. He can open that mysterious box. Or that box will never be open.
Input
The input contains several test cases.Each test case consists of three non-negative integers.
Output
If winnie can open that box.print "oh,lucky!".else print "what a pity!"
Sample Input
1 2 3
Sample Output
oh,lucky!
Author
kiki
Source
HDU 2007-11 Programming Contest
Recommend
威士忌
- #include <stdio.h>
- int fun(__int64 a, __int64 b, __int64 c)
- {
- if(a + b == c)
- return 1;
- if(a * b == c)
- return 1;
- if(a != 0 && b % a == c)
- return 1;
- return 0;
- }
- int main()
- {
- __int64 a, b, c, flag;
- while (~scanf("%I64d%I64d%I64d", &a, &b, &c))
- {
- flag = 0;
- if(fun(a, b, c))
- flag = 1;
- else if(fun(a, c, b))
- flag = 1;
- else if(fun(b, a, c))
- flag = 1;
- else if(fun(b, c, a))
- flag = 1;
- else if(fun(c, b, a))
- flag = 1;
- else if(fun(c, a, b))
- flag = 1;
- if(flag)
- printf("oh,lucky!\n");
- else
- printf("what a pity!\n");
- }
- return 0;
- }
0 0
- hdu2143
- hdu2143 box
- hdu2143 box
- HDU2143 box【水题】
- leetcode做题总结,题目Longest Substring Without Repeating Characters
- GoogleCpp风格指南 5) 其他特性_part1
- 【Pattern Recognition and Machine Learning】p10-11 Mathematical notations
- leetcode做题总结,题目Simplify Path 71
- HDU - 1021ACM
- hdu2143
- Struts2 result type(结果类型)
- Struts2中从一个action内部跳转到另一个action,怎么配置xml
- 使用Genymotion调试出现错误INSTALL_FAILED_CPU_ABI_INCOMPATIBLE解决办法
- 史上最快Android模拟器:Genymotion使用教程
- leetcode做题总结,题目Multiply Strings 43
- Android多渠道打包解决方案(兰贝壳儿)
- 网上商城项目知识点1
- [leetCode] Maximum Gap