<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[dulongxiang の blog]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/dulongxiang</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; dulongxiang]]></copyright><item><title><![CDATA[2.6.5]]></title><link>https://blog.youkuaiyun.com/dulongxiang/article/details/125411132</link><guid>https://blog.youkuaiyun.com/dulongxiang/article/details/125411132</guid><author>dulongxiang</author><pubDate>Wed, 22 Jun 2022 15:55:19 +0800</pubDate><description><![CDATA[1111111111111111]]></description><category></category></item><item><title><![CDATA[[C/C++]1008 Elevator (20 分)]]></title><link>https://blog.youkuaiyun.com/dulongxiang/article/details/100054718</link><guid>https://blog.youkuaiyun.com/dulongxiang/article/details/100054718</guid><author>dulongxiang</author><pubDate>Sat, 24 Aug 2019 17:05:10 +0800</pubDate><description><![CDATA[1008 Elevator (20 分)
The highest building in our city has only one elevator. A request list is made up with N positive numbers. The numbers denote at which floors the elevator will stop, in specified ...]]></description><category></category></item><item><title><![CDATA[[C/C++] 1049 数列的片段和 (20 分)]]></title><link>https://blog.youkuaiyun.com/dulongxiang/article/details/100053559</link><guid>https://blog.youkuaiyun.com/dulongxiang/article/details/100053559</guid><author>dulongxiang</author><pubDate>Sat, 24 Aug 2019 16:01:14 +0800</pubDate><description><![CDATA[1049 数列的片段和 (20 分)
给定一个正数数列，我们可以从中截取任意的连续的几个数，称为片段。例如，给定数列 { 0.1, 0.2, 0.3, 0.4 }，我们有 (0.1) (0.1, 0.2) (0.1, 0.2, 0.3) (0.1, 0.2, 0.3, 0.4) (0.2) (0.2, 0.3) (0.2, 0.3, 0.4) (0.3) (0.3, 0.4) (0.4) 这 10...]]></description><category></category></item><item><title><![CDATA[[C/C++] 1003 我要通过！ (20 分)]]></title><link>https://blog.youkuaiyun.com/dulongxiang/article/details/100051000</link><guid>https://blog.youkuaiyun.com/dulongxiang/article/details/100051000</guid><author>dulongxiang</author><pubDate>Sat, 24 Aug 2019 14:01:03 +0800</pubDate><description><![CDATA[1003 我要通过！ (20 分)
“答案正确”是自动判题系统给出的最令人欢喜的回复。本题属于 PAT 的“答案正确”大派送 —— 只要读入的字符串满足下列条件，系统就输出“答案正确”，否则输出“答案错误”。
得到“答案正确”的条件是：
字符串中必须仅有 P、 A、 T这三种字符，不可以包含其它字符；
任意形如 xPATx 的字符串都可以获得“答案正确”，其中 x 或者是空字符串，或者是仅由字母 ...]]></description><category></category></item><item><title><![CDATA[[C/C++] 1019 数字黑洞 (20 分)]]></title><link>https://blog.youkuaiyun.com/dulongxiang/article/details/100038363</link><guid>https://blog.youkuaiyun.com/dulongxiang/article/details/100038363</guid><author>dulongxiang</author><pubDate>Fri, 23 Aug 2019 15:02:14 +0800</pubDate><description><![CDATA[1019 数字黑洞 (20 分)
给定任一个各位数字不完全相同的 4 位正整数，如果我们先把 4 个数字按非递增排序，再按非递减排序，然后用第 1 个数字减第 2 个数字，将得到一个新的数字。一直重复这样做，我们很快会停在有“数字黑洞”之称的 6174，这个神奇的数字也叫 Kaprekar 常数。
例如，我们从6767开始，将得到
7766 - 6677 = 1089
9810 - 0189 = ...]]></description><category></category></item><item><title><![CDATA[1083 List Grades (25 分)]]></title><link>https://blog.youkuaiyun.com/dulongxiang/article/details/99709292</link><guid>https://blog.youkuaiyun.com/dulongxiang/article/details/99709292</guid><author>dulongxiang</author><pubDate>Sun, 18 Aug 2019 20:59:03 +0800</pubDate><description><![CDATA[1083 List Grades (25 分)
Given a list of N student 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 reco...]]></description><category></category></item><item><title><![CDATA[[C/C++] 1055 The World's Richest (25 分)]]></title><link>https://blog.youkuaiyun.com/dulongxiang/article/details/99705965</link><guid>https://blog.youkuaiyun.com/dulongxiang/article/details/99705965</guid><author>dulongxiang</author><pubDate>Sun, 18 Aug 2019 20:33:02 +0800</pubDate><description><![CDATA[1055 The World’s Richest (25 分)
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, b...]]></description><category></category></item><item><title><![CDATA[[C/C++] 1028 List Sorting (25 分)]]></title><link>https://blog.youkuaiyun.com/dulongxiang/article/details/99705380</link><guid>https://blog.youkuaiyun.com/dulongxiang/article/details/99705380</guid><author>dulongxiang</author><pubDate>Sun, 18 Aug 2019 16:13:28 +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, the ...]]></description><category></category></item><item><title><![CDATA[[C/C++] 1016 Phone Bills (25 分)]]></title><link>https://blog.youkuaiyun.com/dulongxiang/article/details/99699585</link><guid>https://blog.youkuaiyun.com/dulongxiang/article/details/99699585</guid><author>dulongxiang</author><pubDate>Sat, 17 Aug 2019 23:45:31 +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 when...]]></description><category></category></item><item><title><![CDATA[[C/C++] 1012 The Best Rank (25 分)]]></title><link>https://blog.youkuaiyun.com/dulongxiang/article/details/99610886</link><guid>https://blog.youkuaiyun.com/dulongxiang/article/details/99610886</guid><author>dulongxiang</author><pubDate>Wed, 14 Aug 2019 21:38:59 +0800</pubDate><description><![CDATA[1012 The Best Rank (25 分)
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 Li...]]></description><category></category></item><item><title><![CDATA[[C/C++] 1058 A+B in Hogwarts (20 分)]]></title><link>https://blog.youkuaiyun.com/dulongxiang/article/details/98486862</link><guid>https://blog.youkuaiyun.com/dulongxiang/article/details/98486862</guid><author>dulongxiang</author><pubDate>Mon, 05 Aug 2019 14:50:34 +0800</pubDate><description><![CDATA[1058 A+B in Hogwarts (20 分)
If you are a fan of Harry Potter, you would know the world of magic has its own currency system – as Hagrid explained it to Harry, “Seventeen silver Sickles to a Galleon an...]]></description><category></category></item><item><title><![CDATA[[C/C++] 1031 Hello World for U (20 分)]]></title><link>https://blog.youkuaiyun.com/dulongxiang/article/details/98454843</link><guid>https://blog.youkuaiyun.com/dulongxiang/article/details/98454843</guid><author>dulongxiang</author><pubDate>Sun, 04 Aug 2019 16:23:16 +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[[C/C++] 1036 跟奥巴马一起编程(15)（15 分）]]></title><link>https://blog.youkuaiyun.com/dulongxiang/article/details/81604187</link><guid>https://blog.youkuaiyun.com/dulongxiang/article/details/81604187</guid><author>dulongxiang</author><pubDate>Sat, 03 Aug 2019 11:23:16 +0800</pubDate><description><![CDATA[1036 跟奥巴马一起编程(15)（15 分）

美国总统奥巴马不仅呼吁所有人都学习编程，甚至以身作则编写代码，成为美国历史上首位编写计算机代码的总统。2014年底，为庆祝“计算机科学教育周”正式启动，奥巴马编写了很简单的计算机代码：在屏幕上画一个正方形。现在你也跟他一起画吧！



输入格式：

输入在一行中给出正方形边长N（3&amp;lt;=N&amp;lt;=20）和组成正方形边的某种字符C，间隔一个空格...]]></description><category></category></item><item><title><![CDATA[[C/C++] 1011 World Cup Betting (20)（20 分）]]></title><link>https://blog.youkuaiyun.com/dulongxiang/article/details/81590338</link><guid>https://blog.youkuaiyun.com/dulongxiang/article/details/81590338</guid><author>dulongxiang</author><pubDate>Fri, 02 Aug 2019 22:19:15 +0800</pubDate><description><![CDATA[1011 World Cup Betting (20)（20 分）

With the 2010 FIFA World Cup running, football fans the world over were becoming increasingly excited as the best players from the best teams doing battles for the W...]]></description><category></category></item><item><title><![CDATA[[C/C++] 1009 Product of Polynomials (25 分)]]></title><link>https://blog.youkuaiyun.com/dulongxiang/article/details/98206079</link><guid>https://blog.youkuaiyun.com/dulongxiang/article/details/98206079</guid><author>dulongxiang</author><pubDate>Fri, 02 Aug 2019 15:08:35 +0800</pubDate><description><![CDATA[1009 Product of Polynomials (25 分)
This time, you are supposed to find A*B where A and B are two polynomials.
Input Specification:
Each input file contains one test case. Each case occupies 2 lines, a...]]></description><category></category></item><item><title><![CDATA[[C/C++] 1002 A+B for Polynomials (25 分)]]></title><link>https://blog.youkuaiyun.com/dulongxiang/article/details/97926368</link><guid>https://blog.youkuaiyun.com/dulongxiang/article/details/97926368</guid><author>dulongxiang</author><pubDate>Wed, 31 Jul 2019 15:56:42 +0800</pubDate><description><![CDATA[1002 A+B for Polynomials (25 分)
This time, you are supposed to find A+B where A and B are two polynomials.
Input Specification:
Each input file contains one test case. Each case occupies 2 lines, and ...]]></description><category></category></item><item><title><![CDATA[[C/C++] B1010 一元多项式求导 (25 分)]]></title><link>https://blog.youkuaiyun.com/dulongxiang/article/details/97899560</link><guid>https://blog.youkuaiyun.com/dulongxiang/article/details/97899560</guid><author>dulongxiang</author><pubDate>Wed, 31 Jul 2019 13:21:51 +0800</pubDate><description><![CDATA[1010 一元多项式求导 (25 分)
设计函数求一元多项式的导数。
输入格式:
以指数递降方式输入多项式非零项系数和指数（绝对值均为不超过 1000 的整数）。数字间以空格分隔。
输出格式:
以与输入相同的格式输出导数多项式非零项的系数和指数。数字间以空格分隔，但结尾不能有多余空格。注意“零多项式”的指数和系数都是 0，但是表示为0 0。
输入样例:
3 4 -5 2 6 1 -2 0
输出样例...]]></description><category></category></item><item><title><![CDATA[[C/C++] 1046 Shortest Distance (20 分)]]></title><link>https://blog.youkuaiyun.com/dulongxiang/article/details/97615420</link><guid>https://blog.youkuaiyun.com/dulongxiang/article/details/97615420</guid><author>dulongxiang</author><pubDate>Sun, 28 Jul 2019 17:02:07 +0800</pubDate><description><![CDATA[1046 Shortest Distance (20 分)
The task is really simple: given N exits on a highway which forms a simple cycle, you are supposed to tell the shortest distance between any pair of exits.
Input Specific...]]></description><category></category></item><item><title><![CDATA[[C/C++] 1042 Shuffling Machine (20 分)]]></title><link>https://blog.youkuaiyun.com/dulongxiang/article/details/97614633</link><guid>https://blog.youkuaiyun.com/dulongxiang/article/details/97614633</guid><author>dulongxiang</author><pubDate>Sun, 28 Jul 2019 14:53:31 +0800</pubDate><description><![CDATA[1042 Shuffling Machine (20 分)
Shuffling is a procedure used to randomize a deck of playing cards. Because standard shuffling techniques are seen as weak, and in order to avoid “inside jobs” where empl...]]></description><category></category></item><item><title><![CDATA[[C/C++] 1018 锤子剪刀布 (20 分)]]></title><link>https://blog.youkuaiyun.com/dulongxiang/article/details/97390576</link><guid>https://blog.youkuaiyun.com/dulongxiang/article/details/97390576</guid><author>dulongxiang</author><pubDate>Fri, 26 Jul 2019 14:55:36 +0800</pubDate><description><![CDATA[1018 锤子剪刀布 (20 分)
大家应该都会玩“锤子剪刀布”的游戏：两人同时给出手势，胜负规则如图所示：
FigCJB.jpg
现给出两人的交锋记录，请统计双方的胜、平、负次数，并且给出双方分别出什么手势的胜算最大。
输入格式：
输入第 1 行给出正整数 N（≤105），即双方交锋的次数。随后 N 行，每行给出一次交锋的信息，即甲、乙双方同时给出的的手势。C 代表“锤子”、J 代表“剪刀”、B...]]></description><category></category></item></channel></rss>