pat真题
文章平均质量分 65
题解
bugu、
这个作者很懒,什么都没留下…
展开
-
【PAT】【贪心线性】1033 To Fill or Not to Fill (25 分)
题目链接:1033 To Fill or Not to Fill (25 分)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 .转载 2021-07-10 22:16:05 · 127 阅读 · 0 评论 -
【PAT】【链表遍历】1032 Sharing (25 分)
题目链接:1032 Sharing (25 分)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,loadingandbeingare stored...原创 2021-07-05 12:15:24 · 125 阅读 · 0 评论 -
【PAT】【spfa + dfs】1030 Travel Plan (30 分)
题目链接:1030 Travel Plan (30 分)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 c.原创 2021-07-03 11:47:08 · 209 阅读 · 0 评论 -
【PAT】【合并两有序序列+找中位数】1029 Median (25 分)
题目链接:1029 Median (25 分)Given 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 sequenc.原创 2021-07-01 21:57:41 · 83 阅读 · 0 评论 -
【PAT】【水题排序】1028 List Sorting (25 分)
题目链接: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 integersN(≤105) an...原创 2021-06-30 19:59:50 · 75 阅读 · 0 评论 -
[PAT] [繁琐排队模拟] 1026 Table Tennis (30 分)
题目链接:1026 Table Tennis (30 分)A table tennis club has N tables available to the public. The tables are numbered from 1 to N. For any pair of players, if there are some tables open when they arrive, they will be assigned to the available table with the sm.原创 2021-06-28 22:21:25 · 137 阅读 · 0 评论 -
【PAT】【进制】1027 Colors in Mars (20 分)
题目链接: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 forRed, the middle 2 digits forGreen, and the...原创 2021-06-26 20:11:49 · 66 阅读 · 0 评论 -
【PAT】【简单模拟排序】1025 PAT Ranking (25 分)
题目链接: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.原创 2021-06-25 17:36:14 · 318 阅读 · 0 评论 -
【PAT】【大整数加法+字符串方式实现】1024 Palindromic Number (25 分)
题目链接:1024 Palindromic Number (25 分)A number that will be the same when it is written forwards or backwards is known as aPalindromic Number. For example, 1234321 is a palindromic number. All single digit numbers are palindromic numbers.Non-palindromic..原创 2021-06-24 16:47:38 · 165 阅读 · 0 评论 -
【PAT】【简单大整数运算】1023 Have Fun with Numbers (20 分)
题目链接: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 consisting exactly.原创 2021-06-23 17:04:01 · 61 阅读 · 0 评论 -
【PAT】【字符串处理 + 简单映射】1022 Digital Library (30 分)
// 字符串处理题以及简单映射// 解题思路:// 可以发现,其实书的相关信息都是string,甚至id号也可以这么看// 而且要求是给出其中一个信息进行查询相应的id号,那么简单的用一个string 到 set的映射就可以了// 用set主要是为了可以按升序输出,然后按题目要求保存和查询就可以了// 这里的set<int> 是因为我觉得int 会比 string节省开销,但却造就我疏忽了一个问题// 注意点:// 上面说的,也就是测试点3、4的坑点,id号首部可能有零,int.原创 2021-06-18 11:43:20 · 104 阅读 · 0 评论 -
【PAT】【树直径 + 连通分量】1021 Deepest Root (25 分)
// 解题思路:// 其实就是遍历得到树直径 混合 连通分量的个数// 进行两次dfs// 第一次:// 只需要任选一个节点作为根节点开始遍历,得到深度最大的一个或多个节点// 第二次:// 再从这其中任选一个,再作为根节点遍历得到深度最大的节点 即是另一端// !需要注意的是,要进行去重,可能会在这两次中得到了相同的节点,这里用set保存 以去重// pat的测试数据真是 把我这些思路总是不够全面的家伙 虐的够惨,处处是坑点啊#include <iostream>..原创 2021-06-17 11:26:52 · 87 阅读 · 0 评论 -
【PAT】【树的已知二序求具体树问题】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 corresponding binary tree.Input Specification:Each ...原创 2021-06-16 15:06:59 · 71 阅读 · 0 评论 -
【PAT】【简单进制转换】1019 General Palindromic Number (20 分)
#include <iostream>#include <cstdio>#include <vector>using namespace std;#define ll long long// 解题思路:// 简单进行进制转换,遍历一遍判断是否回文,按要求输出结果即可vector<int> ans;bool fun(int n, int b){ // 进制转换,用vector保存 vector<int> t;..原创 2021-06-16 12:49:51 · 60 阅读 · 0 评论 -
【PAT】【dijkstra + dfs】1018 Public Bike Management (30 分)
#include <iostream>#include <cstdio>#include <vector>#include <queue>#include <cstring>using namespace std;struct edge{ int v, w;};struct node{ int id, d; bool operator<(const node &r) const .原创 2021-06-15 22:24:51 · 70 阅读 · 0 评论 -
【PAT】【银行排队繁琐模拟】1017 Queueing at Bank
Suppose a bank hasKwindows 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 line, until it is his/her turn to be served and there ...原创 2021-06-11 16:37:13 · 141 阅读 · 1 评论 -
【PAT】【繁琐模拟】1016 Phone Bills (25 分)
题目链接:1016 Phone Bills 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 a customer starts connecting a.原创 2021-06-10 13:11:34 · 72 阅读 · 0 评论 -
【PAT】【字符串和进制转换】1015 Reversible Primes
1015 Reversible Primes (20 分)Areversible primein 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 prime.Now given any t...原创 2021-05-19 12:15:48 · 43 阅读 · 0 评论 -
【PAT】【模拟】1014 Waiting in Line
1014 Waiting in Line (30 分)Suppose a bank hasNwindows 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 inside the yellow line in...原创 2021-05-18 15:08:19 · 64 阅读 · 0 评论 -
【PAT】【割点】1013 Battle Over Cities
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 need to repair any othe...原创 2021-05-18 11:52:06 · 110 阅读 · 0 评论 -
【PAT】【排序】1012 The Best Rank
#include <iostream>#include <cstdio>#include <algorithm>#include <map>#include <set>#include <cmath>using namespace std;//总结:做题思路要清晰,不能急,不然可能反而走弯路更慢//第一种解法是自己写的都看不下去的傻瓜(智障)式做法//开四个结构体数组,每个数组定义一个排序方式cmpa,排好序后将排.原创 2021-05-16 16:17:05 · 56 阅读 · 0 评论 -
【PAT】[简单模拟] 1011 World Cup Betting
#include <iostream>#include <cstdio>#include <iomanip>using namespace std;//简单模拟题//唯一的难点是英语题意。。。//odd - 赔率;trophy - 奖杯int main(){ double res(1), a, b, c, t; for(int i = 1; i <= 3; i++) { scanf("%lf %lf %l.原创 2021-05-15 14:11:41 · 56 阅读 · 0 评论 -
【PAT】【二分】【进制转换】1010 Radix
#include <iostream>#include <cstdio>using namespace std;//这道题不难,但是坑点真的是非常多,花了非常多的时间才把全部测试点过掉//pat的数据非常的坑,坑点十足,拿分不难,满分很难//解题思路://题意是给定一个数和其进制,找到使另一个数与其相等的进制//那么将给定的数转化成十进制,再使用二分查找另一个数的进制//坑点:转换回十进制很容易就会越过数据大小,会有一组非常大的进制数据卡二分法,要输出满足的最小.原创 2021-05-14 17:53:04 · 109 阅读 · 0 评论 -
【PAT】1009 Product of Polynomials
#include <iostream>#include <cstdio>#include <map>using namespace std;//简单题,用map存多项式,模拟计算即可//正规解法似乎是自己手写建立链表存储,然后再模拟,虽然麻烦,但是可以用来熟悉链表的使用,这里用的是STL//要注意的是,例如if(mp[0] == 0);这种语句都会在map中创建一个为零项的项//输出的时候是需要把这些运算或各种原因变为零的项给去掉的inline vo.原创 2021-05-12 12:39:05 · 46 阅读 · 0 评论 -
【PAT】1007 Maximum Subsequence Sum
#include <iostream>#include <cstdio>using namespace std;// 题意是求最大子序列,用贪心法即可//有所不同的是也要求最大子序列的两个端点//题目不难,细节很麻烦,直接存在一个数组里再求解可以避开很多麻烦点//我这里选择的是边读入边计算,所以多了很多麻烦的判断,以及记录全为负数时两个端点inline int read(){ register int x = 0, f = 1; register.原创 2021-05-11 16:44:15 · 49 阅读 · 0 评论 -
【PAT】1005 Spell It Right
#include <cstdio>#include <iostream>#include <sstream>using namespace std;//简单题//但是花了我很多时间在一些细枝末节上//例如输入的结束控制,输出方法的选取//告诫:语法要熟练,思路要清晰//enum num {none, one, two, three, four, five, six, seven,eight, nine, ten,eleven, twelve, thi.原创 2021-05-10 12:12:07 · 51 阅读 · 0 评论 -
【PAT】1004-Counting Leaves
#include <iostream>#include <cstdio>#include <vector>using namespace std;//解题思路://题意是求每一层没有子树的节点个数,即每层的叶子节点个数,dfs深搜即可inline void read(int &x){ register int f = 1; x = 0; char c = getchar(); while(c > '9' |.原创 2021-05-09 17:09:36 · 46 阅读 · 0 评论 -
【PAT】1003 Emergency
解题思路://dijkstra最短路+堆优化(6ms)//与模板题有所不同的是相同是要计算最短路的条数,那么相同时也要计算,且更新多条最短路中能聚集的人数//让我没想到的是,似乎pat的数据给的很小,直接暴力dfs也可以轻松通过//pat的题目可以尝试直接暴力,数据很弱dijstra解法(没有必要)这里只要求两点间的最短路,直接dfs即可struct edge{ int v, w, next; edge(){} edge(int _v, int...原创 2021-05-07 18:04:37 · 55 阅读 · 0 评论 -
【PAT】1002 A+B for Polynomials
#include <iostream>#include <cstdio>#include <map>using namespace std;//解题思路://使用map对应指数和系数读入加减即可//要注意的是,系数可能会合并成零,则个数要先输出则需要先跑一遍来统计map<int, double> mp;int main(){ int n; scanf("%d", &n); int e; double c; .原创 2021-05-06 16:47:43 · 57 阅读 · 0 评论