pat
文章平均质量分 84
小夥
这个作者很懒,什么都没留下…
展开
-
PAT (Advanced Level) 1100. Mars Numbers (20) 解题报告
1100. Mars Numbers (20)时间限制400 ms内存限制65536 kB代码长度限制16000 B判题程序Standard作者CHEN, YuePeople on Mars count their numbers with base原创 2017-03-01 16:18:38 · 277 阅读 · 0 评论 -
PAT (Advanced Level) 1006. Sign In and Sign Out (25) 解题报告
1006. Sign In and Sign Out (25)时间限制400 ms内存限制65536 kB代码长度限制16000 B判题程序Standard作者CHEN, YueAt the beginning of every day, the fi原创 2017-01-24 18:43:23 · 277 阅读 · 0 评论 -
PAT (Advanced Level) 1007. Maximum Subsequence Sum (25) 解题报告
1007. Maximum Subsequence Sum (25)时间限制400 ms内存限制65536 kB代码长度限制16000 B判题程序Standard作者CHEN, YueGiven a sequence of K integers { N原创 2017-01-24 18:44:01 · 304 阅读 · 0 评论 -
PAT (Advanced Level) 1008. Elevator (20) 解题报告
1008. Elevator (20)时间限制400 ms内存限制65536 kB代码长度限制16000 B判题程序Standard作者CHEN, YueThe highest building in our city has only one ele原创 2017-01-24 18:44:44 · 269 阅读 · 0 评论 -
二叉树的相互求解 已知前序中序求后序 已知后序前序求中序 已知前序后序求中序
二叉树的相互求解 已知前序中序求后序 已知后序前序求中序 已知前序后序求中序原创 2017-03-02 16:25:33 · 909 阅读 · 0 评论 -
PAT (Advanced Level) 1115. Counting Nodes in a BST (30) 解题报告
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 or equal to the node's key.The right subtree of a node contains only nodes with keys原创 2017-03-03 18:48:12 · 299 阅读 · 0 评论 -
PAT (Advanced Level) 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 away gifts. Now you are supposed to help him generate t原创 2017-03-05 13:16:03 · 487 阅读 · 0 评论 -
PAT (Advanced Level) 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 chain will be treated as another segment of rope and can be原创 2017-03-05 13:17:03 · 438 阅读 · 0 评论 -
PAT (Advanced Level) 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 first discussed by Leonhard Euler while solving the famous S原创 2017-03-05 13:19:47 · 268 阅读 · 0 评论 -
PAT (Advanced Level) 1005. Spell It Right (20) 解题报告
1005. Spell It Right (20)时间限制400 ms内存限制65536 kB代码长度限制16000 B判题程序Standard作者CHEN, YueGiven a non-negative integer N, your task i原创 2017-01-24 18:42:43 · 174 阅读 · 0 评论 -
PAT (Advanced Level) 1004. Counting Leaves (30) 解题报告
1004. Counting Leaves (30)时间限制400 ms内存限制65536 kB代码长度限制16000 B判题程序Standard作者CHEN, YueA family hierarchy is usually presented by a原创 2017-01-24 14:44:12 · 348 阅读 · 0 评论 -
PAT (Advanced Level) 1003. Emergency (25) 解题报告
1003. Emergency (25)时间限制400 ms内存限制65536 kB代码长度限制16000 B判题程序Standard作者CHEN, YueAs an emergency rescue team leader of a city, yo原创 2017-01-24 14:41:08 · 217 阅读 · 0 评论 -
PAT (Advanced Level) 1101. Quick Sort (25) 解题报告
There is a classical process named partition in the famous quick sort algorithm. In this process we typically choose one element as the pivot. Then the elements less than the pivot are moved to its left and those larger than the pivot to its right. Given N原创 2017-03-01 16:23:53 · 215 阅读 · 0 评论 -
PAT (Advanced Level) 1102. Invert a Binary Tree (25) 解题报告
The following is from Max Howell @twitter:Google: 90% of our engineers use the software you wrote (Homebrew), but you can't invert a binary tree on a whiteboard so fuck off.Now it's your turn to prove that YOU CAN invert a binary tree!Input Specificati原创 2017-03-01 16:26:24 · 249 阅读 · 0 评论 -
PAT (Advanced Level) 1103. Integer Factorization (30) 解题报告
The K-P factorization of a positive integer N is to write N as the sum of the P-th power of K positive integers. You are supposed to write a program to find the K-P factorization of N for any positive integers N, K and P.Input Specification:Each input原创 2017-03-01 16:29:13 · 320 阅读 · 0 评论 -
PAT (Advanced Level) 1035. Password (20) 解题报告
To prepare for PAT, the judge sometimes has to generate random passwords for the users. The problem is that there are always some confusing passwords since it is hard to distinguish 1 (one) from l (L in lowercase), or 0 (zero) from O (o in uppercase). One原创 2017-03-01 16:33:20 · 321 阅读 · 0 评论 -
PAT (Advanced Level) 1036. Boys vs Girls (25) 解题报告
This time you are asked to tell the difference between the lowest grade of all the male students and the highest grade of all the female students.Input Specification:Each input file contains one test case. Each case contains a positive integer N, follo原创 2017-03-01 16:35:34 · 217 阅读 · 0 评论 -
PAT (Advanced Level) 1037. Magic Coupon (25) 解题报告
The magic shop in Mars is offering some magic coupons. Each coupon has an integer N printed on it, meaning that when you use this coupon with a product, you may get N times the value of that product back! What is more, the shop also offers some bonus produ原创 2017-03-01 16:41:16 · 222 阅读 · 0 评论 -
PAT (Advanced Level) 1038. Recover the Smallest Number (30) 解题报告
Given a collection of number segments, you are supposed to recover the smallest number from them. For example, given {32, 321, 3214, 0229, 87}, we can recover many numbers such like 32-321-3214-0229-87 or 0229-32-87-321-3214 with respect to different order原创 2017-03-01 16:48:13 · 285 阅读 · 0 评论 -
PAT (Advanced Level) 1001. A+B Format (20) 解题报告
1001. A+B Format (20)时间限制400 ms内存限制65536 kB代码长度限制16000 B判题程序Standard作者CHEN, YueCalculate a + b and output the sum in standard原创 2017-01-24 14:34:49 · 367 阅读 · 0 评论 -
PAT (Advanced Level) 1002. A+B for Polynomials (25) 解题报告
1002. A+B for Polynomials (25)时间限制400 ms内存限制65536 kB代码长度限制16000 B判题程序Standard作者CHEN, YueThis time, you are supposed to find A+原创 2017-01-24 14:37:40 · 463 阅读 · 0 评论 -
PAT (Advanced Level) 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 standard routine to print the numbers in level-order. However原创 2017-03-05 13:21:47 · 554 阅读 · 0 评论