acm
POJ2499
POJ2499 Binary Tree Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 6424 Accepted: 2954 Description Background Binary trees are a common data structure in computer science. In this problem we will look at an infinite binary tree where the nodes contain a pair of integers. The tree is constructed like this:
POJ2234
POJ2234 Matches Game Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 9306 Accepted: 5372 Description Here is a simple game. In this game, there are several piles of matches and two players. The two player play in turn. In each turn, one can choose a pile and take away arbitrary number of matches from the pile (Of course the number of matches, which is taken away, cannot be zero and cannot be larger than the number of matches in the chosen pile). If after a player’s turn, there is no match left, the player is the winner. Suppose that the two players are all very clear. Your job is to tell whether the player who plays first can win the game or not.
POJ3295
POJ3295 Tautology Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 10897 Accepted: 4136 Description WFF ‘N PROOF is a logic game played with dice. Each die has six faces representing some subset of the possible symbols K, A, N, C, E, p, q, r, s, t. A Well-formed formula (WFF) is any string of these symbols obeying the following rules:
POJ1753
原题POJ1753 Flip Game Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 36003 Accepted: 15706 Description Flip game is played on a rectangular 4×4 field with two-sided pieces placed on each of its 16 squares. One side of each piece is white and the other one is black and each piece is lying either it’s black or white side up. Each round you flip 3 to 5 pieces, thus changing the color of their upper side from black to white and vice versa. The pieces to be flipped are chosen every round according to the following rules: