2011年浙江大学计算机及软件工程机试真题

2011年浙江大学计算机及 软件学院机试真题感谢王道会员手工录入了这份真题，任何组织和个人无权将其用于任何商业赢利为目的的活动！予人玫瑰，手有余香，王道论坛伴你一路同行！A+B for Matrices (30)Time Limit: 1 Second Memory Limit: 32768 KBThis time, you are supposed to find A+B where A and B are two matrices, and then count the number of zero rows and columns.InputThe input consists of several test cases, each starts with a pair of positive integers M and N (≤10) which are the number of rows and columns of the matrices, respectively. Then 2*M lines follow, each contains N integers in [-100, 100], separated by a space. The first M lines correspond to the elements of A and the second M lines to that of B.The input is terminated by a zero M and that case must NOT be processed.OutputFor each test case you should output in one line the total number of zero rows and columns of A+B.Sample Input2 21 11 1-1 -110 92 31 2 34 5 6-1 -2 -3-4 -5 -6Sample Output15Grading (25)Time Limit: 1 Second Memory Limit: 32768 KBGrading hundreds of thousands of Graduate Entrance Exams is a hard work. It is even harder to design a process to make the results as fair as possible. One way is to assign each exam problem to 3 independent experts. If they do not agree to each other, a judge is invited to make the final decision. Now you are asked to write a program to help this process.For each problem, there is a full-mark P and a tolerance T(<P) given. The grading rules are:• A problem will first be assigned to 2 experts, to obtain G1 and G2. If the difference is within the tolerance, that is, if |G1 - G2| ≤ T, this problem's grade will be the average of G1 and G2.•If the difference exceeds T, the 3rd expert will give G3.•If G3 is within the tolerance with either G1 or G2, but NOT both, then this problem's grade will be the average of G3 and the closest grade.•If G3 is within the tolerance with both G1 and G2, then this problem's grade will be the maximum of the three grades.•If G3 is within the tolerance with neither G1nor G2, a judge will give the final grade G J.InputEach input file contains one test case.Each case occupies a line containing six positive integers: P, T, G1, G2, G3, and G J, as described in the problem. It is guaranteed that all the grades are valid, that is, in the interval [0, P].OutputFor each test case you should output the final grade of the problem in a line. The answer must be accurate to 1 decimal place.Sample Input 120 2 15 13 10 18Sample Output 114.0Sample Input 220 2 15 10 11 16Sample Output 210.5Sample Input 320 2 15 11 13 18Sample Output 315.0Sample Input 420 1 15 11 13 18Sample Output 418.0Median (25)Time Limit: 1 Second Memory Limit: 32768 KBGiven an increasing sequence S of N integers, the median is the number at the middle position. For example, the median of S1={11, 12, 13, 14} is 12, and the median of S2={9, 10, 15, 16, 17} is 15. The median of two sequences is defined to be the median of the non-decreasing sequence which contains all the elements of both sequences. For example, the median of S1 and S2 is 13.Given two increasing sequences of integers, you are asked to find their median.InputEach input file contains one test case.Each case occupies 2 lines, each gives the information of a sequence. For each sequence, the first positive integer N (≤1000000) is the size of that sequence. Then N integers follow, separated by a space. It is guaranteed that all the integers are in the range of long int.OutputFor each test case you should output the median of the two given sequences in a line.Sample Input4 11 12 13 145 9 10 15 16 17Sample Output13Graduate Admission (20)Time Limit: 1 Second Memory Limit: 32768 KBIt is said that in 2011, there are about 100 graduate schools ready to proceed over 40,000 applications in Zhejiang Province. It would help a lot if you could write a program to automate the admission procedure.Each applicant will have to provide two grades: the national entrance exam grade G E, and the interview grade G I. The final grade of an applicant is (G E + G I) / 2. The admission rules are:•The applicants are ranked according to their final grades, and will be admitted one by one from the top of the rank list.•If there is a tied final grade, the applicants will be ranked according to their national entrance exam grade G E. If still tied, their ranks must be the same.•Each applicant may have K choices and the admission will be done according to his/her choices: if according to the rank list, it is one's turn to be admitted; and if the quota of one's mostpreferred shcool is not exceeded, then one will be admitted to this school, or one's other choices will be considered one by one in order. If one gets rejected by all of preferred schools, then this unfortunate applicant will be rejected.•If there is a tied rank, and if the corresponding applicants are applying to the same school, then that school must admit all the applicants with the same rank, even if its quota will be exceeded.InputEach input file contains one test case.Each case starts with a line containing three positive integers: N (≤40,000), the total number of applicants; M (≤100), the total number of graduate schools; and K (≤5), the number of choices an applicant may have.In the next line, separated by a space, there are M positive integers. The i-th integer is the quota of thei-th graduate school respectively.Then N lines follow, each contains 2+K integers separated by a space. The first 2 integers are the applicant's G E and G I, respectively. The next K integers represent the preferred schools. For the sake of simplicity, we assume that the schools are numbered from 0 to M-1, and the applicants are numbered from 0 to N-1.OutputFor each test case you should output the admission results for all the graduate schools. The results of each school must occupy a line, which contains the applicants' numbers that school admits. The numbers must be in increasing order and be separated by a space. There must be no extra space at the end of each line. If no applicant is admitted by a school, you must output an empty line correspondingly.Sample Input11 6 32 1 2 2 2 3100 100 0 1 260 60 2 3 5100 90 0 3 490 100 1 2 090 90 5 1 380 90 1 0 280 80 0 1 280 80 0 1 280 70 1 3 270 80 1 2 3100 100 0 2 4Sample Output0 1035 6 72 81 4。