<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[Cooocktail的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/Cooocktail</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; Cooocktail]]></copyright><item><title><![CDATA[1034 Head of a Gang]]></title><link>https://blog.youkuaiyun.com/Cooocktail/article/details/87889709</link><guid>https://blog.youkuaiyun.com/Cooocktail/article/details/87889709</guid><author>Cooocktail</author><pubDate>Sat, 23 Feb 2019 12:32:28 +0800</pubDate><description><![CDATA[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...]]></description><category></category></item><item><title><![CDATA[1033 To Fill or Not to Fill]]></title><link>https://blog.youkuaiyun.com/Cooocktail/article/details/87698914</link><guid>https://blog.youkuaiyun.com/Cooocktail/article/details/87698914</guid><author>Cooocktail</author><pubDate>Tue, 19 Feb 2019 12:10:22 +0800</pubDate><description><![CDATA[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...]]></description><category></category></item><item><title><![CDATA[1032 Sharing]]></title><link>https://blog.youkuaiyun.com/Cooocktail/article/details/87698660</link><guid>https://blog.youkuaiyun.com/Cooocktail/article/details/87698660</guid><author>Cooocktail</author><pubDate>Tue, 19 Feb 2019 12:05:58 +0800</pubDate><description><![CDATA[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...]]></description><category></category></item><item><title><![CDATA[1031 Hello World for U]]></title><link>https://blog.youkuaiyun.com/Cooocktail/article/details/87698432</link><guid>https://blog.youkuaiyun.com/Cooocktail/article/details/87698432</guid><author>Cooocktail</author><pubDate>Tue, 19 Feb 2019 12:01:15 +0800</pubDate><description><![CDATA[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  r
lowo

That is...]]></description><category></category></item><item><title><![CDATA[1030 Travel Plan]]></title><link>https://blog.youkuaiyun.com/Cooocktail/article/details/87698220</link><guid>https://blog.youkuaiyun.com/Cooocktail/article/details/87698220</guid><author>Cooocktail</author><pubDate>Tue, 19 Feb 2019 11:57:39 +0800</pubDate><description><![CDATA[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 d...]]></description><category></category></item><item><title><![CDATA[1029 Median]]></title><link>https://blog.youkuaiyun.com/Cooocktail/article/details/87697652</link><guid>https://blog.youkuaiyun.com/Cooocktail/article/details/87697652</guid><author>Cooocktail</author><pubDate>Tue, 19 Feb 2019 11:52:51 +0800</pubDate><description><![CDATA[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,...]]></description><category></category></item><item><title><![CDATA[1028 List Sorting]]></title><link>https://blog.youkuaiyun.com/Cooocktail/article/details/87697274</link><guid>https://blog.youkuaiyun.com/Cooocktail/article/details/87697274</guid><author>Cooocktail</author><pubDate>Tue, 19 Feb 2019 11:44:50 +0800</pubDate><description><![CDATA[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, t...]]></description><category></category></item><item><title><![CDATA[1027 Colors in Mars]]></title><link>https://blog.youkuaiyun.com/Cooocktail/article/details/87696976</link><guid>https://blog.youkuaiyun.com/Cooocktail/article/details/87696976</guid><author>Cooocktail</author><pubDate>Tue, 19 Feb 2019 11:40:38 +0800</pubDate><description><![CDATA[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 a...]]></description><category></category></item><item><title><![CDATA[PAT甲级题解目录]]></title><link>https://blog.youkuaiyun.com/Cooocktail/article/details/87564442</link><guid>https://blog.youkuaiyun.com/Cooocktail/article/details/87564442</guid><author>Cooocktail</author><pubDate>Sun, 17 Feb 2019 22:58:35 +0800</pubDate><description><![CDATA[编号
			题目
			考点
		1001
			A+B Format
			字符串处理
		1002
			A+B for Polynomials
			数学运算
		
			1003
			
			Emergency
			图、单源点最短路径、Dijkstra
		1004
			Counting Leaves
			树、层序遍历
		1005
			Spell It Right
			字符串...]]></description><category></category></item><item><title><![CDATA[1026 Table Tennis]]></title><link>https://blog.youkuaiyun.com/Cooocktail/article/details/87377413</link><guid>https://blog.youkuaiyun.com/Cooocktail/article/details/87377413</guid><author>Cooocktail</author><pubDate>Fri, 15 Feb 2019 18:28:30 +0800</pubDate><description><![CDATA[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 w...]]></description><category></category></item><item><title><![CDATA[1025 PAT Ranking]]></title><link>https://blog.youkuaiyun.com/Cooocktail/article/details/87377183</link><guid>https://blog.youkuaiyun.com/Cooocktail/article/details/87377183</guid><author>Cooocktail</author><pubDate>Fri, 15 Feb 2019 18:22:25 +0800</pubDate><description><![CDATA[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 pl...]]></description><category></category></item><item><title><![CDATA[1024 Palindromic Number]]></title><link>https://blog.youkuaiyun.com/Cooocktail/article/details/87376672</link><guid>https://blog.youkuaiyun.com/Cooocktail/article/details/87376672</guid><author>Cooocktail</author><pubDate>Fri, 15 Feb 2019 18:18:35 +0800</pubDate><description><![CDATA[1024 Palindromic Number （25 分）

A number that will be the same when it is written forwards or backwards is known as a Palindromic Number. For example, 1234321 is a palindromic number. All single digit...]]></description><category></category></item><item><title><![CDATA[1023 Have Fun with Numbers]]></title><link>https://blog.youkuaiyun.com/Cooocktail/article/details/87375850</link><guid>https://blog.youkuaiyun.com/Cooocktail/article/details/87375850</guid><author>Cooocktail</author><pubDate>Fri, 15 Feb 2019 18:05:45 +0800</pubDate><description><![CDATA[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 happe...]]></description><category></category></item><item><title><![CDATA[1022 Digital Library]]></title><link>https://blog.youkuaiyun.com/Cooocktail/article/details/87027544</link><guid>https://blog.youkuaiyun.com/Cooocktail/article/details/87027544</guid><author>Cooocktail</author><pubDate>Mon, 11 Feb 2019 22:18:57 +0800</pubDate><description><![CDATA[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...]]></description><category></category></item><item><title><![CDATA[1021 Deepest Root]]></title><link>https://blog.youkuaiyun.com/Cooocktail/article/details/86992350</link><guid>https://blog.youkuaiyun.com/Cooocktail/article/details/86992350</guid><author>Cooocktail</author><pubDate>Mon, 11 Feb 2019 14:16:00 +0800</pubDate><description><![CDATA[1021 Deepest Root （25 分）

A graph which is connected and acyclic can be considered a tree. The hight of the tree depends on the selected root. Now you are supposed to find the root that results in a h...]]></description><category></category></item><item><title><![CDATA[1020 Tree Traversals]]></title><link>https://blog.youkuaiyun.com/Cooocktail/article/details/86982918</link><guid>https://blog.youkuaiyun.com/Cooocktail/article/details/86982918</guid><author>Cooocktail</author><pubDate>Mon, 11 Feb 2019 11:05:16 +0800</pubDate><description><![CDATA[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 ...]]></description><category></category></item><item><title><![CDATA[1019 General Palindromic Number]]></title><link>https://blog.youkuaiyun.com/Cooocktail/article/details/86982565</link><guid>https://blog.youkuaiyun.com/Cooocktail/article/details/86982565</guid><author>Cooocktail</author><pubDate>Mon, 11 Feb 2019 11:01:10 +0800</pubDate><description><![CDATA[1019 General Palindromic Number （20 分）

A number that will be the same when it is written forwards or backwards is known as a Palindromic Number. For example, 1234321 is a palindromic number. All sing...]]></description><category></category></item><item><title><![CDATA[1018 Public Bike Management]]></title><link>https://blog.youkuaiyun.com/Cooocktail/article/details/86914814</link><guid>https://blog.youkuaiyun.com/Cooocktail/article/details/86914814</guid><author>Cooocktail</author><pubDate>Sun, 10 Feb 2019 17:06:05 +0800</pubDate><description><![CDATA[1018 Public Bike Management （30 分）

There is a public bike service in Hangzhou City which provides great convenience to the tourists from all over the world. One may rent a bike at any station and ret...]]></description><category></category></item><item><title><![CDATA[1017 Queueing at Bank]]></title><link>https://blog.youkuaiyun.com/Cooocktail/article/details/86914558</link><guid>https://blog.youkuaiyun.com/Cooocktail/article/details/86914558</guid><author>Cooocktail</author><pubDate>Sun, 10 Feb 2019 17:00:20 +0800</pubDate><description><![CDATA[1017 Queueing at Bank （25 分）

Suppose a bank has K windows 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 wai...]]></description><category></category></item><item><title><![CDATA[1016 Phone Bills]]></title><link>https://blog.youkuaiyun.com/Cooocktail/article/details/86914317</link><guid>https://blog.youkuaiyun.com/Cooocktail/article/details/86914317</guid><author>Cooocktail</author><pubDate>Sun, 10 Feb 2019 16:56:27 +0800</pubDate><description><![CDATA[1016 Phone Bills （25 分）

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 wh...]]></description><category></category></item></channel></rss>