
PAT甲级
邪恶牛犊
只是一个准备考研才发现,自己好菜的,在准备蓝桥杯和pat的学渣。。。。。
展开
-
1045. Favorite Color Stripe (30)-PAT甲级真题
1045.Favorite Color Stripe (30) Eva is trying to make her own color stripe out of a given one. She would like to keep only her favorite colors in her favorite order by cutting off those unwanted pie原创 2017-12-08 14:12:37 · 208 阅读 · 0 评论 -
1059. Prime Factors (25)-PAT甲级真题
1059.Prime Factors (25) Given any positive integer N, you are supposed to find all of its prime factors, and write them in the format N = p1^k1 * p2^k2 *…*pm^km. Input Specification: Each原创 2018-01-11 09:33:09 · 266 阅读 · 0 评论 -
1043. Is It a Binary Search Tree (25)-PAT甲级真题
1043.Is It a Binary Search Tree (25) 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 k原创 2017-12-07 11:28:30 · 359 阅读 · 0 评论 -
1051. Pop Sequence (25)-PAT甲级真题
1051.Pop Sequence (25) Given a stack which can keep M numbers at most. Push N numbers in the order of 1, 2, 3, …, N and pop randomly. You are supposed to tell if a given sequence of numbers is a pos原创 2017-12-14 10:43:18 · 449 阅读 · 0 评论 -
1022. Digital Library (30)-PAT甲级真题
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 assign原创 2017-11-07 10:56:45 · 273 阅读 · 0 评论 -
1029. Median (25)-PAT甲级真题
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原创 2017-11-14 10:05:22 · 214 阅读 · 0 评论 -
1030. Travel Plan (30)-PAT甲级真题
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 de原创 2017-11-14 10:39:39 · 262 阅读 · 0 评论 -
1031. Hello World for U (20)-PAT甲级真题
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 d e l l原创 2017-11-14 11:17:53 · 308 阅读 · 0 评论 -
1033. To Fill or Not to Fill (25)-PAT甲级真题
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原创 2017-11-30 11:09:29 · 218 阅读 · 0 评论 -
1034. Head of a Gang (30)-PAT甲级真题
1034.Head of a Gang (30) 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原创 2017-12-02 10:16:43 · 254 阅读 · 0 评论 -
1037. Magic Coupon (25)-PAT甲级真题
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 th原创 2017-12-03 09:49:02 · 267 阅读 · 0 评论 -
1039. Course List for Student (25)-PAT甲级真题
1039.Course List for Student (25) Zhejiang University has 40000 students and provides 2500 courses. Now given the student name lists of all the courses, you are supposed to output the registered cou原创 2017-12-04 14:58:49 · 165 阅读 · 0 评论 -
1049. Counting Ones (30)-PAT甲级真题
1049. Counting Ones (30) The task is simple: given any positive integer N, you are supposed to count the total number of 1’s in the decimal form of the integers from 1 to N. For example, given N bei原创 2017-12-12 12:06:00 · 269 阅读 · 1 评论 -
1048. Find Coins (25)-PAT甲级真题
1048.Find Coins (25) Eva loves to collect coins from all over the universe, including some other planets like Mars. One day she visited a universal shopping mall which could accept all kinds of coin原创 2017-12-12 11:00:06 · 297 阅读 · 0 评论 -
1060. Are They Equal (25)-PAT甲级真题
1060.Are They Equal (25) 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*105 with simple chopping. No...原创 2018-01-11 10:13:44 · 398 阅读 · 0 评论