PAT甲级
文章平均质量分 69
chantec
人生本无止境,前行何须彷徨。
展开
-
1007 Maximum Subsequence Sum (25分) PAT 甲级
1007 Maximum Subsequence Sum (25分) Given a sequence of K integers { N1, N2, …, N**K }. A continuous subsequence is defined to be { N**i, N**i+1, …, N**j } where 1≤i≤j≤K. The Maximum Subsequence is the continuous subsequence which has the largest sum of its原创 2021-01-19 14:59:19 · 149 阅读 · 2 评论 -
1006 Sign In and Sign Out (25分) PAT甲级
1006 Sign In and Sign Out (25分) At the beginning of every day, the first person who signs in the computer room will unlock the door, and the last one who signs out will lock the door. Given the records of signing in’s and out’s, you are supposed to find th原创 2021-01-19 14:58:36 · 79 阅读 · 0 评论 -
1005 Spell It Right (20分)
1005 Spell It Right (20分) Given a non-negative integer N, your task is to compute the sum of all the digits of N, and output every digit of the sum in English. Input Specification: Each input file contains one test case. Each case occupies one line which c原创 2021-01-08 21:14:23 · 102 阅读 · 0 评论 -
1003 Emergency (25分) PAT 甲级
1003 Emergency (25分) As an emergency rescue team leader of a city, you are given a special map of your country. The map shows several scattered cities connected by some roads. Amount of rescue teams in each city and the length of each road between any pair原创 2021-01-08 17:16:41 · 123 阅读 · 0 评论 -
1002 A+B for Polynomials (25分) PAT_A
1002 A+B for Polynomials (25分) This time, you are supposed to find A+B where A and B are two polynomials. Input Specification: Each input file contains one test case. Each case occupies 2 lines, and each line contains the information of a polynomial: K N1原创 2021-01-06 17:37:06 · 100 阅读 · 0 评论 -
1001 A+B Format (20分)-PAT_A
1001 A+B Format (20分) Calculate a+b and output the sum in standard format – that is, the digits must be separated into groups of three by commas (unless there are less than four digits). Input Specification: Each input file contains one test case. Each cas原创 2021-01-06 17:32:43 · 85 阅读 · 0 评论