摘要： Counting BlackTime Limit:1000MSMemory Limit:10000KTotal Submissions:9772Accepted:6307DescriptionThere is a board with 100 * 100 grids as shown below. The left-top gird is denoted as (1, 1) and the right-bottom grid is (100, 100).We may apply three commands to the board:1. WHITE x, y, L // Paint... 阅读全文

摘要： Addition ChainsTime Limit:1000MSMemory Limit:65536KTotal Submissions:4480Accepted:2454Special JudgeDescriptionAn addition chain for n is an integer sequencewith the following four properties:a0 = 1am = na0 and are both valid solutions when you are asked for an addition chain for 5.InputThe input w.. 阅读全文

摘要： Game PredictionTime Limit:1000MSMemory Limit:10000KTotal Submissions:8956Accepted:4269DescriptionSuppose there are M people, including you, playing a special card game. At the beginning, each player receives N cards. The pip of a card is a positive integer which is at most N*M. And there are no two 阅读全文

摘要： Don't Get RookedTime Limit:1000MSMemory Limit:10000KTotal Submissions:2086Accepted:1325DescriptionIn chess, the rook is a piece that can move any number of squares vertically or horizontally. In this problem we will consider small chess boards (at most 4x4) that can also contain walls through wh 阅读全文