Description: Today TheBeet go to the door in what the Shandong pancake stalls to buy pancake to his pay when he discovered that his wallet contained only a 100. So he needs to break this 100 money to open, but TheBeet do not like coins, another for some reason, TheBeet do not like 20 yuan notes, while inside there are too many do not like a banknote wallet, so he hopes to get minimize the number of notes. Given the number of stall holders of existing notes, seeking to spread primarily through irregular TheBeet how to meet his request.
To Search:
- [zhuangpeixian] - the program is a dynamic programming sol
- [Petri_Nets] - a Petri net model on the books. Petri ne
- [ycthjhsf] - Genetic annealing evolutionary algorithm
- [2008-0577] - ----- SPEA2 article based on the Flexibl
- [theAssemblyLine] - This procedure is from the book printed
File list (Check if you may need any files):
1032\1032.cpp
....\1032.exe
....\1032.txt
1032