摘要：
Problem J. Let Sudoku Rotate Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 262144/262144 K (Java/Others)Total Submission(s): 0 Accepted Submiss 阅读全文
摘要：
Maximum Element In A Stack 20.91% 10000ms 262144K As an ACM-ICPC newbie, Aishah is learning data structures in computer science. She has already known 阅读全文
摘要：
FatMouse and Cheese FatMouse has stored some cheese in a city. The city can be considered as a square grid of dimension n: each grid location is label 阅读全文
摘要：
Games Time Limit: 1000 ms Memory Limit: 65536 KiB Submit Statistic Problem Description Alice and Bob are playing a stone game. There are nn piles of s 阅读全文
摘要：
Maze This story happened on the background of Star Trek. Spock, the deputy captain of Starship Enterprise, fell into Klingon’s trick and was held as p 阅读全文
摘要：
Covering Covering Bob's school has a big playground, boys and girls always play games here after school. To protect boys and girls from getting hurt w 阅读全文
摘要：
Knapsack problem Given a set of n items, each with a weight w[i] and a value v[i], determine a way to choose the items into a knapsack so that the tot 阅读全文
摘要：
Simple String Problem Recently, you have found your interest in string theory. Here is an interesting question about strings. You are given a string S 阅读全文
摘要：
Mountain Number One integer number x is called "Mountain Number" if: (1) x>0 and x is an integer; (2) Assume x=a[0]a[1]...a[len-2]a[len-1](0≤a[i]≤9, a 阅读全文
