2013
12-29

# box

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.

The input contains several test cases.Each test case consists of three non-negative integers.

The input contains several test cases.Each test case consists of three non-negative integers.

1 2 3

oh,lucky!

2011-12-17 08:03:16

mark：因为减法和除法包含在加法和乘法内，所以不需要单独判断。取mod注意模数不为0。另外加法和乘法会超int界，用long long。

# include <stdio.h>

typedef long long ll ;

ll test(ll a, ll b, ll c)
{
if (a+b == c||a+c==b||b+c==a) return 1 ;
if (a*b ==c ||a*c == b || b*c ==a) return 1 ;
if (a != 0)
{
if (b%a == c || c%a == b) return 1 ;
}
if (b != 0)
{
if (a%b == c || c%b == a) return 1 ;
}
if (c != 0)
{
if (a%c == b || b%c == a) return 1 ;
}
return 0 ;
}

int main ()
{
ll a, b, c ;
while (~scanf ("%I64d%I64d%I64d", &a, &b, &c))
puts (test(a,b,c) ? "oh,lucky!" : "what a pity!") ;

return 0 ;
}