以下是版上朋友门回答对的总结 ４点

1)- allow me define losing hand as whenever you create this hand to your opponent, you will win. 定义"必须回避的数据库" . 这样大家说话统一一些. :)
such as 0-0-0
such as 0-1-1, 0-2-2, 0-3-3, 0-4-4...0-100000-100000
such as 1-2-3
such as 1-4-5
such as 2-4-6
Please NOTE 1-3-4 is NOT!

2)- 0-A-A is a losinghand - 任何时候，不能留给对手有两堆数目相等的情况;

3) 1-A-(A+1). could be a winning hand or a losing hand, Any one can give me a final answer ? (one-two star question- going fast, see my hint in 1) )!

4) Min-Max theory - 此题可以勉强归类Min-Max,
but you do not need to know this theory to solve the problem (via programming); and actually, the core part in the Min-Max theory will be canceled out in this problem... beacuse EACH CASE SHOULD BE EITHER A LOSING HAND OR WINNING HAND (can be changed into a losing hand by just one move- hint)!
5) 还有一点， 我先不说，等公布答案３时说。

－ 谢谢大家!