分类目录:编程竞赛

以下是分类 编程竞赛 下的所有文章

CCC 竞赛 2013S5: Factor Solitaire

对于这个问题,我们的思路仍然是。。。倒过来考虑~   In the game of Factor Solitaire, you start with the number 1, and try to change it to some given target number n by repeatedly using the following operation. In each step, if c is your current number, you split it into two positive factors ……

CCC 竞赛 2010S5: Nutrient Tree

  There is a binary tree with l leaves (1 ≤ l ≤ 50) where each leaf k has an amount of nutrients nk (1 ≤ nk ≤ 10000) that it produces. The branches (which you can think of as edges) of this binary tree limit the maximum amount of nutrients that can flow to the root of the tree. You have X gr……

CCC竞赛 2015S3: Gates

  Problem Description For your birthday, you were given an airport. The airport has G gates, numbered from 1 to G. P planes arrive at the airport, one after another. You are to assign the ith plane to permanently dock at any gate 1, . . . , g i (1 ≤ g i ≤ G), at which no previous plane has d……

CCC竞赛 2015S2: Jerseys

Problem Description A school team is trying to assign jerseys numbered 1, 2, 3, . . . , J to student athletes. The size of each jersey is either small (S), medium (M) or large (L). Each athlete has requested a specific jersey number and a preferred size. The athletes will not be satisfied with a ……

CCC竞赛 2015S1: Zero That Out

Problem Description Your boss has asked you to add up a sequence of positive numbers to determine how much money your company made last year. Unfortunately, your boss reads out numbers incorrectly from time to time. Fortunately, your boss realizes when an incorrect number is read and says “zero”, ……

CCC竞赛 2011S5: Switches

Problem Description You are walking by a row of K (4 ≤ K ≤ 25) lights, some of which are on and some of which are off. In this initial configuration, there is no consecutive sequence of four lights that are on. Whenever four or more consecutive lights are on, the lights in that consecutive block w……

CCC竞赛 2014S5: Lazy Fox

Problem Description You have a pet Fox who loves treats. You have N neighbours at distinct locations (described as points on the Cartesian plane) which hand out treats to your pet Fox, and each neighbour has an unlimited number of treats to give out. The origin (which is where the Fox starts) will……