<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[DimonsInside的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/DimonsInside</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; DimonsInside]]></copyright><item><title><![CDATA[用分治思想求斐波那契数列（转自追梦__的博客）]]></title><link>https://blog.youkuaiyun.com/DimonsInside/article/details/79872991</link><guid>https://blog.youkuaiyun.com/DimonsInside/article/details/79872991</guid><author>DimonsInside</author><pubDate>Mon, 09 Apr 2018 21:27:01 +0800</pubDate><description><![CDATA[原文链接其实我们还可以将这个算法求斐波拉契数列的第10000000项对m取余，这样用到矩阵的乘法，下面给出具体的矩阵推导以及代码。C++代码      #include&amp;lt;iostream&amp;gt;  
    using namespace std;  
    class Matrix{  
    public:   
          int width,height;  
     ...]]></description><category></category></item><item><title><![CDATA[PAT A1067. Sort with Swap(0,*) (25)]]></title><link>https://blog.youkuaiyun.com/DimonsInside/article/details/79688775</link><guid>https://blog.youkuaiyun.com/DimonsInside/article/details/79688775</guid><author>DimonsInside</author><pubDate>Sun, 25 Mar 2018 17:45:22 +0800</pubDate><description><![CDATA[题目链接  Given any permutation of the numbers {0, 1, 2,..., N-1}, it is easy to sort them in increasing order.  But what if Swap(0, *) is the ONLY operation that is allowed to use?  For example, to sort ...]]></description><category></category></item><item><title><![CDATA[PAT A1037. Magic Coupon (25)]]></title><link>https://blog.youkuaiyun.com/DimonsInside/article/details/79687283</link><guid>https://blog.youkuaiyun.com/DimonsInside/article/details/79687283</guid><author>DimonsInside</author><pubDate>Sun, 25 Mar 2018 15:53:57 +0800</pubDate><description><![CDATA[题目链接  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 the value of that pr...]]></description><category></category></item><item><title><![CDATA[PAT A1033. To Fill or Not to Fill (25)]]></title><link>https://blog.youkuaiyun.com/DimonsInside/article/details/79657911</link><guid>https://blog.youkuaiyun.com/DimonsInside/article/details/79657911</guid><author>DimonsInside</author><pubDate>Thu, 22 Mar 2018 18:22:00 +0800</pubDate><description><![CDATA[题目链接  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 way from time to time.  Diff...]]></description><category></category></item><item><title><![CDATA[PAT A1080. Graduate Admission (30)]]></title><link>https://blog.youkuaiyun.com/DimonsInside/article/details/79254223</link><guid>https://blog.youkuaiyun.com/DimonsInside/article/details/79254223</guid><author>DimonsInside</author><pubDate>Sun, 04 Feb 2018 19:03:10 +0800</pubDate><description><![CDATA[题目链接
代码：
#include
#include 
#include 
using namespace std;
//N<=40000,M<=100,k<=5
int now;
struct Stu {
    int ge, gi, g;
    int sch[6];
    int rank, id;
};
struct Sch {
    int quota]]></description><category></category></item><item><title><![CDATA[PAT A1075. PAT Judge (25)]]></title><link>https://blog.youkuaiyun.com/DimonsInside/article/details/79249968</link><guid>https://blog.youkuaiyun.com/DimonsInside/article/details/79249968</guid><author>DimonsInside</author><pubDate>Sat, 03 Feb 2018 22:21:24 +0800</pubDate><description><![CDATA[题目链接
注意边界条件，代码如下：
#include
#include 
#include 
using namespace std;
int fmark[6];
//注意边界条件，例如6号提交了，但得分为0，仍需要输出
//所以在结构体中，设置flag来表示是否有“通过编译的提交”
//如果有，则flag记为true
struct User {
    int id, sc]]></description><category></category></item><item><title><![CDATA[PAT A1055. The World's Richest (25)]]></title><link>https://blog.youkuaiyun.com/DimonsInside/article/details/79248944</link><guid>https://blog.youkuaiyun.com/DimonsInside/article/details/79248944</guid><author>DimonsInside</author><pubDate>Sat, 03 Feb 2018 19:29:42 +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]]></description><category></category></item><item><title><![CDATA[PAT A1028. List Sorting (25)]]></title><link>https://blog.youkuaiyun.com/DimonsInside/article/details/79248291</link><guid>https://blog.youkuaiyun.com/DimonsInside/article/details/79248291</guid><author>DimonsInside</author><pubDate>Sat, 03 Feb 2018 17:28:03 +0800</pubDate><description><![CDATA[题目链接


Excel can sort records according to any column. Now you are supposed to imitate this function.
Input
Each input file contains one test case. For each case, the first line contains two inte]]></description><category></category></item><item><title><![CDATA[A1012. The Best Rank (25)]]></title><link>https://blog.youkuaiyun.com/DimonsInside/article/details/79209178</link><guid>https://blog.youkuaiyun.com/DimonsInside/article/details/79209178</guid><author>DimonsInside</author><pubDate>Tue, 30 Jan 2018 18:16:51 +0800</pubDate><description><![CDATA[A1012


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 Algebra), ]]></description><category></category></item><item><title><![CDATA[A1025. PAT Ranking (25)]]></title><link>https://blog.youkuaiyun.com/DimonsInside/article/details/79200181</link><guid>https://blog.youkuaiyun.com/DimonsInside/article/details/79200181</guid><author>DimonsInside</author><pubDate>Mon, 29 Jan 2018 21:36:32 +0800</pubDate><description><![CDATA[A1025

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 ra]]></description><category></category></item><item><title><![CDATA[A1046. Shortest Distance (20)]]></title><link>https://blog.youkuaiyun.com/DimonsInside/article/details/79190891</link><guid>https://blog.youkuaiyun.com/DimonsInside/article/details/79190891</guid><author>DimonsInside</author><pubDate>Mon, 29 Jan 2018 00:11:09 +0800</pubDate><description><![CDATA[A1046


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 Specification:
Each input]]></description><category></category></item><item><title><![CDATA[A1042. Shuffling Machine (20)]]></title><link>https://blog.youkuaiyun.com/DimonsInside/article/details/79190886</link><guid>https://blog.youkuaiyun.com/DimonsInside/article/details/79190886</guid><author>DimonsInside</author><pubDate>Mon, 29 Jan 2018 00:05:20 +0800</pubDate><description><![CDATA[A1042

The machine shuffles a deck of 54 cards according to a given random order and repeats for a given number of times. It is assumed that the initial status of a card deck is in the following ord]]></description><category></category></item><item><title><![CDATA[A1031. Hello World for U (20)]]></title><link>https://blog.youkuaiyun.com/DimonsInside/article/details/79190878</link><guid>https://blog.youkuaiyun.com/DimonsInside/article/details/79190878</guid><author>DimonsInside</author><pubDate>Mon, 29 Jan 2018 00:02:58 +0800</pubDate><description><![CDATA[A1031


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, the characters]]></description><category></category></item><item><title><![CDATA[A1019. General Palindromic Number (20)]]></title><link>https://blog.youkuaiyun.com/DimonsInside/article/details/79190872</link><guid>https://blog.youkuaiyun.com/DimonsInside/article/details/79190872</guid><author>DimonsInside</author><pubDate>Mon, 29 Jan 2018 00:01:17 +0800</pubDate><description><![CDATA[A1019


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 numbers are palindro]]></description><category></category></item><item><title><![CDATA[A1009. Product of Polynomials (25)]]></title><link>https://blog.youkuaiyun.com/DimonsInside/article/details/79190864</link><guid>https://blog.youkuaiyun.com/DimonsInside/article/details/79190864</guid><author>DimonsInside</author><pubDate>Mon, 29 Jan 2018 00:00:01 +0800</pubDate><description><![CDATA[A1009


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 each line contains ]]></description><category></category></item><item><title><![CDATA[A1006. Sign In and Sign Out (25)]]></title><link>https://blog.youkuaiyun.com/DimonsInside/article/details/79190857</link><guid>https://blog.youkuaiyun.com/DimonsInside/article/details/79190857</guid><author>DimonsInside</author><pubDate>Sun, 28 Jan 2018 23:58:40 +0800</pubDate><description><![CDATA[A1006


At the beginning of every day, the first person who signs in the computer room will unlock the door, and the last one who signs out will lock the door. Given the records of signing in's and]]></description><category></category></item><item><title><![CDATA[A1002. A+B for Polynomials (25)]]></title><link>https://blog.youkuaiyun.com/DimonsInside/article/details/79190851</link><guid>https://blog.youkuaiyun.com/DimonsInside/article/details/79190851</guid><author>DimonsInside</author><pubDate>Sun, 28 Jan 2018 23:57:18 +0800</pubDate><description><![CDATA[A1002


This time, you are supposed to find A+B where A and B are two polynomials.
Input
Each input file contains one test case. Each case occupies 2 lines, and each line contains the information]]></description><category></category></item><item><title><![CDATA[A1001. A+B Format (20)]]></title><link>https://blog.youkuaiyun.com/DimonsInside/article/details/79190836</link><guid>https://blog.youkuaiyun.com/DimonsInside/article/details/79190836</guid><author>DimonsInside</author><pubDate>Sun, 28 Jan 2018 23:55:36 +0800</pubDate><description><![CDATA[A1001


Calculate a + b and output the sum in standard format -- that is, the digits must be separated into groups of three by commas (unless there are less than four digits).
Input
Each input fi]]></description><category></category></item><item><title><![CDATA[A1082. Read Number in Chinese (25)]]></title><link>https://blog.youkuaiyun.com/DimonsInside/article/details/79189735</link><guid>https://blog.youkuaiyun.com/DimonsInside/article/details/79189735</guid><author>DimonsInside</author><pubDate>Sun, 28 Jan 2018 21:39:36 +0800</pubDate><description><![CDATA[A1082题目描述如下：Given an integer with no more than 9 digits, you are supposed to read it in the traditional Chinese way. Output &quot;Fu&quot; first if it is negative. For example, -123456789 is read as &quot;Fu yi Yi e...]]></description><category></category></item></channel></rss>