<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[实乃悲怜的博客]]></title><description><![CDATA[平时放一些自己写的题吧，虽然都是矿泉水...]]></description><link>https://blog.youkuaiyun.com/leper_gnome</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; leper_gnome]]></copyright><item><title><![CDATA[网络流24题，启动]]></title><link>https://blog.youkuaiyun.com/leper_gnome/article/details/82787472</link><guid>https://blog.youkuaiyun.com/leper_gnome/article/details/82787472</guid><author>leper_gnome</author><pubDate>Thu, 20 Sep 2018 15:10:24 +0800</pubDate><description><![CDATA[网络流24题
	 
			题目名称
			试题链接
		1
			飞行员配对方案问题
			https://www.oj.swust.edu.cn/problem/show/1736
		2
			太空飞行计划问题
			https://www.oj.swust.edu.cn/problem/show/1737
		3
			最小路径覆盖问题
			https://www.oj.swust.edu...]]></description><category></category></item><item><title><![CDATA[2014ACM/ICPC亚洲区鞍山站-E||HDU - 5074]]></title><link>https://blog.youkuaiyun.com/leper_gnome/article/details/82693866</link><guid>https://blog.youkuaiyun.com/leper_gnome/article/details/82693866</guid><author>leper_gnome</author><pubDate>Thu, 13 Sep 2018 20:12:36 +0800</pubDate><description><![CDATA[题目链接：http://acm.hdu.edu.cn/showproblem.php?pid=5074

Hatsune Miku

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 262144/262144 K (Java/Others)
Total Submission(s): 1955    Accepted Submissio...]]></description><category></category></item><item><title><![CDATA[2014ACM/ICPC亚洲区广州站-I||HDU - 5135]]></title><link>https://blog.youkuaiyun.com/leper_gnome/article/details/82526799</link><guid>https://blog.youkuaiyun.com/leper_gnome/article/details/82526799</guid><author>leper_gnome</author><pubDate>Sat, 08 Sep 2018 10:45:46 +0800</pubDate><description><![CDATA[题目链接：http://acm.hdu.edu.cn/showproblem.php?pid=5135

Little Zu Chongzhi's Triangles

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 512000/512000 K (Java/Others)

Problem Description

Zu Chon...]]></description><category></category></item><item><title><![CDATA[[kuangbin带你飞]专题十一 网络流||POJ - 3281]]></title><link>https://blog.youkuaiyun.com/leper_gnome/article/details/82313245</link><guid>https://blog.youkuaiyun.com/leper_gnome/article/details/82313245</guid><author>leper_gnome</author><pubDate>Sun, 02 Sep 2018 10:54:15 +0800</pubDate><description><![CDATA[题目链接：http://poj.org/problem?id=3281

Dining

Cows are such finicky eaters. Each cow has a preference for certain foods and drinks, and she will consume no others.

Farmer John has cooked fabulous meal...]]></description><category></category></item><item><title><![CDATA[UVALive 7045—Last Defence]]></title><link>https://blog.youkuaiyun.com/leper_gnome/article/details/82284955</link><guid>https://blog.youkuaiyun.com/leper_gnome/article/details/82284955</guid><author>leper_gnome</author><pubDate>Sat, 01 Sep 2018 10:58:23 +0800</pubDate><description><![CDATA[链接：https://icpcarchive.ecs.baylor.edu/index.phpoption=com_onlinejudge&amp;amp;Itemid=8&amp;amp;page=show_problem&amp;amp;problem=5057



题意：给出数列前两项和递推公式，问你整个数列有多少个不同的数字 

思路：我们首先打个表，发现会出现循环段，即x,x-b,b.然后分析一下

设A=x...]]></description><category></category></item><item><title><![CDATA[牛客网暑期ACM多校训练营（第八场）E-Touring cities]]></title><link>https://blog.youkuaiyun.com/leper_gnome/article/details/81666099</link><guid>https://blog.youkuaiyun.com/leper_gnome/article/details/81666099</guid><author>leper_gnome</author><pubDate>Tue, 14 Aug 2018 15:11:42 +0800</pubDate><description><![CDATA[链接：https://www.nowcoder.com/acm/contest/146/E
来源：牛客网
 

题目描述

Niuniu wants to tour the cities in Moe country. Moe country has a total of n*m cities. The positions of the cities form a grid with n rows...]]></description><category></category></item><item><title><![CDATA[牛客网暑期ACM多校训练营（第七场）A-Minimum Cost Perfect Matching]]></title><link>https://blog.youkuaiyun.com/leper_gnome/article/details/81629056</link><guid>https://blog.youkuaiyun.com/leper_gnome/article/details/81629056</guid><author>leper_gnome</author><pubDate>Mon, 13 Aug 2018 14:17:01 +0800</pubDate><description><![CDATA[链接：https://www.nowcoder.com/acm/contest/145/A
来源：牛客网
 

题目描述

You have a complete bipartite graph where each part contains exactly n nodes, numbered from 0 to n - 1 inclusive.
The weight of the edge c...]]></description><category></category></item><item><title><![CDATA[牛客网暑期ACM多校训练营（第八场）G-Counting regions]]></title><link>https://blog.youkuaiyun.com/leper_gnome/article/details/81603535</link><guid>https://blog.youkuaiyun.com/leper_gnome/article/details/81603535</guid><author>leper_gnome</author><pubDate>Sun, 12 Aug 2018 10:43:37 +0800</pubDate><description><![CDATA[链接：https://www.nowcoder.com/acm/contest/146/G
来源：牛客网
 

题目描述

Niuniu likes mathematics. He also likes drawing pictures. One day, he was trying to draw a regular polygon with n vertices. He connected e...]]></description><category></category></item><item><title><![CDATA[牛客练习赛24 C-PH试纸]]></title><link>https://blog.youkuaiyun.com/leper_gnome/article/details/81584465</link><guid>https://blog.youkuaiyun.com/leper_gnome/article/details/81584465</guid><author>leper_gnome</author><pubDate>Sat, 11 Aug 2018 11:06:37 +0800</pubDate><description><![CDATA[链接：https://www.nowcoder.com/acm/contest/157/C
来源：牛客网
 

题目描述

    PH试纸，是一种检测酸碱度的试纸，试纸红色为酸性，蓝色为碱性。

    HtBest有一个PH试纸，试纸被分成了n段，每一段都可以被染色成红色或者蓝色，WHZ在试纸的每一段上都染为一种颜色，HtBest有m个询问，对于每个询问，Ta想知道某种颜色第qi次在什么地方出...]]></description><category></category></item><item><title><![CDATA[牛客练习赛24 A-石子阵列]]></title><link>https://blog.youkuaiyun.com/leper_gnome/article/details/81583325</link><guid>https://blog.youkuaiyun.com/leper_gnome/article/details/81583325</guid><author>leper_gnome</author><pubDate>Sat, 11 Aug 2018 09:55:35 +0800</pubDate><description><![CDATA[链接：https://www.nowcoder.com/acm/contest/157/A
来源：牛客网
 

题目描述

xb有m种石子，每种无限个，Ta想从这些石子中取出n个，并按顺序排列起来，为了好看，相邻的石子不能相同。xb想知道有多少种排列的方法。

输入描述:


第一行有两个正整数n，m。

输出描述:

第一行一个整数，表示在m种石子中取出n个的排列方案数模1000000007后的...]]></description><category></category></item><item><title><![CDATA[[kuangbin带你飞]专题一 简单搜索||POJ - 1321]]></title><link>https://blog.youkuaiyun.com/leper_gnome/article/details/81487912</link><guid>https://blog.youkuaiyun.com/leper_gnome/article/details/81487912</guid><author>leper_gnome</author><pubDate>Tue, 07 Aug 2018 20:30:56 +0800</pubDate><description><![CDATA[题目链接：http://poj.org/problem?id=1321

棋盘问题

在一个给定形状的棋盘（形状可能是不规则的）上面摆放棋子，棋子没有区别。要求摆放时任意的两个棋子不能放在棋盘中的同一行或者同一列，请编程求解对于给定形状和大小的棋盘，摆放k个棋子的所有可行的摆放方案C。

Input

输入含有多组测试数据。 
每组数据的第一行是两个正整数，n k，用一个空格隔开，表示了将在一个n...]]></description><category></category></item><item><title><![CDATA[牛客网暑期ACM多校训练营（第六场）J-Heritage of skywalkert]]></title><link>https://blog.youkuaiyun.com/leper_gnome/article/details/81481117</link><guid>https://blog.youkuaiyun.com/leper_gnome/article/details/81481117</guid><author>leper_gnome</author><pubDate>Tue, 07 Aug 2018 14:56:24 +0800</pubDate><description><![CDATA[链接：https://www.nowcoder.com/acm/contest/144/J
来源：牛客网

 
 
题目描述



skywalkert, the new legend of Beihang University ACM-ICPC Team, retired this year leaving a group of newbies again.
 

Rumor has it th...]]></description><category></category></item><item><title><![CDATA[牛客网暑期ACM多校训练营（第六场）A-Singing Contest]]></title><link>https://blog.youkuaiyun.com/leper_gnome/article/details/81432235</link><guid>https://blog.youkuaiyun.com/leper_gnome/article/details/81432235</guid><author>leper_gnome</author><pubDate>Sun, 05 Aug 2018 16:16:32 +0800</pubDate><description><![CDATA[链接：https://www.nowcoder.com/acm/contest/144/A
来源：牛客网
 

题目描述

Jigglypuff is holding a singing contest. There are 2n singers indexed from 1 to 2n participating in the contest.
The rule of this contest ...]]></description><category></category></item><item><title><![CDATA[牛客网暑期ACM多校训练营（第六场）D-Bulbasaur]]></title><link>https://blog.youkuaiyun.com/leper_gnome/article/details/81415351</link><guid>https://blog.youkuaiyun.com/leper_gnome/article/details/81415351</guid><author>leper_gnome</author><pubDate>Sat, 04 Aug 2018 21:08:06 +0800</pubDate><description><![CDATA[链接：https://www.nowcoder.com/acm/contest/144/D
来源：牛客网
 

题目描述

Silph company deployed a passenger flow analysis system in a clothing store that captures photos of human faces and photos of human bodies...]]></description><category></category></item><item><title><![CDATA[2018 杭电暑期多校第四场 Problem L. Graph Theory Homework]]></title><link>https://blog.youkuaiyun.com/leper_gnome/article/details/81352443</link><guid>https://blog.youkuaiyun.com/leper_gnome/article/details/81352443</guid><author>leper_gnome</author><pubDate>Thu, 02 Aug 2018 09:39:47 +0800</pubDate><description><![CDATA[题目链接：http://acm.hdu.edu.cn/showproblem.php?pid=6343

Problem L. Graph Theory Homework

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 262144/262144 K (Java/Others)
Total Submission(s): 366   ...]]></description><category></category></item><item><title><![CDATA[牛客网暑期ACM多校训练营（第二场）G-transform]]></title><link>https://blog.youkuaiyun.com/leper_gnome/article/details/81191243</link><guid>https://blog.youkuaiyun.com/leper_gnome/article/details/81191243</guid><author>leper_gnome</author><pubDate>Tue, 24 Jul 2018 20:44:43 +0800</pubDate><description><![CDATA[链接：https://www.nowcoder.com/acm/contest/140/G
来源：牛客网
 

题目描述

White Cloud placed n containers in sequence on a axes. The i-th container is located at x[i] and there are a[i] number of products in it.
...]]></description><category></category></item><item><title><![CDATA[牛客网小白月赛5 I-区间 (interval)]]></title><link>https://blog.youkuaiyun.com/leper_gnome/article/details/81173996</link><guid>https://blog.youkuaiyun.com/leper_gnome/article/details/81173996</guid><author>leper_gnome</author><pubDate>Mon, 23 Jul 2018 20:23:47 +0800</pubDate><description><![CDATA[链接：https://www.nowcoder.com/acm/contest/135/I
来源：牛客网
 

题目描述

    Apojacsleam喜欢数组。

    他现在有一个n个元素的数组a，而他要对a[L]-a[R]进行M次操作：

        操作一：将a[L]-a[R]内的元素都加上P

        操作二：将a[L]-a[R]内的元素都减去P

    最后询问a[l...]]></description><category></category></item><item><title><![CDATA[牛客网小白月赛5 H-最大公约数（lcm)]]></title><link>https://blog.youkuaiyun.com/leper_gnome/article/details/81173923</link><guid>https://blog.youkuaiyun.com/leper_gnome/article/details/81173923</guid><author>leper_gnome</author><pubDate>Mon, 23 Jul 2018 20:18:51 +0800</pubDate><description><![CDATA[链接：https://www.nowcoder.com/acm/contest/135/H
来源：牛客网
 

题目描述

给定两个正整数a,b,求a,b的最小公倍数。（即[a,b]）

输入描述:


两个整整数,a,b

输出描述:


一个正整数，表示[a,b]




输入


12 24

输出


24


输入


8 12

输出


24

说明


对于输入输出的所有数据，保证...]]></description><category></category></item><item><title><![CDATA[牛客网暑期ACM多校训练营（第二场）A- run]]></title><link>https://blog.youkuaiyun.com/leper_gnome/article/details/81173458</link><guid>https://blog.youkuaiyun.com/leper_gnome/article/details/81173458</guid><author>leper_gnome</author><pubDate>Mon, 23 Jul 2018 20:07:06 +0800</pubDate><description><![CDATA[链接：https://www.nowcoder.com/acm/contest/140/D
来源：牛客网
 

题目描述

White Cloud has built n stores numbered from 1 to n.
White Rabbit wants to visit these stores in the order from 1 to n.
The store numbered...]]></description><category></category></item><item><title><![CDATA[牛客网暑期ACM多校训练营（第二场）D-money]]></title><link>https://blog.youkuaiyun.com/leper_gnome/article/details/81169284</link><guid>https://blog.youkuaiyun.com/leper_gnome/article/details/81169284</guid><author>leper_gnome</author><pubDate>Mon, 23 Jul 2018 16:35:09 +0800</pubDate><description><![CDATA[链接：https://www.nowcoder.com/acm/contest/140/D
来源：牛客网
 

题目描述

White Cloud has built n stores numbered from 1 to n.
White Rabbit wants to visit these stores in the order from 1 to n.
The store numbered...]]></description><category></category></item></channel></rss>