<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[Dream__For__You的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/Dream__For__You</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; Dream__For__You]]></copyright><item><title><![CDATA[Blowing Fuses]]></title><link>https://blog.youkuaiyun.com/Dream__For__You/article/details/77746997</link><guid>https://blog.youkuaiyun.com/Dream__For__You/article/details/77746997</guid><author>Dream__For__You</author><pubDate>Thu, 31 Aug 2017 15:14:16 +0800</pubDate><description><![CDATA[点击打开链接

                                                          Blowing Fuses





Maybe you are familiar with the following situation. You have plugged in a lot of electrical devices, such ]]></description><category></category></item><item><title><![CDATA[A - 我爱dijkstra]]></title><link>https://blog.youkuaiyun.com/Dream__For__You/article/details/77688408</link><guid>https://blog.youkuaiyun.com/Dream__For__You/article/details/77688408</guid><author>Dream__For__You</author><pubDate>Tue, 29 Aug 2017 21:21:06 +0800</pubDate><description><![CDATA[点击打开链接



A - 我爱dijkstra
 







给你n个点，m条无向边，每条边都有长度d和花费p，给你起点s终点t，要求输出起点到终点的最短距离及其花费，如果最短距离有多条路线，则输出花费最少的。

Input输入n,m，点的编号是1~n,然后是m行，每行4个数 a,b,d,p，表示a和b之间有一条边，且其长度为d，花费为p。最后一行是两个数 s,]]></description><category></category></item><item><title><![CDATA[E - 01背包-水题]]></title><link>https://blog.youkuaiyun.com/Dream__For__You/article/details/77688382</link><guid>https://blog.youkuaiyun.com/Dream__For__You/article/details/77688382</guid><author>Dream__For__You</author><pubDate>Tue, 29 Aug 2017 21:18:03 +0800</pubDate><description><![CDATA[点击打开链接





E - 01背包-水题
 







电子科大本部食堂的饭卡有一种很诡异的设计，即在购买之前判断余额。如果购买一个商品之前，卡上的剩余金额大于或等于5元，就一定可以购买成功（即使购买后卡上余额为负），否则无法购买（即使金额足够）。所以大家都希望尽量使卡上的余额最少。 
某天，食堂中有n种菜出售，每种菜可购买一次。已知每种菜的价格以及卡上的]]></description><category></category></item><item><title><![CDATA[过山车]]></title><link>https://blog.youkuaiyun.com/Dream__For__You/article/details/77429552</link><guid>https://blog.youkuaiyun.com/Dream__For__You/article/details/77429552</guid><author>Dream__For__You</author><pubDate>Sun, 20 Aug 2017 15:42:26 +0800</pubDate><description><![CDATA[点击打开链接






A - 过山车
Time Limit:1000MS     Memory Limit:32768KB     64bit IO Format:%I64d
 & %I64u
Submit Status




Description

RPG girls今天和大家一起去游乐场玩，终于可以坐上梦寐以求的过山车了。可是，过山车的每一排只有两个座]]></description><category></category></item><item><title><![CDATA[B - Ignatius and the Princess IV]]></title><link>https://blog.youkuaiyun.com/Dream__For__You/article/details/77014762</link><guid>https://blog.youkuaiyun.com/Dream__For__You/article/details/77014762</guid><author>Dream__For__You</author><pubDate>Wed, 09 Aug 2017 20:00:46 +0800</pubDate><description><![CDATA[点击打开链接



B - Ignatius and the Princess IV
 







"OK, you are not too bad, em... But you can never pass the next test." feng5166 says. 

"I will tell you an odd number N, and then N ]]></description><category></category></item><item><title><![CDATA[E - Super Jumping! Jumping! Jumping!]]></title><link>https://blog.youkuaiyun.com/Dream__For__You/article/details/77014604</link><guid>https://blog.youkuaiyun.com/Dream__For__You/article/details/77014604</guid><author>Dream__For__You</author><pubDate>Wed, 09 Aug 2017 19:54:17 +0800</pubDate><description><![CDATA[点击打开链接





E - Super Jumping! Jumping! Jumping!
 







Nowadays, a kind of chess game called “Super Jumping! Jumping! Jumping!” is very popular in HDU. Maybe you are a good boy, and ]]></description><category></category></item><item><title><![CDATA[B - Bridging signals]]></title><link>https://blog.youkuaiyun.com/Dream__For__You/article/details/77013451</link><guid>https://blog.youkuaiyun.com/Dream__For__You/article/details/77013451</guid><author>Dream__For__You</author><pubDate>Wed, 09 Aug 2017 19:47:26 +0800</pubDate><description><![CDATA[点击打开链接





B - Bridging signals
 







'Oh no, they've done it again', cries the chief designer at the Waferland chip factory. Once more the routing designers have screwed up complet]]></description><category></category></item><item><title><![CDATA[A - 最少拦截系统]]></title><link>https://blog.youkuaiyun.com/Dream__For__You/article/details/77012554</link><guid>https://blog.youkuaiyun.com/Dream__For__You/article/details/77012554</guid><author>Dream__For__You</author><pubDate>Wed, 09 Aug 2017 19:42:39 +0800</pubDate><description><![CDATA[点击打开链接







A - 最少拦截系统
 







某国为了防御敌国的导弹袭击,发展出一种导弹拦截系统.但是这种导弹拦截系统有一个缺陷:虽然它的第一发炮弹能够到达任意的高度,但是以后每一发炮弹都不能超过前一发的高度.某天,雷达捕捉到敌国的导弹来袭.由于该系统还在试用阶段,所以只有一套系统,因此有可能不能拦截所有的导弹. 
怎么办呢?多搞几套系统呗]]></description><category></category></item><item><title><![CDATA[问题 Fibonacci   hdu 1568]]></title><link>https://blog.youkuaiyun.com/Dream__For__You/article/details/76707383</link><guid>https://blog.youkuaiyun.com/Dream__For__You/article/details/76707383</guid><author>Dream__For__You</author><pubDate>Sat, 05 Aug 2017 10:27:59 +0800</pubDate><description><![CDATA[Fibonacci
Time Limit: 1000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 4381    Accepted Submission(s): 2036



Problem Description

2007年到来了。经过2006年]]></description><category></category></item><item><title><![CDATA[A - 还是畅通工程 HDU - 1233 (最小生成树)]]></title><link>https://blog.youkuaiyun.com/Dream__For__You/article/details/76691770</link><guid>https://blog.youkuaiyun.com/Dream__For__You/article/details/76691770</guid><author>Dream__For__You</author><pubDate>Fri, 04 Aug 2017 19:03:13 +0800</pubDate><description><![CDATA[点击打开链接





A - 还是畅通工程
 





某省调查乡村交通状况，得到的统计表中列出了任意两村庄间的距离。省政府“畅通工程”的目标是使全省任何两个村庄间都可以实现公路交通（但不一定有直接的公路相连，只要能间接通过公路可达即可），并要求铺设的公路总长度为最小。请计算最小的公路总长度。 


Input测试输入包含若干测试用例。每个测试用例的第1行给出村]]></description><category></category></item><item><title><![CDATA[C - Networking POJ - 1287 (最小生成树)]]></title><link>https://blog.youkuaiyun.com/Dream__For__You/article/details/76691762</link><guid>https://blog.youkuaiyun.com/Dream__For__You/article/details/76691762</guid><author>Dream__For__You</author><pubDate>Fri, 04 Aug 2017 19:01:58 +0800</pubDate><description><![CDATA[点击打开链接



C - Networking







You are assigned to design network connections between certain points in a wide area. You are given a set of points in the area, and a set of possible route]]></description><category></category></item><item><title><![CDATA[B - Highways POJ - 2485 (最小生成树)]]></title><link>https://blog.youkuaiyun.com/Dream__For__You/article/details/76691747</link><guid>https://blog.youkuaiyun.com/Dream__For__You/article/details/76691747</guid><author>Dream__For__You</author><pubDate>Fri, 04 Aug 2017 19:00:12 +0800</pubDate><description><![CDATA[点击打开链接



B - Highways







The island nation of Flatopia is perfectly flat. Unfortunately, Flatopia has no public highways. So the traffic is difficult in Flatopia. The Flatopian govern]]></description><category></category></item><item><title><![CDATA[D - 畅通工程 HDU - 1863 (最小生成树)]]></title><link>https://blog.youkuaiyun.com/Dream__For__You/article/details/76691725</link><guid>https://blog.youkuaiyun.com/Dream__For__You/article/details/76691725</guid><author>Dream__For__You</author><pubDate>Fri, 04 Aug 2017 18:58:00 +0800</pubDate><description><![CDATA[点击打开链接





D - 畅通工程
 







省政府“畅通工程”的目标是使全省任何两个村庄间都可以实现公路交通（但不一定有直接的公路相连，只要能间接通过公路可达即可）。经过调查评估，得到的统计表中列出了有可能建设公路的若干条道路的成本。现请你编写程序，计算出全省畅通需要的最低成本。 


Input测试输入包含若干测试用例。每个测试用例的第1行给出]]></description><category></category></item><item><title><![CDATA[D - Fox And Two Dots （dfs搜索）]]></title><link>https://blog.youkuaiyun.com/Dream__For__You/article/details/76467953</link><guid>https://blog.youkuaiyun.com/Dream__For__You/article/details/76467953</guid><author>Dream__For__You</author><pubDate>Mon, 31 Jul 2017 20:07:41 +0800</pubDate><description><![CDATA[点击打开链接





D - Fox And Two Dots
 







Fox Ciel is playing a mobile puzzle game called "Two Dots". The basic levels are played on a board of size n × m cells, like this:

Each cell]]></description><category></category></item><item><title><![CDATA[H - Birthday Paradox]]></title><link>https://blog.youkuaiyun.com/Dream__For__You/article/details/76467927</link><guid>https://blog.youkuaiyun.com/Dream__For__You/article/details/76467927</guid><author>Dream__For__You</author><pubDate>Mon, 31 Jul 2017 20:05:20 +0800</pubDate><description><![CDATA[点击打开链接





H - Birthday Paradox
 







Sometimes some mathematical results are hard to believe. One of the common problems is the birthday paradox. Suppose you are in a party where t]]></description><category></category></item><item><title><![CDATA[H - 欧拉 （欧拉函数）]]></title><link>https://blog.youkuaiyun.com/Dream__For__You/article/details/76397435</link><guid>https://blog.youkuaiyun.com/Dream__For__You/article/details/76397435</guid><author>Dream__For__You</author><pubDate>Sun, 30 Jul 2017 17:09:49 +0800</pubDate><description><![CDATA[点击打开链接



H - 欧拉
 







新年快到了，“猪头帮协会”准备搞一个聚会，已经知道现有会员N人，把会员从1到N编号，其中会长的号码是N号，凡是和会长是老朋友的，那么该会员的号码肯定和N有大于1的公约数，否则都是新朋友，现在会长想知道究竟有几个新朋友？请你编程序帮会长计算出来。

Input第一行是测试数据的组数CN（Case number，1
O]]></description><category></category></item><item><title><![CDATA[A - 抽屉 (抽屉原理)]]></title><link>https://blog.youkuaiyun.com/Dream__For__You/article/details/76395585</link><guid>https://blog.youkuaiyun.com/Dream__For__You/article/details/76395585</guid><author>Dream__For__You</author><pubDate>Sun, 30 Jul 2017 16:52:23 +0800</pubDate><description><![CDATA[点击打开链接



A - 抽屉
 







HOHO，终于从Speakless手上赢走了所有的糖果，是Gardon吃糖果时有个特殊的癖好，就是不喜欢将一样的糖果放在一起吃，喜欢先吃一种，下一次吃另一种，这样；可是Gardon不知道是否存在一种吃糖果的顺序使得他能把所有糖果都吃完？请你写个程序帮忙计算一下。 


Input第一行有一个整数T，接下来T组数据，]]></description><category></category></item><item><title><![CDATA[C - Trailing Zeroes (III) (二分)]]></title><link>https://blog.youkuaiyun.com/Dream__For__You/article/details/76239092</link><guid>https://blog.youkuaiyun.com/Dream__For__You/article/details/76239092</guid><author>Dream__For__You</author><pubDate>Fri, 28 Jul 2017 11:19:36 +0800</pubDate><description><![CDATA[点击打开链接





C - Trailing Zeroes (III)
 





You task is to find minimal natural number N, so that N! contains exactly Q zeroes on the trail in decimal notation. As you know N! = 1*2*...*]]></description><category></category></item><item><title><![CDATA[1的个数]]></title><link>https://blog.youkuaiyun.com/Dream__For__You/article/details/76165557</link><guid>https://blog.youkuaiyun.com/Dream__For__You/article/details/76165557</guid><author>Dream__For__You</author><pubDate>Wed, 26 Jul 2017 21:03:18 +0800</pubDate><description><![CDATA[点击打开链接






1027: 1的个数 [水题]
时间限制: 1 Sec 内存限制:
 128 MB

提交: 229 解决:
 163 统计

题目描述

给定一个整数$N$，请告诉我这个整数的二进制里面有多少个$1$。


输入

第一行输入一个整数$T$，代表有$T$组测试数据。

每组数据输入一个整数$N$。

注：$1 

]]></description><category></category></item><item><title><![CDATA[所爱图书]]></title><link>https://blog.youkuaiyun.com/Dream__For__You/article/details/76165527</link><guid>https://blog.youkuaiyun.com/Dream__For__You/article/details/76165527</guid><author>Dream__For__You</author><pubDate>Wed, 26 Jul 2017 21:00:48 +0800</pubDate><description><![CDATA[点击打开链接






1052: 所爱图书 [排序]
时间限制: 1 Sec 内存限制:
 128 MB

提交: 240 解决:
 123 统计

题目描述

你知道ISBN号码吗？
国际标准书号（International Standard Book Number），简称ISBN，是专门为识别图书等文献而设计的国际编号。
图书馆要采购图书，所以需要调查同]]></description><category></category></item></channel></rss>