Description: 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
To Search:
File list (Check if you may need any files):
makefile
main.cpp
blackboard.h
blackboard.cpp
Download