其他

Problem DescriptionExcel可以對一組紀錄按任意指定列排序。現請你編寫程式實作類別似功能。 Input測試輸入包含若干測試案例。每個測試案例的第1行包含兩個整數 N (<=100000) 和 C，其中 N 是紀錄的條數，C 是指定排序的列號。以下有 N 行，每行包含一條學生紀錄。每條學生紀錄由學號（6位元字，同組測試中沒有重複的學號）、姓名（不超過8位且不包含空格的字串）、成績（閉區間[0, 100]內的整數）組成，每個項目間用1個空格隔開。當讀到 N=0

Problem DescriptionFor each prefix of a given string S with N characters (each character has an ASCII code between 97 and 126, inclusive), we want to know whether the prefix is a periodic string. That is, for each i (2 <= i <= N) we want to

文章目錄 題目描述輸入格式輸出範例輸入範例輸出

Problem DescriptionProblems in Computer Science are often classified as belonging to a certain class of problems (e.g., NP, Unsolvable, Recursive). In this problem you will be analyzing a property of an algorithm whose classification is not known

Just a HookTime Limit: 4000/2000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 11857 Accepted Submission(s): 5890Problem DescriptionIn the game of DotA, Pudge’s meat hook is actually the most horrible thing for most

Problem DescriptionIgnatius is building an Online Judge, now he has worked out all the problems except the Judge System. The system has to read data from correct output file and user's result file, then the system compare the two files. If the two

Curling 2.0Time Limit: 1000MS Memory Limit: 65536KTotal Submissions: 8204 Accepted: 3410DescriptionOn Planet MM-21, after their Olympic games this year, curling is getting popular. But the rules are somewhat different from ours. The game is played

USACO ORZTime Limit: 5000/1500 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2272    Accepted Submission(s): 812Problem DescriptionLike everyone, cows enjoy variety. Their current fancy is new shapes for pastures.

Borg MazeTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 6885 Accepted: 2306DescriptionThe Borg is an immensely powerful race of enhanced humanoids from the delta quadrant of the galaxy. The Borg collective is the term used to describe the

Light BulbTime Limit: 1 Second      Memory Limit: 32768 KB Compared to wildleopard's wealthiness, his brother mildleopard is rather poor. His house is narrow and he has only one light bulb in his house. Every night, he is wandering in his

Connect the CitiesTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 5956    Accepted Submission(s): 1733Problem DescriptionIn 2100, since the sea level rise, most of the cities disappear. Though

B. Calendartime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputCalendars in widespread use today include the Gregorian calendar, which is the de facto international standard, and is used almost

Problem DescriptionA while ago I had trouble sleeping. I used to lie awake, staring at the ceiling, for hours and hours. Then one day my grandmother suggested I tried counting sheep after I'd gone to bed. As always when my grandmother suggests

Kaitou Kid - The Phantom Thief (2)Time Limit: 10000/5000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 853    Accepted Submission(s): 293Problem

http://codeforces.com/contest/336/problem/A  Vasily the bear has a favorite rectangle, it has one vertex at point(0, 0), and the opposite vertex at point (x, y). Of course, the sides of Vasya's favorite rectangle are parallel to the coordinate

DNA sequenceTime Limit: 15000/5000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 721    Accepted Submission(s): 349Problem DescriptionThe twenty-first century is a biology-technology developing century. We know

魔板Time Limit: 10000/5000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 1401    Accepted Submission(s): 288Problem

Problem DescriptionAcmer in HDU-ACM team are ambitious, especially shǎ崽, he can spend time in Internet bar doing problems overnight. So many girls want to meet and Orz him. But Orz him is not that easy.You must solve this problem first.The problem

Problem Description給你n個整數，請按從大到小的順序輸出其中前m大的數。 Input每組測試資料有兩行，第一行有兩個數n,m(0<n,m<1000000)，第二行包含n個各不相同，且都處於區間[-500000,500000]的整數。 Output對每組測試資料按從大到小的順序輸出前m大的數。 Sample Input5 33 -35 92 213 -644 Sample Output213 92 3HintHint

The Unique MSTTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 17406 Accepted: 6030DescriptionGiven a connected undirected graph, tell if its minimum spanning tree is unique. Definition 1 (Spanning Tree): Consider a connected, undirected