第4题
A magician has one hundred cards 数ed 到 . He puts them in到three boxes, red, white 且blue, 每个nonempty. A member selects two boxes, chooses one card 从each, 且announces their 和. Given th是和, magician identifies box 从which no card was chosen. How many assignments 的cards 到three boxes make th是always possible?