Description: acm questions, post office recently launched a commemorative set of commemorative stamps, stamps are a total of N sheets, stamps face value varies in numerical order of 1 minute, 2 minutes, ......, N points. Xiao Ming is a stamp collector, he was very fond of the stamps, but now his body is only M points, and not enough to have bought a full set. He hoped that try to buy the best just spend all the money. As a philatelists, Xiao Ming not want to buy stamps numbers off, so Xiao Ming intend to buy a par value b min b-a+1 continuous sheets of stamps, and the total value of M points exactly. We use different algorithms to obtain all eligible programs to [a, b] in the form of output.
To Search:
File list (Check if you may need any files):
粤玲\Debug\Stamp.exe
....\.....\Stamp.ilk
....\.....\Stamp.obj
....\.....\Stamp.pch
....\.....\Stamp.pdb
....\.....\vc60.idb
....\.....\vc60.pdb
....\Stamp.cpp
....\Stamp.dsp
....\Stamp.dsw
....\Stamp.ncb
....\Stamp.opt
....\Stamp.plg
....\stampin.txt
....\stampout.txt
....\Debug
粤玲
Download