<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[一只小菜鸡的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/vizard_</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; vizard_]]></copyright><item><title><![CDATA[完美数列（暴力枚举）]]></title><link>https://blog.youkuaiyun.com/vizard_/article/details/77683562</link><guid>https://blog.youkuaiyun.com/vizard_/article/details/77683562</guid><author>vizard_</author><pubDate>Tue, 29 Aug 2017 17:28:06 +0800</pubDate><description><![CDATA[描述


给定一个正整数数列，和正整数p，设这个数列中的最大值是M，最小值是m，如果M 

现在给定参数p和一些正整数，请你从中选择尽可能多的数构成一个完美数列。




输入


输入第一行给出两个正整数N和p，其中N（5）是输入的正整数的个数，p（9）是给定的参数。第二行给出N个正整数，每个数不超过109。


输出


在一行中输出最多可以选择多少个数可]]></description><category></category></item><item><title><![CDATA[Home Work （贪心法基础）]]></title><link>https://blog.youkuaiyun.com/vizard_/article/details/77509478</link><guid>https://blog.youkuaiyun.com/vizard_/article/details/77509478</guid><author>vizard_</author><pubDate>Wed, 23 Aug 2017 18:36:44 +0800</pubDate><description><![CDATA[临近开学了，大家都忙着收拾行李准备返校，但I_Love_C却不为此担心! 
因为他的心思全在暑假作业上：目前为止还未开动(-_-!!还以为他有多冷静呢)。

暑假作业是很多张试卷，我们这些从试卷里爬出来的人都知道，卷子上的题目有选择题、填空题、简答题、证明题等。 
而做选择题的好处就在于工作量很少，但又因为选择题题目都普遍很长。 
如果有5张试卷，其中4张是选择题，最后一张是填空题，很明]]></description><category></category></item><item><title><![CDATA[GCD & LCM （数学基础）]]></title><link>https://blog.youkuaiyun.com/vizard_/article/details/77479364</link><guid>https://blog.youkuaiyun.com/vizard_/article/details/77479364</guid><author>vizard_</author><pubDate>Tue, 22 Aug 2017 14:08:57 +0800</pubDate><description><![CDATA[Given x and y (2 <= x <= 100,000, 2 <= y <= 1,000,000), you are to count the number of p and q such that:


1) p and q are positive integers;
2) GCD(p, q) = x;
3) LCM(p, q) = y.
input

There a]]></description><category></category></item><item><title><![CDATA[分糖果系列一（DP＋暴力）]]></title><link>https://blog.youkuaiyun.com/vizard_/article/details/77444140</link><guid>https://blog.youkuaiyun.com/vizard_/article/details/77444140</guid><author>vizard_</author><pubDate>Mon, 21 Aug 2017 09:56:45 +0800</pubDate><description><![CDATA[描述


Oliver分别有币值为1，3，5，7，9，13元的硬币a，b，c，d，e，f枚。一天她去大学生超市买糖吃，糖的价格为g元。

问：用Oliver仅有的这6种硬币去恰好购买这g元的糖果，最少需要支付多少个硬币？（当不能支付时输出“impossible”）


输入


输入数据有多组（当输入连续的7个零时，结束。该组数据不做处理）

每组数据依次输入币值为1，3]]></description><category></category></item><item><title><![CDATA[判断多边形凹凸（计算几何）]]></title><link>https://blog.youkuaiyun.com/vizard_/article/details/77427834</link><guid>https://blog.youkuaiyun.com/vizard_/article/details/77427834</guid><author>vizard_</author><pubDate>Sun, 20 Aug 2017 12:27:39 +0800</pubDate><description><![CDATA[描述

任意给定一个多边形，判断它是凸还是凹。多边形的顶点以逆时针方向的序列来表示。


输入

输入包含多组测试数据，每组数据占2行，首先一行是一个整数n，表示多边形顶点的个数，然后一行是2×n个整数，表示逆时针顺序的n个顶点的坐标（xi,yi），n为0的时候结束输入。

输出

对于每个测试实例，如果地块的形状为凸多边形，请输出“convex”,否则输出”concave”]]></description><category></category></item><item><title><![CDATA[Max Sum Plus Plus （DP）]]></title><link>https://blog.youkuaiyun.com/vizard_/article/details/77407688</link><guid>https://blog.youkuaiyun.com/vizard_/article/details/77407688</guid><author>vizard_</author><pubDate>Sat, 19 Aug 2017 11:06:40 +0800</pubDate><description><![CDATA[Now I think you have got an AC in Ignatius.L's "Max Sum" problem. To be a brave ACMer, we always challenge ourselves to more difficult problems. Now you are faced with a more difficult
 problem.

G]]></description><category></category></item><item><title><![CDATA[Area in Triangle （计算几何）]]></title><link>https://blog.youkuaiyun.com/vizard_/article/details/77371783</link><guid>https://blog.youkuaiyun.com/vizard_/article/details/77371783</guid><author>vizard_</author><pubDate>Fri, 18 Aug 2017 16:30:20 +0800</pubDate><description><![CDATA[Given a triangle field and a rope of a certain length (Figure-1), you are required to use the rope to enclose a region within the field and make the region as large as possible.


input

The inpu]]></description><category></category></item><item><title><![CDATA[In-circles Again （计算几何）]]></title><link>https://blog.youkuaiyun.com/vizard_/article/details/77351504</link><guid>https://blog.youkuaiyun.com/vizard_/article/details/77351504</guid><author>vizard_</author><pubDate>Fri, 18 Aug 2017 06:57:06 +0800</pubDate><description><![CDATA[In the figure below you can see triangle ABC and its in-circle (Circle that touches all the sides of a triangle internally). The radius of this in circle is r. Three other circles are drawn. Each
 of]]></description><category></category></item><item><title><![CDATA[Watashi's BG （深搜）]]></title><link>https://blog.youkuaiyun.com/vizard_/article/details/77322996</link><guid>https://blog.youkuaiyun.com/vizard_/article/details/77322996</guid><author>vizard_</author><pubDate>Thu, 17 Aug 2017 13:09:53 +0800</pubDate><description><![CDATA[Watashi is the couch of ZJU-ICPC Team and he is very kind hearted. In ZJU-ICPC summer training camp, students are divided into several groups and each day one of the groups will design some problems
]]></description><category></category></item><item><title><![CDATA[Graph’s Cycle Component（并查集优化）]]></title><link>https://blog.youkuaiyun.com/vizard_/article/details/77321207</link><guid>https://blog.youkuaiyun.com/vizard_/article/details/77321207</guid><author>vizard_</author><pubDate>Thu, 17 Aug 2017 12:11:34 +0800</pubDate><description><![CDATA[In graph theory, a cycle graph is an undirected graph that consists of a single cycle, or in other words, some number of vertices connected in a closed chain.
Now, you are given a graph where some ve]]></description><category></category></item><item><title><![CDATA[Risk（最短路径Floyd算法）]]></title><link>https://blog.youkuaiyun.com/vizard_/article/details/77244199</link><guid>https://blog.youkuaiyun.com/vizard_/article/details/77244199</guid><author>vizard_</author><pubDate>Wed, 16 Aug 2017 13:39:20 +0800</pubDate><description><![CDATA[Risk is a board game in which several opposing players attempt to conquer the world. The gameboard consists of a world map broken up into hypothetical countries. During a player's turn, armies station]]></description><category></category></item><item><title><![CDATA[A DP Problem （字符串处理＋模拟）]]></title><link>https://blog.youkuaiyun.com/vizard_/article/details/77241040</link><guid>https://blog.youkuaiyun.com/vizard_/article/details/77241040</guid><author>vizard_</author><pubDate>Wed, 16 Aug 2017 12:44:32 +0800</pubDate><description><![CDATA[In this problem, you are to solve a very easy linear equation with only one variable x with no parentheses! An example of such equations is like the following:

2x - 4 + 5x + 300 = 98x
An expressio]]></description><category></category></item><item><title><![CDATA[Max Sequence （DP）]]></title><link>https://blog.youkuaiyun.com/vizard_/article/details/77231193</link><guid>https://blog.youkuaiyun.com/vizard_/article/details/77231193</guid><author>vizard_</author><pubDate>Wed, 16 Aug 2017 10:46:40 +0800</pubDate><description><![CDATA[Give you N integers a1, a2 ... aN (|ai| <=1000, 1 <= i <= N).





You should output S. 
input 

The input will consist of several test cases. For each test case, one integer N (2 <= N <= 100]]></description><category></category></item><item><title><![CDATA[URL （STL模拟）]]></title><link>https://blog.youkuaiyun.com/vizard_/article/details/77217849</link><guid>https://blog.youkuaiyun.com/vizard_/article/details/77217849</guid><author>vizard_</author><pubDate>Wed, 16 Aug 2017 09:36:25 +0800</pubDate><description><![CDATA[WHU ACM Team is working on a brand new web browser named "Whu-Super-Browser". You're in response for a powerful feature: recording the previous addresses. Moreover, when a string is inputted, the brow]]></description><category></category></item><item><title><![CDATA[Monthly Expense （最大值最小化＋二分法）]]></title><link>https://blog.youkuaiyun.com/vizard_/article/details/77215713</link><guid>https://blog.youkuaiyun.com/vizard_/article/details/77215713</guid><author>vizard_</author><pubDate>Wed, 16 Aug 2017 09:30:10 +0800</pubDate><description><![CDATA[Farmer John is an astounding accounting wizard and has realized he might run out of money to run the farm. He has already calculated and recorded the exact amount of money (1 ≤
moneyi ≤ 10,000) that ]]></description><category></category></item><item><title><![CDATA[Constructing Roads （最小生成树）]]></title><link>https://blog.youkuaiyun.com/vizard_/article/details/77210919</link><guid>https://blog.youkuaiyun.com/vizard_/article/details/77210919</guid><author>vizard_</author><pubDate>Wed, 16 Aug 2017 09:15:45 +0800</pubDate><description><![CDATA[There are N villages, which are numbered from 1 to N, and you should build some roads such that every two villages can connect to each other. We say two village A and B are connected, if and only if t]]></description><category></category></item><item><title><![CDATA[迷宫城堡（并查集，强连通分量）]]></title><link>https://blog.youkuaiyun.com/vizard_/article/details/77188915</link><guid>https://blog.youkuaiyun.com/vizard_/article/details/77188915</guid><author>vizard_</author><pubDate>Tue, 15 Aug 2017 14:22:35 +0800</pubDate><description><![CDATA[为了训练小希的方向感，Gardon建立了一座大城堡，里面有N个房间(N

输入


输入包含多组数据，输入的第一行有两个数：N和M，接下来的M行每行有两个数a和b，表示了一条通道可以从A房间来到B房间。文件最后以两个0结束。
 


输出


对于输入的每组数据，如果任意两个房间都是相互连接的，输出"Yes"，否则输出"No"。
 


样例输入
3 3
1 2]]></description><category></category></item><item><title><![CDATA[小希的迷宫（并查集）]]></title><link>https://blog.youkuaiyun.com/vizard_/article/details/77187898</link><guid>https://blog.youkuaiyun.com/vizard_/article/details/77187898</guid><author>vizard_</author><pubDate>Tue, 15 Aug 2017 13:31:13 +0800</pubDate><description><![CDATA[上次Gardon的迷宫城堡小希玩了很久（见Problem B），现在她也想设计一个迷宫让Gardon来走。但是她设计迷宫的思路不一样，首先她认为所有的通道都应该是双向连通的，就是说如果有一个通道连通了房间A和B，那么既可以通过它从房间A走到房间B，也可以通过它从房间B走到房间A，为了提高难度，小希希望任意两个房间有且仅有一条路径可以相通（除非走了回头路）。小希现在把她的设计图给你，让你帮忙判断她的]]></description><category></category></item><item><title><![CDATA[Friends（并查集）]]></title><link>https://blog.youkuaiyun.com/vizard_/article/details/77187656</link><guid>https://blog.youkuaiyun.com/vizard_/article/details/77187656</guid><author>vizard_</author><pubDate>Tue, 15 Aug 2017 13:11:12 +0800</pubDate><description><![CDATA[There are some people traveling together. Some of them are friends. The friend relation is transitive, that is, if A and B are friends, B and C are friends, then A and C will become friends too.


]]></description><category></category></item><item><title><![CDATA[畅通工程（并查集）]]></title><link>https://blog.youkuaiyun.com/vizard_/article/details/77187627</link><guid>https://blog.youkuaiyun.com/vizard_/article/details/77187627</guid><author>vizard_</author><pubDate>Tue, 15 Aug 2017 13:06:12 +0800</pubDate><description><![CDATA[描述

某省调查城镇交通状况，得到现有城镇道路统计表，表中列出了每条道路直接连通的城镇。省政府“畅通工程”的目标是使全省任何两个城镇间都可以实现交通（但不一定有直接的道路相连，只要互相间接通过道路可达即可）。问最少还需要建设多少条道路？


输入

测试输入包含若干测试用例。每个测试用例的第1行给出两个正整数，分别是城镇数目N ( < 1000 )和道路数目M；随后的M行对应M条道路]]></description><category></category></item></channel></rss>