其他

SquareTime Limit: 10000/5000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 6032 Accepted Submission(s): 1937Problem DescriptionGiven a set of sticks of various lengths, is it possible to join them end-to-end to form

Tempter of the BoneTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 54766 Accepted Submission(s): 14764Problem DescriptionThe doggie found a bone in an ancient maze, which fascinated him a lot.

Problem Description寒假的時候，ACBOY要去拜訪很多朋友，恰巧他所有朋友的家都處在座標平面的X軸上。ACBOY可以任意選擇一個朋友的家開始訪問，但是每次訪問後他都必須回到出發點，然後才能去訪問下一個朋友。比如有4個朋友，對應的X軸座標分別為1， 2， 3， 4。當ACBOY選擇座標為2的點做為出發點時，則他最終需要的時間為 |1-2|+|2-2|+|3-2|+|4-2| =

Prime Ring ProblemTime Limit: 4000/2000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 20489 Accepted Submission(s): 9159Problem DescriptionA ring is compose of n circles as shown in diagram. Put natural number 1, 2, .

疊筐Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 10111 Accepted Submission(s): 2548Problem

排序Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 27961 Accepted Submission(s): 7710Problem Description輸入一行數字，如果我們把這行數字中的‘5’都看成空格，那麼就得到一行用空格分割的若干非負整數（可能有些整數以‘0’開頭，這些頭部的‘0’應該被忽略掉，除非這個整數就是由若干個‘0’組成的，

Problem

今年暑假不ACTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 20752 Accepted Submission(s): 10848Problem Description“今年暑假不AC？”“是的。”“那你幹什麼呢？”“看世界盃呀，笨蛋！”“@#$%^&*%...”確實如此，世界盃來了，球迷的節日也來了，估計很多ACMer也會拋開電腦，

Is It A Tree?Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 10559 Accepted Submission(s): 2429Problem DescriptionA tree is a well-known data structure that is either empty (null, void, nothing)

Problem Description古希臘數學家畢達哥拉斯在自然數研究中發現，220的所有真約數(即不是自身的約數)之和為： 1+2+4+5+10+11+20+22+44+55+110＝284。 而284的所有真約數為1、2、4、71、

題目串連： http://acm.hdu.edu.cn/showproblem.php?pid=1598find the most comfortable roadTime Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2718 Accepted Submission(s): 1153Problem

PartitionTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1049 Accepted Submission(s): 427Problem DescriptionDefine f(n) as the number of ways to perform n in format of the sum of some positive

Fibbonacci NumberTime Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 10751 Accepted Submission(s): 5472Problem DescriptionYour objective for this question is to develop a program which will generate a

A == B ?Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 49760 Accepted Submission(s): 7654Problem DescriptionGive you two numbers A and B, if A is equal to B, you should print "YES", or print "NO".

Coin ChangeTime Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 10924 Accepted Submission(s): 3669Problem DescriptionSuppose there are 5 types of coins: 50-cent, 25-cent, 10-cent, 5-cent, and 1-cent.

Proud MerchantsTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 131072/65536 K (Java/Others)Total Submission(s): 1899    Accepted Submission(s): 762Problem DescriptionRecently, iSea went to an ancient country. For such a long time, it was the

Problem Description有一樓梯共M級，剛開始時你在第一級，若每次只能跨上一級或二級，要走上第M級，共有多少種走法？ Input輸入資料首先包含一個整數N，表示測試執行個體的個數，然後是N行資料，每行包含一個整數M（1<=M<=40）,表示樓梯的級數。 Output對於每個測試執行個體，請輸出不同走法的數量 Sample Input223 Sample Output12  import java.io.BufferedInputStream;import

迷宮問題Time Limit: 1000MS Memory Limit: 65536KTotal Submissions: 6322 Accepted: 3673Description定義一個二維數組： int maze[5][5] = {0, 1, 0, 0, 0,0, 1, 0, 1, 0,0, 0, 0, 0, 0,0, 1, 1, 1, 0,0, 0, 0, 1,

飯卡Time Limit: 5000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 7572    Accepted Submission(s): 2582Problem

   分酒 泊松是法國數學家、物理學家和力學家。他一生致力科學事業，成果頗多。有許多著名的公式定理以他的名字命名，比如機率論中著名的泊松分布。    有一次閑暇時，他提出過一個有趣的問題，後稱為：“泊松分酒”。在我國古代也提出過類似問題，遺憾的是沒有進行徹底探索，其中流傳較多是：“韓信走馬分油”問題。    有3個容器，容量分別為12升，8升，5升。其中12升中裝滿油，另外兩個空著。要求你只用3個容器操作，最後使得某個容器中正好有6升油。    下面的列表是可能的操作狀態記錄：12,0,04,8