hdu 2143

来源:互联网 发布:算法精解 pdf 百度云 编辑:程序博客网 时间:2024/05/28 23:21

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");elseprintf("what a pity!\n");}return 0;}

原创粉丝点击