ANARC08E  Relax! It is just a game
You: What's the score? Did I miss much?
Me: It's 21 for elAhli and the second half just started. The first half was quite boring.
You: Who scored first? elAhli or ezZamalek?
Me: What difference does it make?
You: Big difference! I can predict the outcome of the match if I knew the order of which goals were scored in the first half.
Me: What do you mean?
You: It's 21 for elAhli, right? One of three things could have happened: elAhli scored two goals then ezZamalek scored; Or, elAhli scored its first goal, then ezZamalek, then elAhli again; Or, ezZamalek scored first, then elAhli scored its two goals.
Me: So?!! I still don't understand what difference does that make? It's still 21 for elAhli! Why don't you just relax and let us continue watching the game in peace.
You: You don't understand!! I believe the probability of who'll win depends on the order of how goals were scored. Now I have to predict the outcome for 3 possibilities.
Me: And what if the score was 32? What would you have done then?
You: I would have to work for 5 different possibilities. No?
Me: Of course not! The number of possibilities isn't always equal to the sum.
You: Can you tell me when will it be equal to the sum?
Me: You're a programmer, why don't you write a program that counts the number of possibilities and compare it to the sum?
You: I don't have the time, I want to watch the match. Besides, I have nine other problems to worry about.
Me: I'll give you a hint. The possibilities will be equal to the sum only if one of the teams scored a certain number of goals.
Input
Your program will be tested on one or more test cases. Each test case specifies two natural numbers (A and B ) (separated by one or more spaces) representing the score of the first half. No team will be able to score more than 10 goals. The last line of the input file contains two 1's (which is not part of the test cases.)
Output
Format For each test case where the number of possibilities is equal to the sum, print:
A+B=C
Where A and B are as above and C is their sum. If the number of possibilities is not equal to the sum, replace the '=' sign with '!=' (without the quotes.)
Example
Input: 2 1 1 0 1 1 Output: 2+1=3 1+0=1
hide comments
bu_hridoy:
20200327 07:00:33
Don't say it's not a dp problem. I have solved it using dp. Last edit: 20200327 07:00:55 

one_piece_:
20180614 19:50:31
NO where near a DP problem!!!AC in one go!!! 

akk007:
20180523 09:22:33
don't forget to consider that choosing 0,0 will result in 1 

jainaman1398:
20180216 07:49:30
can be solved with or without dp


sravya_123:
20171209 17:01:11
AC in one go no need of DP!!


mudra03:
20170904 18:23:59
Just find the number and get an AC!! 

vaibz:
20170512 20:48:48
*Spoiler Alert*


zura_coda:
20170128 14:45:04
Find the pattern with combinatorics or just look at the last line if you're too lazy 

rraj001:
20161014 09:32:50
No dp! 

dwij28:
20161008 19:51:24
DP here refers to Dull Problem .._/\_ 
Added by:  Ahmed Aly 
Date:  20090704 
Time limit:  1s 
Source limit:  50000B 
Memory limit:  1536MB 
Cluster:  Cube (Intel G860) 
Languages:  All except: ERL JSRHINO NODEJS PERL6 VB.NET 
Resource:  ANARC 2008 