smilesundream

摘要： Problem F. ColorDescriptionRecently, Mr. Big recieved n flowers from his fans. He wants to recolor those flowers withm colors. The flowers are put in a l 阅读全文

摘要： C. Coloring Trees time limit per test 2 seconds memory limit per test 256 megabytes input standard input output standard output C. Coloring Trees time 阅读全文

摘要： You are playing a game with your elder brother.First, a number of circles and arrows connecting some pairs of the circles are drawn on the ground.Two 阅读全文

摘要： Problem B Tree of Almost Clean Money Input File: B.in Output File: standard output Time Limit: 4 seconds (C/C++) Memory Limit: 256 megabytes The tree 阅读全文

摘要： 题目链接： 就是一个老鼠在环上一速度v开始绕环走，一只猫从圆心出发，任意时刻圆心，猫，老鼠三者在一条直线上，且速度也是v，求多久后猫抓到老鼠。 参考下题解：需要根据在任意时刻猫的位置在圆心和老鼠之间和图推断出三者共线。。然后进一步假设并证明出猫的轨迹是以r/2为圆心的半圆。。 阅读全文

摘要： Let n be a natural number, n ≤ 8. Consider the following equation:xn + cn−1xn−1 + cn−2xn−2 + . . . + c1x + c0 = 0where cn−1, cn−2, . . . , c1, c0 are 阅读全文

摘要： Necklace Time Limit: 3000/1500 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 2462 Accepted Submission(s): 775 Problem 阅读全文

摘要： Problem L. Landscape ImprovedInput file: landscape.inOutput file: landscape.outLouis L Le Roi-Univers has ordered to improve the landscape that is seen 阅读全文

摘要： A histogram is a simple rectilinear polygon whose boundary consists of two chains such that the upperchain is monotone with respect to the horizontal 阅读全文

摘要： Problem J. JumpInput file: standard inputOutput file: standard outputConsider a toy interactive problem OneMax which is defined as follows. You know an i 阅读全文