PAT
lonely喆
这个作者很懒,什么都没留下…
展开
-
PAT Advanced—1143 Lowest Common Ancestor (30分)
The lowest common ancestor (LCA) of two nodes U and V in a tree is the deepest node that has both U and V as descendants.A binary search tree (BST) is recursively defined as a binary tree which has the following properties:The left subtree of a node cont原创 2020-07-13 23:45:57 · 130 阅读 · 0 评论 -
PAT Advanced—1147 Heaps (30分)
In computer science, a heap is a specialized tree-based data structure that satisfies the heap property: if P is a parent node of C, then the key (the value) of P is either greater than or equal to (in a max heap) or less than or equal to (in a min heap) t原创 2020-07-08 21:15:52 · 152 阅读 · 0 评论 -
PAT Advanced—1151 LCA in a Binary Tree (30分)
The lowest common ancestor (LCA) of two nodes U and V in a tree is the deepest node that has both U and V as descendants.Given any two nodes in a binary tree, you are supposed to find their LCA.Input Specification:Each input file contains one test case.原创 2020-07-08 20:06:50 · 168 阅读 · 0 评论 -
PAT Advanced—1150 Travelling Salesman Problem (25分)
The “travelling salesman problem” asks the following question: “Given a list of cities and the distances between each pair of cities, what is the shortest possible route that visits each city and returns to the origin city?” It is an NP-hard problem in com原创 2020-07-07 00:16:18 · 162 阅读 · 0 评论 -
PAT Advanced—1149 Dangerous Goods Packaging (25分)
When shipping goods with containers, we have to be careful not to pack some incompatible goods into the same container, or we might get ourselves in serious trouble. For example, oxidizing agent (氧化剂) must not be packed with flammable liquid (易燃液体), or it原创 2020-07-05 23:45:45 · 212 阅读 · 0 评论 -
PAT Advanced—1148 Werewolf - Simple Version (20分)
Werewolf(狼人杀) is a game in which the players are partitioned into two parties: the werewolves and the human beings. Suppose that in a game,player #1 said: “Player #2 is a werewolf.”;player #2 said: “Player #3 is a human.”;player #3 said: “Player #4 is a原创 2020-07-05 00:39:31 · 217 阅读 · 0 评论 -
PAT Advanced—1155 Heap Paths (30分)
In computer science, a heap is a specialized tree-based data structure that satisfies the heap property: if P is a parent node of C, then the key (the value) of P is either greater than or equal to (in a max heap) or less than or equal to (in a min heap) t原创 2020-07-03 23:27:49 · 128 阅读 · 0 评论 -
PAT Advanced—1154 Vertex Coloring (25分)
A proper vertex coloring is a labeling of the graph’s vertices with colors such that no two vertices sharing the same edge have the same color. A coloring using at most k colors is called a (proper) k-coloring.Now you are supposed to tell if a given color原创 2020-07-02 22:44:13 · 136 阅读 · 0 评论 -
PAT Advanced—1153 Decode Registration Card of PAT (25分)
A registration card number of PAT consists of 4 parts:the 1st letter represents the test level, namely, T for the top level, A for advance and B for basic;the 2nd - 4th digits are the test site number, ranged from 101 to 999;the 5th - 10th digits give原创 2020-07-01 22:17:33 · 125 阅读 · 0 评论 -
PAT Advanced—1152 Google Recruitment (20分)
In July 2004, Google posted on a giant billboard along Highway 101 in Silicon Valley (shown in the picture below) for recruitment. The content is super-simple, a URL consisting of the first 10-digit prime found in consecutive digits of the natural constant原创 2020-06-28 23:38:58 · 264 阅读 · 0 评论 -
PAT Advanced—1028 List Sorting (25分)
Excel can sort records according to any column. Now you are supposed to imitate this function.Input Specification:Each input file contains one test case. For each case, the first line contains two integers N (≤105) and C, where N is the number of reco原创 2020-06-27 23:29:02 · 154 阅读 · 0 评论 -
PAT Advanced—1025 PAT Ranking (25分)
Programming Ability Test (PAT) is organized by the College of Computer Science and Technology of Zhejiang University. Each test is supposed to run simultaneously in several places, and the ranklists will be merged immediately after the test. Now it is your原创 2020-06-19 19:25:34 · 126 阅读 · 0 评论 -
PAT Advanced—1022 Digital Library (30分)
A Digital Library contains millions of books, stored according to their titles, authors, key words of their abstracts, publishers, and published years. Each book is assigned an unique 7-digit number as its ID. Given any query from a reader, you are suppose原创 2020-06-03 20:58:37 · 158 阅读 · 0 评论 -
PAT Advanced—1018 Public Bike Management (30分)
There is a public bike service in Hangzhou City which provides great convenience to the tourists from all over the world. One may rent a bike at any station and return it to any other stations in the city.The Public Bike Management Center (PBMC) keeps mon原创 2020-05-18 18:05:41 · 171 阅读 · 0 评论 -
PAT Advanced—1024 Palindromic Number (25分)
A number that will be the same when it is written forwards or backwards is known as a Palindromic Number. For example, 1234321 is a palindromic number. All single digit numbers are palindromic numbers.Non-palindromic numbers can be paired with palindromic原创 2020-05-09 20:56:33 · 150 阅读 · 0 评论 -
PAT Advanced—1021 Deepest Root (25分)
A graph which is connected and acyclic can be considered a tree. The height of the tree depends on the selected root. Now you are supposed to find the root that results in a highest tree. Such a root is called the deepest root.Input Specification:Each in原创 2020-05-09 08:44:44 · 122 阅读 · 0 评论 -
PAT Advanced—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:h de ll rlowoThat is, the characters must be printed...原创 2020-05-04 20:26:32 · 115 阅读 · 0 评论 -
PAT Advanced—1027 Colors in Mars (20分)
People in Mars represent the colors in their computers in a similar way as the Earth people. That is, a color is represented by a 6-digit number, where the first 2 digits are for Red, the middle 2 dig...原创 2020-05-04 19:04:42 · 101 阅读 · 0 评论 -
PAT Advanced—1020 Tree Traversals (25分)
Suppose that all the keys in a binary tree are distinct positive integers. Given the postorder and inorder traversal sequences, you are supposed to output the level order traversal sequence of the cor...原创 2020-04-26 00:21:39 · 138 阅读 · 0 评论 -
PAT Advanced—1023 Have Fun with Numbers (20分)
Notice that the number 123456789 is a 9-digit number consisting exactly the numbers from 1 to 9, with no duplication. Double it we will obtain 246913578, which happens to be another 9-digit number con...原创 2020-04-24 00:26:22 · 381 阅读 · 0 评论 -
PAT Advanced—1019 General Palindromic Number (20分)
A number that will be the same when it is written forwards or backwards is known as a Palindromic Number. For example, 1234321 is a palindromic number. All single digit numbers are palindromic numbers...原创 2020-04-19 23:08:15 · 121 阅读 · 0 评论 -
PAT Advanced—1017 Queueing at Bank (25分)
Suppose a bank has K windows open for service. There is a yellow line in front of the windows which devides the waiting area into two parts. All the customers have to wait in line behind the yellow li...原创 2020-04-19 19:12:01 · 134 阅读 · 0 评论 -
PAT Advanced—1016 Phone Bills (25分)
A long-distance telephone company charges its customers by the following rules:Making a long-distance call costs a certain amount per minute, depending on the time of day when the call is made. When ...原创 2020-04-19 16:19:46 · 148 阅读 · 0 评论 -
PAT Advanced—1015 Reversible Primes (20分)
A reversible prime in any number system is a prime whose “reverse” in that number system is also a prime. For example in the decimal system 73 is a reversible prime because its reverse 37 is also a pr...原创 2020-04-17 15:55:28 · 136 阅读 · 0 评论 -
PAT Advanced—1014 Waiting in Line (30分)
Suppose a bank has N windows open for service. There is a yellow line in front of the windows which devides the waiting area into two parts. The rules for the customers to wait in line are:The space ...原创 2020-04-10 23:47:11 · 119 阅读 · 0 评论 -
PAT Advanced—1013 Battle Over Cities (25分)
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 city are closed. We must know immediately if we nee...原创 2020-04-08 09:16:28 · 107 阅读 · 0 评论 -
PAT Advanced—1012 The Best Rank (25分)
To evaluate the performance of our first year CS majored students, we consider their grades of three courses only: C - C Programming Language, M - Mathematics (Calculus or Linear Algrbra), and E - Eng...原创 2020-04-07 13:24:28 · 106 阅读 · 0 评论 -
PAT Advanced—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 l...原创 2020-04-06 20:17:39 · 140 阅读 · 0 评论 -
PAT Advanced—1004 Counting Leaves (30分)
A family hierarchy is usually presented by a pedigree tree. Your job is to count those family members who have no child.Input Specification:Each input file contains one test case. Each case starts w...原创 2020-04-06 18:12:33 · 173 阅读 · 0 评论 -
PAT Advanced—1010 Radix (25分)
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 a binary number.Now for any pair of positive integ...原创 2020-04-05 22:43:55 · 128 阅读 · 0 评论 -
PAT Advanced—1009 Product of 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 informati...原创 2020-04-03 18:46:57 · 130 阅读 · 0 评论 -
PAT Advanced—1007 Maximum Subsequence Sum (25分)
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 Subsequence is the continuous subsequence w...原创 2020-04-02 14:22:46 · 90 阅读 · 0 评论 -
PAT Advanced—1011 World Cup Betting (20分)
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 battles for the World Cup trophy in South Africa. Si...原创 2020-04-01 08:59:37 · 98 阅读 · 0 评论 -
PAT Advanced—1008 Elevator (20分)
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 elevator will stop, in specified order. It costs 6 sec...原创 2020-03-31 11:18:54 · 99 阅读 · 0 评论 -
PAT Advanced—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...原创 2020-03-31 11:14:58 · 138 阅读 · 0 评论 -
PAT Advanced—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 ...原创 2020-03-31 11:13:23 · 99 阅读 · 0 评论 -
PAT Advanced—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 informati...原创 2020-03-31 11:11:47 · 115 阅读 · 0 评论 -
PAT Advanced—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 fil...原创 2020-03-31 11:09:11 · 109 阅读 · 0 评论 -
PAT乙级—1095 解码PAT准考证 (25分)
PAT 准考证号由 4 部分组成:第 1 位是级别,即 T 代表顶级;A 代表甲级;B 代表乙级;第 2~4 位是考场编号,范围从 101 到 999;第 5~10 位是考试日期,格式为年、月、日顺次各占 2 位;最后 11~13 位是考生编号,范围从 000 到 999。现给定一系列考生的准考证号和他们的成绩,请你按照要求输出各种统计信息。输入格式:输入首先在一行中给出两个正整数 ...原创 2020-03-30 10:21:41 · 196 阅读 · 0 评论 -
PAT乙级—1094 谷歌的招聘 (20分)
2004 年 7 月,谷歌在硅谷的 101 号公路边竖立了一块巨大的广告牌(如下图)用于招聘。内容超级简单,就是一个以 .com 结尾的网址,而前面的网址是一个 10 位素数,这个素数是自然常数 e 中最早出现的 10 位连续数字。能找出这个素数的人,就可以通过访问谷歌的这个网站进入招聘流程的下一步。自然常数 e 是一个著名的超越数,前面若干位写出来是这样的:e = 2.718281828459...原创 2020-03-30 10:19:35 · 448 阅读 · 0 评论