说明：  甲乙二人交替在黑板上写正整数，新写的数不能是黑板上已有数的整数组合，写1者就输了。甲写5，乙写6，甲再写…, 问甲/乙有必胜策略吗？用计算机求解这个问题。A 称为a1, a2, …, an的整数组合，当且仅当存在一组非负整数I1, I2, …, In, 使下式成立:A= I1a1 + I2a2 + … + Inan.使用C++ 计算最优策略
(B duo alternately write on the blackboard a positive integer, new written can not be on the blackboard for several combinations of integer, write 1 or lose. A write 5, B write A write ..., Q A/B has a winning strategy? Using a computer to solve this problem. A called a1, a2, ..., an integer combination of AN, if and only if there exists a set of non-negative integers I1, I2, ..., In, so that the following equation is established: A = I1a1 PPLS I2a2 PPLS ... PPLS Inan of use C++ Calculation optimal strategy)