摘要： Problem FAdd AllInput: standard inputOutput: standard outputYup!! The problem name reflectsyour task; just add a set of numbers. But you may feel yourselves condescended,to write a C/C++ program just to add a set of numbers. Such a problem willsimply question your erudition. So, let’s add some flavo 阅读全文

摘要： Problem B: AntsAn army of ants walk on a horizontal pole of length l cm, each with a constant speed of 1 cm/s. When a walking ant reaches an end of the pole, it immediatelly falls off it. When two ants meet they turn back and start walking in opposite directions. We know the original positions of a. 阅读全文

摘要： Minimal coverageThe ProblemGiven several segments of line (int the X axis) with coordinates [Li,Ri]. You are to choose the minimal amount of them, such they would completely cover the segment [0,M].The InputThe first line is the number of test cases, followed by a blank line.Each test case in the in 阅读全文

摘要： Ecological Bin PackingBackgroundBin packing, or the placement of objects of certain weights into different bins subject to certain constraints, is an historically interesting problem. Some bin packing problems are NP-complete but are amenable to dynamic programming solutions or to approximately opti 阅读全文

摘要： Problem CEditor NottoobadCompany Macrohard has released it’s new version of editor Nottoobad, which can understand a few voice commands. Unfortunately, there are only two voice commands that it can understand – “repeat the last word”, “delete the last symbol”. However, when one uses “repeat the last 阅读全文