PAT甲级
文章平均质量分 68
永夜等天明
这个作者很懒,什么都没留下…
展开
-
【PAT A1003】 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 roads. Amount of rescue teams in each city and the length of each road between any pair of cities are marked原创 2022-04-11 15:51:47 · 80 阅读 · 0 评论 -
【PAT A1030】 Travel Plan
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. If suc原创 2022-04-04 15:05:54 · 356 阅读 · 0 评论 -
【PAT A1076】 Forwards on Weibo
Weibo is known as the Chinese version of Twitter. One user on Weibo may have many followers, and may follow many other users as well. Hence a social network is formed with followers relations. When a user makes a post on Weibo, all his/her followers can vi原创 2022-02-24 23:36:21 · 92 阅读 · 0 评论 -
【PAT A1034】 Head of a Gang
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. The weight of a relation is defined to be the total time length of all the phone calls made between原创 2022-02-24 22:57:34 · 408 阅读 · 0 评论 -
【PAT A1020】 Tree Traversals
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 corresponding binary tree.Input Specification:Each input原创 2022-02-06 20:21:18 · 76 阅读 · 0 评论 -
【PAT A1043】 Is It a Binary Search Tree
A Binary Search Tree (BST) is recursively defined as a binary tree which has the following properties:The left subtree of a node contains only nodes with keys less than the node’s key.The right subtree of a node contains only nodes with keys greater than原创 2022-02-06 20:13:51 · 320 阅读 · 0 评论 -
1053 Path of Equal Weight (30 分)(通过最后一个测试点)
Given a non-empty tree with root RRR, and with weight WiW_iWi assigned to each tree node TiT_iTi. The weight of a path from RRR to LLL is defined to be the sum of the weights of all the nodes along the path from RRR to any leaf node LLL.Now given any w原创 2022-02-04 22:44:56 · 2499 阅读 · 9 评论 -
【PAT B1080/A1137】 MOOC期终成绩
对于在中国大学MOOC(http://www.icourse163.org/ )学习“数据结构”课程的学生,想要获得一张合格证书,必须首先获得不少于200分的在线编程作业分,然后总评获得不少于60分(满分100)。总评成绩的计算公式为 G=(Gmid−term ×40%+Gfinal ×60%),如果 Gmid−term >Gfinal ;否则总评 G 就是 Gfinal 。这里 Gmid−term 和 Gfinal 分别为学生的期中和期末成绩。现在的问题是,每次考试都产生一张独立的成绩单。本原创 2021-05-31 23:33:42 · 70 阅读 · 0 评论 -
【PAT B1055/A1109】 集体照
拍集体照时队形很重要,这里对给定的 N 个人 K 排的队形设计排队规则如下:每排人数为 N/K(向下取整),多出来的人全部站在最后一排;后排所有人的个子都不比前排任何人矮;每排中最高者站中间(中间位置为 m/2+1,其中 m 为该排人数,除法向下取整);每排其他人以中间人为轴,按身高非增序,先右后左交替入队站在中间人的两侧(例如5人身高为190、188、186、175、170,则队形为175、188、190、186、170。这里假设你面对拍照者,所以你的左边是中间人的右边);若多人身高相同,则按名原创 2021-05-31 16:41:48 · 67 阅读 · 0 评论 -
【PAT B1070/A1125】 结绳
给定一段一段的绳子,你需要把它们串成一条绳。每次串连的时候,是把两段绳子对折,再如下图所示套接在一起。这样得到的绳子又被当成是另一段绳子,可以再次对折去跟另一段绳子串连。每次串连后,原来两段绳子的长度就会减半。给定 N 段绳子的长度,你需要找出它们能串成的绳子的最大长度。输入格式:每个输入包含 1 个测试用例。每个测试用例第 1 行给出正整数 N (2≤N≤10^ 4 );第 2 行给出 N 个正整数,即原始绳段的长度,数字间以空格分隔。所有整数都不超过10^ 4。输出格式:在一行中输出能够串成原创 2021-04-24 21:05:58 · 95 阅读 · 0 评论 -
【PAT B1065/A1121】 单身狗
“单身狗”是中文对于单身人士的一种爱称。本题请你从上万人的大型派对中找出落单的客人,以便给予特殊关爱。输入格式:输入第一行给出一个正整数 N(≤ 50 000),是已知夫妻/伴侣的对数;随后 N 行,每行给出一对夫妻/伴侣——为方便起见,每人对应一个 ID 号,为 5 位数字(从 00000 到 99999),ID 间以空格分隔;之后给出一个正整数 M(≤ 10 000),为参加派对的总人数;随后一行给出这 M 位客人的 ID,以空格分隔。题目保证无人重婚或脚踩两条船。输出格式:首先第一行输出落单客原创 2021-04-24 19:56:48 · 85 阅读 · 0 评论 -
【PAT B1050/A1105】 螺旋矩阵
本题要求将给定的 N 个正整数按非递增的顺序,填入“螺旋矩阵”。所谓“螺旋矩阵”,是指从左上角第 1 个格子开始,按顺时针螺旋方向填充。要求矩阵的规模为 m 行 n 列,满足条件:m×n 等于 N;m≥n;且 m−n 取所有可能值中的最小值。输入格式:输入在第 1 行中给出一个正整数 N,第 2 行给出 N 个待填充的正整数。所有数字不超过 10^4 ,相邻数字以空格分隔。输出格式:输出螺旋矩阵。每行 n 个数字,共 m 行。相邻数字以 1 个空格分隔,行末不得有多余空格。输入样例:1237转载 2021-04-23 16:21:02 · 96 阅读 · 0 评论 -
【PAT B1060/A1117】 爱丁顿数
英国天文学家爱丁顿很喜欢骑车。据说他为了炫耀自己的骑车功力,还定义了一个“爱丁顿数” E ,即满足有 E 天骑车超过 E 英里的最大整数 E。据说爱丁顿自己的 E 等于87。现给定某人 N 天的骑车距离,请你算出对应的爱丁顿数 E(≤N)。输入格式:输入第一行给出一个正整数 N (≤10^5 ),即连续骑车的天数;第二行给出 N 个非负整数,代表每天的骑车距离。输出格式:在一行中给出 N 天的爱丁顿数。输入样例:106 7 6 9 3 10 8 2 7 8输出样例:6思路:这里需要原创 2021-04-23 15:18:22 · 169 阅读 · 0 评论 -
【PAT B1030/A 1085】 完美数列
给定一个正整数数列,和正整数 p,设这个数列中的最大值是 M,最小值是 m,如果 M≤mp,则称这个数列是完美数列。现在给定参数 p 和一些正整数,请你从中选择尽可能多的数构成一个完美数列。输入格式:输入第一行给出两个正整数 N 和 p,其中 N(≤10^ 5 )是输入的正整数的个数,p(≤10^ 9 )是给定的参数。第二行给出 N 个正整数,每个数不超过 10^9。输出格式:在一行中输出最多可以选择多少个数可以用它们组成一个完美数列。输入样例:10 82 3 20 4 5 1 6 7 8原创 2021-04-21 15:12:06 · 122 阅读 · 0 评论 -
【PAT A1052】 Linked List Sorting
A linked list consists of a series of structures, which are not necessarily adjacent in memory. We assume that each structure contains an integer key and a Next pointer to the next structure. Now given a linked list, you are supposed to sort the structures原创 2021-04-17 21:47:14 · 78 阅读 · 0 评论 -
【PAT A1032】 Sharing
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. For example, loading and being are stored as showed in Figure 1.Fi原创 2021-04-17 21:03:07 · 83 阅读 · 0 评论 -
【PAT 1002】 A+B for Polynomials
This time, you are supposed to find A+B where A and B are two polynomials.InputEach input file contains one test case. Each case occupies 2 lines, and each line contains the information of a polynomial: K N1 aN1 N2 aN2 … NK aNK, where K is the number of原创 2021-04-16 22:10:32 · 50 阅读 · 0 评论 -
【PAT A1001】 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 than four digits).Input Specification:Each input file contains one test case. Each case contains a pair of i原创 2021-04-16 21:16:05 · 81 阅读 · 0 评论 -
【PAT A1060】 Are They Equal
If a machine can save only 3 significant digits, the float numbers 12300 and 12358.9 are considered equal since they are both saved as 0.123×10^5 with simple chopping. Now given the number of significant digits on a machine and two float numbers, you are s转载 2021-04-16 20:48:15 · 77 阅读 · 0 评论 -
【PAT A1059】 Prime Factors
Given any positive integer N, you are supposed to find all of its prime factors, and write them in the format N = p1^ k1p2^ k2…*pm^ km.Input Specification:Each input file contains one test case which gives a positive integer N in the range of long int.原创 2021-04-15 21:44:42 · 154 阅读 · 0 评论 -
【PAT B1019/A1069】 The Black Hole of Numbers
For any 4-digit integer except the ones with all the digits being the same, if we sort the digits in non-increasing order first, and then in non-decreasing order, a new number can be obtained by taking the second number from the first one. Repeat in this m原创 2021-04-14 22:51:48 · 10625 阅读 · 0 评论 -
【PAT B1045/A1101】 Quick Sort
著名的快速排序算法里有一个经典的划分过程:我们通常采用某种方法取一个元素作为主元,通过交换,把比主元小的元素放到它的左边,比主元大的元素放到它的右边。 给定划分后的 N 个互不相同的正整数的排列,请问有多少个元素可能是划分前选取的主元?例如给定 N=5, 排列是1、3、2、4、5。则:1 的左边没有元素,右边的元素都比它大,所以它可能是主元;尽管 3 的左边元素都比它小,但其右边的 2 比它小,所以它不能是主元;尽管 2 的右边元素都比它大,但其左边的 3 比它大,所以它不能是主元;类似原因,4转载 2021-04-10 22:48:41 · 145 阅读 · 0 评论 -
【PAT B1040/A1093】 Count PAT’s
The string APPAPT contains two PAT’s as substrings. The first one is formed by the 2nd, the 4th, and the 6th characters, and the second one is formed by the 3rd, the 4th, and the 6th characters.Now given any string, you are supposed to tell the number of原创 2021-04-10 20:53:08 · 102 阅读 · 0 评论 -
【PAT A1033】 To Fill or Not to Fill
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. Different gas station may give different price. You are asked to car转载 2021-04-07 23:11:58 · 93 阅读 · 0 评论 -
【PAT A1025】 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 simultaneously in several places, and the ranklists will be merged immediately after the test. Now it is your原创 2021-03-28 17:21:00 · 60 阅读 · 0 评论 -
【PAT A1046】 Shortest Distance
The task is really simple: given NNN exits on a highway which forms a simple cycle, you are supposed to tell the shortest distance between any pair of exits.Input Specification:Each input file contains one test case. For each case, the first line contain原创 2021-03-26 16:24:15 · 81 阅读 · 0 评论