<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[Struggle_0的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/Struggle_0</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; Struggle_0]]></copyright><item><title><![CDATA[微信小程序 —— 组件]]></title><link>https://blog.youkuaiyun.com/Struggle_0/article/details/125502596</link><guid>https://blog.youkuaiyun.com/Struggle_0/article/details/125502596</guid><author>Struggle_0</author><pubDate>Wed, 29 Jun 2022 09:49:51 +0800</pubDate><description><![CDATA[微信小程序]]></description><category></category></item><item><title><![CDATA[微信小程序 —— 基本结构]]></title><link>https://blog.youkuaiyun.com/Struggle_0/article/details/125501257</link><guid>https://blog.youkuaiyun.com/Struggle_0/article/details/125501257</guid><author>Struggle_0</author><pubDate>Tue, 28 Jun 2022 15:00:00 +0800</pubDate><description><![CDATA[微信小程序]]></description><category></category></item><item><title><![CDATA[三次握手 / 四次握手]]></title><link>https://blog.youkuaiyun.com/Struggle_0/article/details/124634663</link><guid>https://blog.youkuaiyun.com/Struggle_0/article/details/124634663</guid><author>Struggle_0</author><pubDate>Sat, 07 May 2022 17:00:52 +0800</pubDate><description><![CDATA[TCP连接的建立经历以下三个步骤，通常称为三次握手








]]></description><category></category></item><item><title><![CDATA[1101 Quick Sort (25分)]]></title><link>https://blog.youkuaiyun.com/Struggle_0/article/details/109703681</link><guid>https://blog.youkuaiyun.com/Struggle_0/article/details/109703681</guid><author>Struggle_0</author><pubDate>Sun, 15 Nov 2020 15:08:32 +0800</pubDate><description><![CDATA[测试地址：☞

There is a classical process namedpartitionin 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...]]></description><category></category></item><item><title><![CDATA[1028 List Sorting (25分)]]></title><link>https://blog.youkuaiyun.com/Struggle_0/article/details/109703655</link><guid>https://blog.youkuaiyun.com/Struggle_0/article/details/109703655</guid><author>Struggle_0</author><pubDate>Sun, 15 Nov 2020 14:46:46 +0800</pubDate><description><![CDATA[测试地址：☞

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, the first line contains two integersN(≤10​5​​) andC, whereNis the numb...]]></description><category></category></item><item><title><![CDATA[1080 Graduate Admission (30分)]]></title><link>https://blog.youkuaiyun.com/Struggle_0/article/details/109604295</link><guid>https://blog.youkuaiyun.com/Struggle_0/article/details/109604295</guid><author>Struggle_0</author><pubDate>Tue, 10 Nov 2020 18:22:30 +0800</pubDate><description><![CDATA[测试地址：☞

It is said that in 2011, there are about 100 graduate schools ready to proceed over 40,000 applications in Zhejiang Province. It would help a lot if you could write a program to automate the admission procedure.

Each applicant will have to provide]]></description><category></category></item><item><title><![CDATA[1055 The World‘s Richest (25分)]]></title><link>https://blog.youkuaiyun.com/Struggle_0/article/details/109603994</link><guid>https://blog.youkuaiyun.com/Struggle_0/article/details/109603994</guid><author>Struggle_0</author><pubDate>Tue, 10 Nov 2020 18:10:17 +0800</pubDate><description><![CDATA[测试地址：☞

Forbes magazine publishes every year its list of billionaires based on the annual ranking of the world's wealthiest people. Now you are supposed to simulate this job, but concentrate only on the people in a certain range of ages. That is, given the]]></description><category></category></item><item><title><![CDATA[1141 PAT Ranking of Institutions (25分)]]></title><link>https://blog.youkuaiyun.com/Struggle_0/article/details/109601658</link><guid>https://blog.youkuaiyun.com/Struggle_0/article/details/109601658</guid><author>Struggle_0</author><pubDate>Tue, 10 Nov 2020 16:46:29 +0800</pubDate><description><![CDATA[测试地址：☞

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 contains one test case. For each case, the first line]]></description><category></category></item><item><title><![CDATA[1146 Topological Order (25分)]]></title><link>https://blog.youkuaiyun.com/Struggle_0/article/details/109517324</link><guid>https://blog.youkuaiyun.com/Struggle_0/article/details/109517324</guid><author>Struggle_0</author><pubDate>Thu, 05 Nov 2020 19:48:18 +0800</pubDate><description><![CDATA[测试地址：☞

This is a problem given in the Graduate Entrance Exam in 2018: Which of the following is NOT a topological order obtained from the given directed graph? Now you are supposed to write a program to test each of the options.



Input Specification:

E]]></description><category></category></item><item><title><![CDATA[1083 List Grades (25分)]]></title><link>https://blog.youkuaiyun.com/Struggle_0/article/details/109517141</link><guid>https://blog.youkuaiyun.com/Struggle_0/article/details/109517141</guid><author>Struggle_0</author><pubDate>Thu, 05 Nov 2020 17:53:31 +0800</pubDate><description><![CDATA[测试地址：☞

Given a list ofNstudent records with name, ID and grade. You are supposed to sort the records with respect to the grade in non-increasing order, and output those student records of which the grades are in a given interval.

Input Specification:

..]]></description><category></category></item><item><title><![CDATA[1025 PAT Ranking (25分)]]></title><link>https://blog.youkuaiyun.com/Struggle_0/article/details/109516558</link><guid>https://blog.youkuaiyun.com/Struggle_0/article/details/109516558</guid><author>Struggle_0</author><pubDate>Thu, 05 Nov 2020 17:32:32 +0800</pubDate><description><![CDATA[测试地址：☞

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 places, and the ranklists will be merged immediately after the test. Now it]]></description><category></category></item><item><title><![CDATA[1125 Chain the Ropes (25分)]]></title><link>https://blog.youkuaiyun.com/Struggle_0/article/details/109478269</link><guid>https://blog.youkuaiyun.com/Struggle_0/article/details/109478269</guid><author>Struggle_0</author><pubDate>Tue, 03 Nov 2020 20:29:29 +0800</pubDate><description><![CDATA[测试地址：☞

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]]></description><category></category></item><item><title><![CDATA[1075 PAT Judge (25分)]]></title><link>https://blog.youkuaiyun.com/Struggle_0/article/details/109477051</link><guid>https://blog.youkuaiyun.com/Struggle_0/article/details/109477051</guid><author>Struggle_0</author><pubDate>Tue, 03 Nov 2020 19:50:27 +0800</pubDate><description><![CDATA[1075PAT Judge(25分)

The ranklist of PAT is generated from the status list, which shows the scores of the submissions. This time you are supposed to generate the ranklist for PAT.

Input Specification:

Each input file contains one test case. For each ...]]></description><category></category></item><item><title><![CDATA[1016 Phone Bills (25分)]]></title><link>https://blog.youkuaiyun.com/Struggle_0/article/details/109456759</link><guid>https://blog.youkuaiyun.com/Struggle_0/article/details/109456759</guid><author>Struggle_0</author><pubDate>Mon, 02 Nov 2020 21:05:33 +0800</pubDate><description><![CDATA[测试地址：☞

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 when the call is made. When a customer starts connecting a long-distance ca]]></description><category></category></item><item><title><![CDATA[【STL】Vector]]></title><link>https://blog.youkuaiyun.com/Struggle_0/article/details/109342142</link><guid>https://blog.youkuaiyun.com/Struggle_0/article/details/109342142</guid><author>Struggle_0</author><pubDate>Sun, 01 Nov 2020 23:10:37 +0800</pubDate><description><![CDATA[C 语言里用 int arr[ ] 来定义数组，它的缺点是数组的长度不能随心所欲的改变，而 C++ 中的动态数组 vector（矢量） 可以解决这个问题，甚至可以完全替代；它能够在运行阶段设置数组的长度，在末尾增加新的数据，在中间插入新的值，长度可以任意改变，简直不要太好用（偷笑????????）

它在头文件 vector 里面，也在命名空间 std 里面；


【头文件】


#include&lt;vector&gt;
using namespace std;

【定义】


vector 是一个动态]]></description><category></category></item><item><title><![CDATA[1113 Integer Set Partition (25分)]]></title><link>https://blog.youkuaiyun.com/Struggle_0/article/details/109434513</link><guid>https://blog.youkuaiyun.com/Struggle_0/article/details/109434513</guid><author>Struggle_0</author><pubDate>Sun, 01 Nov 2020 19:47:22 +0800</pubDate><description><![CDATA[测试地址：☞

Given a set ofN(&gt;1) positive integers, you are supposed to partition them into two disjoint setsA​1​​andA​2​​ofn​1​​andn​2​​numbers, respectively. LetS​1​​andS​2​​denote the sums of all the numbers inA​1​​andA​2​​, respectively....]]></description><category></category></item><item><title><![CDATA[1062 Talent and Virtue (25分)]]></title><link>https://blog.youkuaiyun.com/Struggle_0/article/details/109431406</link><guid>https://blog.youkuaiyun.com/Struggle_0/article/details/109431406</guid><author>Struggle_0</author><pubDate>Sun, 01 Nov 2020 19:06:59 +0800</pubDate><description><![CDATA[测试地址：☞

About 900 years ago, a Chinese philosopher Sima Guang wrote a history book in which he talked about people's talent and virtue. According to his theory, a man being outstanding in both talent and virtue must be a "sage（圣人）"; being less excellent bu]]></description><category></category></item><item><title><![CDATA[1012 The Best Rank (25分)]]></title><link>https://blog.youkuaiyun.com/Struggle_0/article/details/109431105</link><guid>https://blog.youkuaiyun.com/Struggle_0/article/details/109431105</guid><author>Struggle_0</author><pubDate>Sun, 01 Nov 2020 17:23:34 +0800</pubDate><description><![CDATA[测试地址：☞

To evaluate the performance of our first year CS majored students, we consider their grades of three courses only:C- C Programming Language,M- Mathematics (Calculus or Linear Algrbra), andE- English. At the mean time, we encourage students by...]]></description><category></category></item><item><title><![CDATA[鱼塘钓鱼]]></title><link>https://blog.youkuaiyun.com/Struggle_0/article/details/109321412</link><guid>https://blog.youkuaiyun.com/Struggle_0/article/details/109321412</guid><author>Struggle_0</author><pubDate>Tue, 27 Oct 2020 21:39:03 +0800</pubDate><description><![CDATA[测试地址：☞

【题目描述】

有N个鱼塘排成一排（N&lt;100），每个鱼塘中有一定数量的鱼，例如：N=5时，如下表：



即：在第1个鱼塘中钓鱼第1分钟内可钓到10条鱼，第2分钟内只能钓到8条鱼，……，第5分钟以后再也钓不到鱼了。从第1个鱼塘到第2个鱼塘需要3分钟，从第2个鱼塘到第3个鱼塘需要5分钟，……

给出一个截止时间T(T&lt;1000)，设计一个钓鱼方案，从第1个鱼塘出发，希望能钓到最多的鱼。

假设能钓到鱼的数量仅和已钓鱼的次数有关，且每次钓鱼的时间都是整数分钟。

【输入】

共5行]]></description><category></category></item><item><title><![CDATA[小明的账单]]></title><link>https://blog.youkuaiyun.com/Struggle_0/article/details/109321334</link><guid>https://blog.youkuaiyun.com/Struggle_0/article/details/109321334</guid><author>Struggle_0</author><pubDate>Tue, 27 Oct 2020 21:30:51 +0800</pubDate><description><![CDATA[测试地址：☞

【题目描述】

小明在一次聚会中，不慎遗失了自己的钱包，在接下来的日子，面对小明的将是一系列的补卡手续和堆积的账单… 在小明的百般恳求下，老板最终同意延缓账单的支付时间。可老板又提出，必须从目前还没有支付的所有账单中选出面额最大和最小的两张，并把他们付清。还没有支付的账单会被保留到下一天。 请你帮他计算出支付的顺序。

【输入】

第1行：一个正整数N(N≤15,000)，表示小明补办银联卡总共的天数。

第2行到第N+1 行：每一行描述一天中收到的帐单。先是一个非负整数M≤100，表示当天]]></description><category></category></item></channel></rss>