Joseph Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 54768 Accepted: 20954 Description The Joseph's problem is notoriously known. For those who are not familiar w…
Count Color Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 46856 Accepted: 14193 Description Chosen Problem Solving and Program design as an optional course, you a…
Battle City Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 9170 Accepted: 3043 Description Many of us had played the game "Battle city" in our childhood, and some …
Web Navigation Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 34423 Accepted: 15368 Description Standard web browsers contain features to move backward and forward…
Heavy Transportation Time Limit: 3000MS Memory Limit: 30000K Total Submissions: 38775 Accepted: 10197 Description Background Hugo Heavy is happy. After the breakdown of the Ca…
木棒 Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 147207 Accepted: 34876 Description 乔治拿来一组等长的木棒，将它们随机地砍断，使得每一节木棍的长度都不超过50个长度单位。然后他又想把这些木棍恢复到为裁截前的状态，但忘记了初始时有多少木棒以及…
背景 影几欺哄了众生了 天以外—— 月儿何曾圆缺 描述 有些东西就如同月光的魔法一般. Luke是爱着vijos的. 他想为自己心爱的东西画些什么. 就画N个圆吧. 把它们的圆心都固定在x轴上. 圆与圆. 为了爱,两两不能相交. 为了爱,它们可以互相贴在一起. 内切或外切,都是允许的. ...
Candies Time Limit: 1500MS Memory Limit: 131072K Total Submissions: 32572 Accepted: 9107 Description During the kindergarten days, flymouse was the monitor of his class. Occas…
题目描述 saruka有一座大大的城堡！城堡里面有n个房间，每个房间上面都写着一个数字p[i]。有一天，saruka邀请他的小伙伴LYL和MagHSK来城堡里玩耍（为什么没有妹子），他们约定，如果某一个人当前站在i号房间里，那么下一步他就要去p[i]号房间，在下一步就要去p[p[i]]号房间。 为了增加趣味性，saruka决定重新书写一下每个房间的…
Day 0 2017.7.25 上午9点，学校门口，出发。 中午十二点多到了日照一中，然后简单的收拾了一下，不知是谁要说出去玩，于是我们约了几个人去了海边，结果被保安拦住了。。。（去年也没这操作），最后还是曹老师过来领着我们出去了。海边真是爽，竟然还有学弟下海了。。。结果玩的太嗨了，差点就没有赶上晚饭。。 ...