摘要：Building bridgesTime Limit: 3000/1000 MS (Java/Others)Memory Limit: 65535/32768 K (Java/Others)Total Submission(s): 45Accepted Submission(s): 39Problem DescriptionHululu and Cululu are two pacific ocean countries made up of many islands. These two country has so many years of friendship so they deci
阅读全文
摘要：TransformationTime Limit: 15000/8000 MS (Java/Others)Memory Limit: 65535/65536 K (Java/Others)Total Submission(s): 49Accepted Submission(s): 16Problem DescriptionYuanfang is puzzled with the question below:There are n integers, a1, a2, …, an. The initial values of them are 0. There are four kinds of
阅读全文
摘要：RobotTime Limit: 8000/4000 MS (Java/Others)Memory Limit: 102400/102400 K (Java/Others)Total Submission(s): 158Accepted Submission(s): 46Problem DescriptionMichael has a telecontrol robot. One day he put the robot on a loop with n cells. The cells are numbered from 1 to n clockwise.At first the robot
阅读全文
摘要：Integer PartitionTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 22Accepted Submission(s): 15Problem DescriptionGiven n, k, calculate the number of different (unordered) partitions of n such that no part is repeated k or more times. InputFirst line
阅读全文
摘要：UnshuffleTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 148Accepted Submission(s): 43Special JudgeProblem DescriptionA shuffle of two strings is formed by interspersing the characters into a new string, keeping the characters of each string in ord
阅读全文
摘要：TriangulationTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 96Accepted Submission(s): 29Problem DescriptionThere are n points in a plane, and they form a convex set. No, you are wrong. This is not a computational geometry problem. Carol and Dave a
阅读全文
摘要：MU PuzzleTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 134Accepted Submission(s): 71Problem DescriptionSuppose there are the symbols M, I, and U which can be combined to produce strings of symbols called "words". We start with one word
阅读全文
摘要：Cut PiecesTime Limit: 4000/2000 MS (Java/Others)Memory Limit: 131072/65536 K (Java/Others)Total Submission(s): 133Accepted Submission(s): 62Problem DescriptionSuppose we have a sequence of n blocks. Then we paint the blocks. Each block should be painted a single color and block i can have color 1 to
阅读全文
摘要：GSMTime Limit: 4000/2000 MS (Java/Others)Memory Limit: 65535/32768 K (Java/Others)Total Submission(s): 622Accepted Submission(s): 206Problem DescriptionXiao Ming is traveling around several cities by train. And the time on the train is very boring, so Xiao Ming will use the mobile Internet. We all k
阅读全文
摘要：ReincarnationTime Limit: 6000/3000 MS (Java/Others)Memory Limit: 131072/65536 K (Java/Others)Total Submission(s): 843Accepted Submission(s): 283Problem DescriptionNow you are back,and have a task to do:Given you a string s consist of lower-case English letters only,denote f(s) as the number of disti
阅读全文
摘要：Swipe BoTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 455Accepted Submission(s): 111Problem Description“Swipe Bo” is a puzzle game that requires foresight and skill.The main character of this game is a square blue tofu called Bo. We can swipe up
阅读全文
摘要：Who's Aunt ZhangTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 19Accepted Submission(s): 16Problem DescriptionAunt Zhang, well known as 张阿姨, is a fan of Rubik’s cube. One day she buys a new one and would like to color it as a gift to send to T
阅读全文
摘要：Palindrome subsequenceTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 131072/65535 K (Java/Others)Total Submission(s): 88Accepted Submission(s): 26Problem DescriptionIn mathematics, a subsequence is a sequence that can be derived from another sequence by deleting some elements without changing t
阅读全文
摘要：Strongly connectedTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 53Accepted Submission(s): 15Problem DescriptionGive a simple directed graph with N nodes and M edges. Please tell me the maximum number of the edges you can add that the graph is sti
阅读全文
摘要：GroupTime Limit: 4000/2000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 17Accepted Submission(s): 5Problem DescriptionThere are n men ,every man has an ID(1..n).their ID is unique. Whose ID is i and i-1 are friends, Whose ID is i and i+1 are friends. These n men stan
阅读全文
摘要：HeheTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 33Accepted Submission(s): 22Problem DescriptionAs we all know, Fat Brother likes MeiZi every much, he always find some topic to talk with her. But as Fat Brother is so low profile that no one know
阅读全文
摘要：Fliping gameTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 46Accepted Submission(s): 35Problem DescriptionAlice and Bob are playing a kind of special game on an N*M board (N rows, M columns). At the beginning, there are N*M coins in this board wit
阅读全文
摘要：奔小康赚大钱Time Limit: 1000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2129Accepted Submission(s): 923Problem Description传说在遥远的地方有一个非常富裕的村落,有一天,村长决定进行制度改革：重新分配房子。这可是一件大事,关系到人民的住房问题啊。村里共有n间房间,刚好有n家老百姓,考虑到每家都要有房住（如果有老百姓没房子住的话，容易引起不安定因素），每家必须分配到一间房子且只能得到一间房子。另一方面,村长和另
阅读全文
摘要：PhalanxTime Limit: 10000/5000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 363Accepted Submission(s): 170Problem DescriptionToday is army day, but the servicemen are busy with the phalanx for the celebration of the 60th anniversary of the PRC.A phalanx is a matrix of
阅读全文
摘要：Check CornersTime Limit: 2000/10000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1362Accepted Submission(s): 503Problem DescriptionPaul draw a big m*n matrix A last month, whose entries Ai,j are all integer numbers ( 1 #include #include #include using namespace std;i
阅读全文
