我可不是为了被全人类喜欢才活着的,只要对于某一个人来说我是必|

王陸

园龄:6年11个月粉丝:2049关注:178

随笔分类 -  PAT甲级

1025 PAT Ranking 双重排序
摘要:Programming Ability Test (PAT) is organized by the College of Computer Science and Technology of Zhejiang University. Each test is supposed to run sim
331
0
0
PAT 1003 Emergency 最短路
摘要: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 ro
344
0
0
PAT 1013 Battle Over Cities DFS深搜
摘要:It is vitally important to have all the cities connected by highways in a war. If a city is occupied by the enemy, all the highways from/toward that c
324
0
0
PAT 1012 The Best Rank 排序
摘要:To evaluate the performance of our first year CS majored students, we consider their grades of three courses only: C – C Programming Language, M – Mat
471
0
0
PAT 1011 World Cup Betting 查找元素
摘要:With the 2010 FIFA World Cup running, football fans the world over were becoming increasingly excited as the best players from the best teams doing ba
237
0
0
PAT 1010 Radix 进制转换+二分法
摘要:Given a pair of positive integers, for example, 6 and 110, can this equation 6 = 110 be true? The answer is “yes”, if 6 is a decimal number and 110 is
410
0
0
PAT 1009 Product of Polynomials 模拟
摘要: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 occu
188
0
0
PAT 1008 Elevator 数学
摘要:The highest building in our city has only one elevator. A request list is made up with N positive numbers.The numbers denote at which floors the eleva
444
0
0
PAT 1006 Sign In and Sign Out 查找元素
摘要: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
303
0
0
PAT 1005 Spell It Right 字符串处理
摘要: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 Specificat
214
0
0
PAT 1007 Maximum Subsequence Sum 最大连续子序列和
摘要:Given a sequence of K integers { N1, N2, …, NK }. A continuous subsequence is defined to be { Ni, Ni+1, …,Nj } where 1 <= i <= j <= K. The Maximum Sub
544
0
0
PAT 1002 A+B for Polynomials(map模拟)
摘要:This time, you are supposed to find A+B where A and B are two polynomials(多项式). Input Each input file contains one test case. Each case occupies 2 lin
354
0
0
PAT 1001 A+B Format
摘要: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 th
352
0
0
点击右上角即可分享
微信分享提示
深色
回顶
收起