PAT 1036 Boys vs Girls (25分) 比大小而已
This time you are asked to tell the difference between the lowest grade of all the male students and the highest grade of all the female students.
PAT 1035 Password (20分) 字符替换
To prepare for PAT, the judge sometimes has to generate random passwords for the users. The problem is that there are always some confusing passwords since it is hard to distinguish 1 (one) from l (L in lowercase), or 0 (zero) from O (o in uppercase).
PAT 1034 Head of a Gang (30分) 图的连通分量 + DFS
One way that the police finds the head of a gang is to check people's phone calls. If there is a phone call between A and B, we say that A and B is related.
PAT 1033 To Fill or Not to Fill (25分) 贪心思想
With highways available, driving a car from Hangzhou to any other city is easy. But since the tank capacity of a car is limited, we have to find gas stations on the way from time to time.
PAT 1032 Sharing (25分) 从自信到自闭
To store English words, one method is to use linked lists and store a word letter by letter. To save some space, we may let the words share the same sublist if they share the same suffix.
PAT 1031 Hello World for U (20分) 找规律按行输出即可
Given any string of N (≥5) characters, you are asked to form the characters into the shape of U. For example, helloworld can be printed as:
PAT 1030 Travel Plan (30分) Dijstra +Dfs
A traveler's map gives the distances between cities along the highways, together with the cost of each highway. Now you are supposed to write a program to help a traveler to decide the shortest path between his/her starting city and the destination.
PAT 1029 Median (25分) 有序数组合并
The median of two sequences is defined to be the median of the nondecreasing sequence which contains all the elements of both sequences. For example, the median of S1 and S2 is 13.