PAT甲级
文章平均质量分 80
WTlumos
这个作者很懒,什么都没留下…
展开
-
PAT 1121.Damn Single(25 分)
"Damn Single (单身狗)" is the Chinese nickname for someone who is being single. You are supposed to find those who are alone in a big party, so they can be taken care of.Input Specification:Each inpu...原创 2018-09-05 12:19:11 · 116 阅读 · 0 评论 -
PAT 1120.Friend Numbers(20 分)
Two integers are called "friend numbers" if they share the same sum of their digits, and the sum is their "friend ID". For example, 123 and 51 are friend numbers since 1+2+3 = 5+1 = 6, and 6 is their ...原创 2018-09-05 12:21:08 · 117 阅读 · 0 评论 -
PAT 1119.Pre- and Post-order Traversals(30 分)
Suppose that all the keys in a binary tree are distinct positive integers. A unique binary tree can be determined by a given pair of postorder and inorder traversal sequences, or preorder and inorder ...原创 2018-09-05 12:23:59 · 211 阅读 · 0 评论 -
PAT 1137.Final Grading(25 分)
For a student taking the online course "Data Structures" on China University MOOC (http://www.icourse163.org/), to be qualified for a certificate, he/she must first obtain no less than 200 points from...原创 2018-09-03 14:29:03 · 90 阅读 · 0 评论 -
PAT 1118.Birds in Forest(25 分)并查集
Some scientists took pictures of thousands of birds in a forest. Assume that all the birds appear in the same picture belong to the same tree. You are supposed to help the scientists to count the maxi...原创 2018-09-03 14:39:15 · 110 阅读 · 0 评论 -
PAT 1130.Infix Expression(25 分)中缀表达式
Given a syntax tree (binary), you are supposed to output the corresponding infix expression, with parentheses reflecting the precedences of the operators.Input Specification:Each input file contai...原创 2018-09-03 14:59:58 · 217 阅读 · 0 评论 -
PAT 1131.Subway Map(30 分)
In the big cities, the subway systems always look so complex to the visitors. To give you some sense, the following figure shows the map of Beijing subway. Now you are supposed to help people with you...原创 2018-09-03 15:05:23 · 271 阅读 · 0 评论 -
PAT 1136.A Delayed Palindrome(20 分)回文
Consider a positive integer N written in standard notation with k+1 digits ai as ak⋯a1a0 with 0≤ai<10 for all i and ak>0. Then N is palindromic if and only if ai=ak−i for...原创 2018-09-03 15:17:17 · 100 阅读 · 0 评论 -
PAT 1135.Is It A Red-Black Tree(30 分)
There is a kind of balanced binary search tree named red-black tree in the data structure. It has the following 5 properties:(1) Every node is either red or black. (2) The root is black. (3) Every...原创 2018-09-03 15:22:49 · 382 阅读 · 0 评论 -
PAT 1134.Vertex Cover(25 分)
A vertex cover of a graph is a set of vertices such that each edge of the graph is incident to at least one vertex of the set. Now given a graph with several vertex sets, you are supposed to tell if e...原创 2018-09-03 15:31:10 · 102 阅读 · 0 评论 -
PAT 1133.Splitting A Linked List(25 分
Given a singly linked list, you are supposed to rearrange its elements so that all the negative values appear before all of the non-negatives, and all the values in [0, K] appear before all those grea...原创 2018-09-03 15:40:09 · 115 阅读 · 0 评论 -
PAT 1129.Recommendation System(25 分)
Recommendation system predicts the preference that a user would give to an item. Now you are asked to program a very simple recommendation system that rates the user's preference by the number of time...原创 2018-09-03 15:44:00 · 257 阅读 · 0 评论 -
PAT 1128.N Queens Puzzle(20 分)
The "eight queens puzzle" is the problem of placing eight chess queens on an 8×8 chessboard so that no two queens threaten each other. Thus, a solution requires that no two queens share the same row, ...原创 2018-09-03 15:45:54 · 109 阅读 · 0 评论 -
PAT 1127.ZigZagging on a Tree(30 分)
Suppose that all the keys in a binary tree are distinct positive integers. A unique binary tree can be determined by a given pair of postorder and inorder traversal sequences. And it is a simple stand...原创 2018-09-04 12:47:28 · 316 阅读 · 0 评论 -
PAT 1122.Hamiltonian Cycle(25 分
The "Hamilton cycle problem" is to find a simple cycle that contains every vertex in a graph. Such a cycle is called a "Hamiltonian cycle".In this problem, you are supposed to tell if a given cycle ...原创 2018-09-05 12:16:42 · 107 阅读 · 0 评论 -
PAT 1123.Is It a Complete AVL Tree(30 分
An AVL tree is a self-balancing binary search tree. In an AVL tree, the heights of the two child subtrees of any node differ by at most one; if at any time they differ by more than one, rebalancing is...原创 2018-09-05 12:06:35 · 86 阅读 · 0 评论 -
PAT 1124.Raffle for Weibo Followers(20 分)
John got a full mark on PAT. He was so happy that he decided to hold a raffle(抽奖) for his followers on Weibo -- that is, he would select winners from every N followers who forwarded his post, and give...原创 2018-09-05 12:05:14 · 95 阅读 · 0 评论 -
PAT 1114.Family Property(25 分)
This time, you are supposed to help us collect the data for family-owned property. Given each person's family members, and the estate(房产)info under his/her own name, we need to know the size of each f...原创 2018-09-04 13:00:54 · 121 阅读 · 0 评论 -
PAT 1147. Heaps (30)
作者: CHEN, Yue 单位: 浙江大学 时间限制: 200 ms 内存限制: 64 MB 代码长度限制: 16 KBIn computer science, a heap is a specialized tree-based data structure that satisfies the heap property: if P is a parent node of C, ...原创 2018-09-02 13:05:57 · 200 阅读 · 0 评论 -
PAT 1146.Topological Order(25 分)
作者: CHEN, Yue 单位: 浙江大学时间 限制: 200 ms 内存限制: 64 MB 代码长度限制: 16 KBThis is a problem given in the Graduate Entrance Exam in 2018: Which of the following is NOT a topological order obtained from the gi...原创 2018-09-02 13:19:35 · 193 阅读 · 0 评论 -
PAT 1145. Hashing - Average Search Time(25 分)
时间限制: 200 ms 内存限制: 64 MB 代码长度限制: 16 KBThe task of this problem is simple: insert a sequence of distinct positive integers into a hash table first. Then try to find another sequence of integer key...原创 2018-09-02 16:00:43 · 150 阅读 · 0 评论 -
PAT 1144.The Missing Number(20 分)
时间限制: 150 ms 内存限制: 64 MB 代码长度限制: 16 KBGiven N integers, you are supposed to find the smallest positive integer that is NOT in the given list.Input Specification:Each input file contains one te...原创 2018-09-02 16:06:22 · 99 阅读 · 0 评论 -
PAT 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 ...原创 2018-09-02 16:34:16 · 118 阅读 · 0 评论 -
PAT 1142 Maximal Clique(25 分)
A clique is a subset of vertices of an undirected graph such that every two distinct vertices in the clique are adjacent. A maximal clique is a clique that cannot be extended by including one more adj...原创 2018-09-02 16:45:56 · 192 阅读 · 0 评论 -
PAT 1141.PAT Ranking of Institutions(25 分)
After each PAT, the PAT Center will announce the ranking of institutions based on their students' performances. Now you are asked to generate the ranklist.Input Specification:Each input file conta...原创 2018-09-02 16:55:15 · 98 阅读 · 0 评论 -
PAT 1140.Look-and-say Sequence(20 分)
Look-and-say sequence is a sequence of integers as the following:D, D1, D111, D113, D11231, D112213111, ...where D is in [0, 9] except 1. The (n+1)st number is a kind of description of the nth n...原创 2018-09-02 17:04:11 · 139 阅读 · 0 评论 -
PAT 1139.First Contact(30 分)
Unlike in nowadays, the way that boys and girls expressing their feelings of love was quite subtle in the early years. When a boy A had a crush on a girl B, he would usually not contact her directly i...原创 2018-09-02 17:11:29 · 241 阅读 · 0 评论 -
PAT 1138.Postorder Traversal(25 分)
Suppose that all the keys in a binary tree are distinct positive integers. Given the preorder and inorder traversal sequences, you are supposed to output the first number of the postorder traversal se...原创 2018-09-02 17:15:41 · 302 阅读 · 0 评论 -
PAT 1107.Social Clusters(30 分)
When register on a social network, you are always asked to specify your hobbies in order to find some potential friends with the same hobbies. A social cluster is a set of people who have some of thei...原创 2018-09-05 11:57:56 · 101 阅读 · 0 评论 -
PAT 1132.Cut Integer(20 分)
Cutting an integer means to cut a K digits lone integer Z into two integers of (K/2) digits long integers A and B. For example, after cutting Z = 167334, we have A = 167 and B = 334. It is interesting...原创 2018-09-05 11:59:26 · 104 阅读 · 0 评论 -
PAT 1126.Eulerian Path(25 分)
In graph theory, an Eulerian path is a path in a graph which visits every edge exactly once. Similarly, an Eulerian circuit is an Eulerian path which starts and ends on the same vertex. They were firs...原创 2018-09-05 12:01:25 · 112 阅读 · 0 评论 -
PAT 1125.Chain the Ropes(25 分)
Given some segments of rope, you are supposed to chain them into one rope. Each time you may only fold two segments into loops and chain them into one piece, as shown by the figure. The resulting chai...原创 2018-09-05 12:02:41 · 146 阅读 · 0 评论 -
PAT 1112.Stucked Keyboard(20 分)
On a broken keyboard, some of the keys are always stucked. So when you type some sentences, the characters corresponding to those keys will appear repeatedly on screen for k times.Now given a result...原创 2018-09-04 12:44:47 · 138 阅读 · 0 评论