摘要： Cash MachineTime Limit:1000MSMemory Limit:10000KTotal Submissions:24825Accepted:8701DescriptionA Bank plans to install a machine for cash withdrawal. The machine is able to deliver appropriate @ bills for a requested cash amount. The machine uses exactly N distinct bill denominations, say Dk, k=1,N, 阅读全文

摘要： The Blocks ProblemTime Limit:1000MSMemory Limit:10000KTotal Submissions:4121Accepted:1671DescriptionMany areas of Computer Science use simple, abstract domains for both analytical and empirical studies. For example, an early AI study of planning and robotics (STRIPS) used a block world in which a ro 阅读全文

摘要： 钉子和小球Time Limit:1000MSMemory Limit:10000KTotal Submissions:6669Accepted:1982Description有一个三角形木板,竖直立放，上面钉着n(n+1)/2颗钉子，还有(n+1)个格子（当n=5时如图1）。每颗钉子和周围的钉子的距离都等于d，每个格子的宽度也都等于d，且除了最左端和最右端的格子外每个格子都正对着最下面一排钉子的间隙。让一个直径略小于d的小球中心正对着最上面的钉子在板上自由滚落，小球每碰到一个钉子都可能落向左边或右边（概率各1/2），且球的中心还会正对着下一颗将要碰上的钉子。例如图2就是小球一条可能的路径。我们 阅读全文

摘要： PolygonTime Limit:1000MSMemory Limit:10000KTotal Submissions:4602Accepted:1921DescriptionPolygon is a game for one player that starts on a polygon with N vertices, like the one in Figure 1, where N=4. Each vertex is labelled with an integer and each edge is labelled with either the symbol + (additio 阅读全文

摘要： LITTLE SHOP OF FLOWERSTime Limit:1000MSMemory Limit:10000KTotal Submissions:16755Accepted:7753DescriptionYou want to arrange the window of your flower shop in a most pleasant way. You have F bunches of flowers, each being of a different kind, and at least as many vases ordered in a row. The vases ar 阅读全文