<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[weixin_44065549的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/weixin_44065549</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; weixin_44065549]]></copyright><item><title><![CDATA[PAT甲级 A1110]]></title><link>https://blog.youkuaiyun.com/weixin_44065549/article/details/107254791</link><guid>https://blog.youkuaiyun.com/weixin_44065549/article/details/107254791</guid><author>weixin_44065549</author><pubDate>Fri, 10 Jul 2020 16:49:44 +0800</pubDate><description><![CDATA[PAT甲级 A1110
题目详情
1110 Complete Binary Tree (25分)
Given a tree, you are supposed to tell if it is a complete binary tree.
Input Specification:
Each input file contains one test case. For each case, the first line gives a positive integer N (≤20) which is th]]></description><category></category></item><item><title><![CDATA[PAT甲级 A1109]]></title><link>https://blog.youkuaiyun.com/weixin_44065549/article/details/107215743</link><guid>https://blog.youkuaiyun.com/weixin_44065549/article/details/107215743</guid><author>weixin_44065549</author><pubDate>Wed, 08 Jul 2020 21:50:52 +0800</pubDate><description><![CDATA[PAT甲级 A1109
题目详情
1109 Group Photo (25分)
Formation is very important when taking a group photo. Given the rules of forming K rows with N people as the following:
The number of people in each row must be N/K (round down to the nearest integer), with all the ]]></description><category></category></item><item><title><![CDATA[PAT甲级 A1108]]></title><link>https://blog.youkuaiyun.com/weixin_44065549/article/details/107214079</link><guid>https://blog.youkuaiyun.com/weixin_44065549/article/details/107214079</guid><author>weixin_44065549</author><pubDate>Wed, 08 Jul 2020 20:07:07 +0800</pubDate><description><![CDATA[PAT甲级 A1108
题目详情
1108 Finding Average (20分)
The basic task is simple: given N real numbers, you are supposed to calculate their average. But what makes it complicated is that some of the input numbers might not be legal. A legal input is a real number in []]></description><category></category></item><item><title><![CDATA[PAT甲级 A1107]]></title><link>https://blog.youkuaiyun.com/weixin_44065549/article/details/107181171</link><guid>https://blog.youkuaiyun.com/weixin_44065549/article/details/107181171</guid><author>weixin_44065549</author><pubDate>Tue, 07 Jul 2020 16:24:49 +0800</pubDate><description><![CDATA[PAT甲级 A1107
题目详情
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 their hobbies in]]></description><category></category></item><item><title><![CDATA[PAT甲级 A1106]]></title><link>https://blog.youkuaiyun.com/weixin_44065549/article/details/107168839</link><guid>https://blog.youkuaiyun.com/weixin_44065549/article/details/107168839</guid><author>weixin_44065549</author><pubDate>Mon, 06 Jul 2020 21:51:07 +0800</pubDate><description><![CDATA[PAT甲级 A1106
题目详情
1106 Lowest Price in Supply Chain (25分)
A supply chain is a network of retailers（零售商）, distributors（经销商）, and suppliers（供应商）-- everyone involved in moving a product from supplier to customer.
Starting from one root supplier, everyone on th]]></description><category></category></item><item><title><![CDATA[PAT甲级 A1105]]></title><link>https://blog.youkuaiyun.com/weixin_44065549/article/details/107167382</link><guid>https://blog.youkuaiyun.com/weixin_44065549/article/details/107167382</guid><author>weixin_44065549</author><pubDate>Mon, 06 Jul 2020 20:47:17 +0800</pubDate><description><![CDATA[PAT甲级 A1105
题目详情
1105 Spiral Matrix (25分)
This time your job is to fill a sequence of N positive integers into a spiral matrix in non-increasing order. A spiral matrix is filled in from the first element at the upper-left corner, then move in a clockwise s]]></description><category></category></item><item><title><![CDATA[PAT甲级 A1104]]></title><link>https://blog.youkuaiyun.com/weixin_44065549/article/details/107166540</link><guid>https://blog.youkuaiyun.com/weixin_44065549/article/details/107166540</guid><author>weixin_44065549</author><pubDate>Mon, 06 Jul 2020 19:55:20 +0800</pubDate><description><![CDATA[PAT甲级 A1104
题目详情
1104 Sum of Number Segments (20分)
Given a sequence of positive numbers, a segment is defined to be a consecutive subsequence. For example, given the sequence { 0.1, 0.2, 0.3, 0.4 }, we have 10 segments: (0.1) (0.1, 0.2) (0.1, 0.2, 0.3) (0.]]></description><category></category></item><item><title><![CDATA[PAT甲级 A1103]]></title><link>https://blog.youkuaiyun.com/weixin_44065549/article/details/107159417</link><guid>https://blog.youkuaiyun.com/weixin_44065549/article/details/107159417</guid><author>weixin_44065549</author><pubDate>Mon, 06 Jul 2020 16:23:16 +0800</pubDate><description><![CDATA[PAT甲级 A1103
题目详情
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 integ]]></description><category></category></item><item><title><![CDATA[PAT甲级 A1102]]></title><link>https://blog.youkuaiyun.com/weixin_44065549/article/details/107148554</link><guid>https://blog.youkuaiyun.com/weixin_44065549/article/details/107148554</guid><author>weixin_44065549</author><pubDate>Mon, 06 Jul 2020 00:48:51 +0800</pubDate><description><![CDATA[PAT甲级 A1102
题目详情
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]]></description><category></category></item><item><title><![CDATA[PAT甲级 A1101]]></title><link>https://blog.youkuaiyun.com/weixin_44065549/article/details/107146326</link><guid>https://blog.youkuaiyun.com/weixin_44065549/article/details/107146326</guid><author>weixin_44065549</author><pubDate>Sun, 05 Jul 2020 22:19:29 +0800</pubDate><description><![CDATA[PAT甲级 A1101
题目详情
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 larg]]></description><category></category></item><item><title><![CDATA[PAT甲级 A1100]]></title><link>https://blog.youkuaiyun.com/weixin_44065549/article/details/107145205</link><guid>https://blog.youkuaiyun.com/weixin_44065549/article/details/107145205</guid><author>weixin_44065549</author><pubDate>Sun, 05 Jul 2020 21:23:18 +0800</pubDate><description><![CDATA[PAT甲级 A1100
题目详情
1100 Mars Numbers (20分)
People on Mars count their numbers with base 13:
Zero on Earth is called “tret” on Mars.
The numbers 1 to 12 on Earth is called “jan, feb, mar, apr, may, jun, jly, aug, sep, oct, nov, dec” on Mars, respectively.
For]]></description><category></category></item><item><title><![CDATA[PAT甲级 A1099]]></title><link>https://blog.youkuaiyun.com/weixin_44065549/article/details/107142352</link><guid>https://blog.youkuaiyun.com/weixin_44065549/article/details/107142352</guid><author>weixin_44065549</author><pubDate>Sun, 05 Jul 2020 18:04:33 +0800</pubDate><description><![CDATA[PAT甲级 A1099
题目详情
1099 Build A Binary Search Tree (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 the node’s key.
The right subtr]]></description><category></category></item><item><title><![CDATA[PAT甲级 A1098]]></title><link>https://blog.youkuaiyun.com/weixin_44065549/article/details/107141663</link><guid>https://blog.youkuaiyun.com/weixin_44065549/article/details/107141663</guid><author>weixin_44065549</author><pubDate>Sun, 05 Jul 2020 17:20:36 +0800</pubDate><description><![CDATA[PAT甲级 A1098
题目详情
1098 Insertion or Heap Sort (25分)
According to Wikipedia:
Insertion sort iterates, consuming one input element each repetition, and growing a sorted output list. Each iteration, insertion sort removes one element from the input data, finds]]></description><category></category></item><item><title><![CDATA[PAT甲级 A1089]]></title><link>https://blog.youkuaiyun.com/weixin_44065549/article/details/107130749</link><guid>https://blog.youkuaiyun.com/weixin_44065549/article/details/107130749</guid><author>weixin_44065549</author><pubDate>Sat, 04 Jul 2020 21:36:21 +0800</pubDate><description><![CDATA[PAT甲级 A1089
题目详情
1089 Insert or Merge (25分)
According to Wikipedia:
Insertion sort iterates, consuming one input element each repetition, and growing a sorted output list. Each iteration, insertion sort removes one element from the input data, finds the lo]]></description><category></category></item><item><title><![CDATA[PA甲级 A1097]]></title><link>https://blog.youkuaiyun.com/weixin_44065549/article/details/107127269</link><guid>https://blog.youkuaiyun.com/weixin_44065549/article/details/107127269</guid><author>weixin_44065549</author><pubDate>Sat, 04 Jul 2020 17:19:16 +0800</pubDate><description><![CDATA[PAT甲级 A1097
题目详情
1097 Deduplication on a Linked List (25分)
Given a singly linked list L with integer keys, you are supposed to remove the nodes with duplicated absolute values of the keys. That is, for each value K, only the first node of which the value o]]></description><category></category></item><item><title><![CDATA[PAT甲级 A1096]]></title><link>https://blog.youkuaiyun.com/weixin_44065549/article/details/107109849</link><guid>https://blog.youkuaiyun.com/weixin_44065549/article/details/107109849</guid><author>weixin_44065549</author><pubDate>Fri, 03 Jul 2020 17:16:40 +0800</pubDate><description><![CDATA[PAT甲级 A1096
题目详情
1096 Consecutive Factors (20分)
Among all the factors of a positive integer N, there may exist several consecutive numbers. For example, 630 can be factored as 3×5×6×7, where 5, 6, and 7 are the three consecutive numbers. Now given any posi]]></description><category></category></item><item><title><![CDATA[PAT甲级 A1094]]></title><link>https://blog.youkuaiyun.com/weixin_44065549/article/details/107104313</link><guid>https://blog.youkuaiyun.com/weixin_44065549/article/details/107104313</guid><author>weixin_44065549</author><pubDate>Fri, 03 Jul 2020 13:51:40 +0800</pubDate><description><![CDATA[PAT甲级 A1094
题目详情
1094 The Largest Generation (25分)
A family hierarchy is usually presented by a pedigree tree where all the nodes on the same level belong to the same generation. Your task is to find the generation with the largest population.
Input Specif]]></description><category></category></item><item><title><![CDATA[PAT甲级 A1093]]></title><link>https://blog.youkuaiyun.com/weixin_44065549/article/details/107054052</link><guid>https://blog.youkuaiyun.com/weixin_44065549/article/details/107054052</guid><author>weixin_44065549</author><pubDate>Wed, 01 Jul 2020 00:22:08 +0800</pubDate><description><![CDATA[PAT甲级 A1093
解题思路
1093 Count PAT’s (25分)
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,]]></description><category></category></item><item><title><![CDATA[PAT甲级 A1092]]></title><link>https://blog.youkuaiyun.com/weixin_44065549/article/details/107052818</link><guid>https://blog.youkuaiyun.com/weixin_44065549/article/details/107052818</guid><author>weixin_44065549</author><pubDate>Tue, 30 Jun 2020 23:09:35 +0800</pubDate><description><![CDATA[PAT甲级 A1092
题目详情
1092 To Buy or Not to Buy (20分)
Eva would like to make a string of beads with her favorite colors so she went to a small shop to buy some beads. There were many colorful strings of beads. However the owner of the shop would only sell the s]]></description><category></category></item><item><title><![CDATA[PAT甲级 A1090]]></title><link>https://blog.youkuaiyun.com/weixin_44065549/article/details/107049945</link><guid>https://blog.youkuaiyun.com/weixin_44065549/article/details/107049945</guid><author>weixin_44065549</author><pubDate>Tue, 30 Jun 2020 20:32:02 +0800</pubDate><description><![CDATA[PAT甲级 A1090
题目详情
1090 Highest Price in Supply Chain (25分)
A supply chain is a network of retailers（零售商）, distributors（经销商）, and suppliers（供应商）-- everyone involved in moving a product from supplier to customer.
Starting from one root supplier, everyone on t]]></description><category></category></item></channel></rss>