<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[bushadid的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/bushadid</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; bushadid]]></copyright><item><title><![CDATA[hdu 1892 A Bug's Life]]></title><link>https://blog.youkuaiyun.com/bushadid/article/details/53993369</link><guid>https://blog.youkuaiyun.com/bushadid/article/details/53993369</guid><author>bushadid</author><pubDate>Tue, 03 Jan 2017 12:45:38 +0800</pubDate><description><![CDATA[http://acm.split.hdu.edu.cn/showproblem.php?pid=1829



A Bug's Life 
Time Limit: 15000/5000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 14269    Accepted ]]></description><category></category></item><item><title><![CDATA[hdu 1325 Is It A Tree?]]></title><link>https://blog.youkuaiyun.com/bushadid/article/details/53980323</link><guid>https://blog.youkuaiyun.com/bushadid/article/details/53980323</guid><author>bushadid</author><pubDate>Mon, 02 Jan 2017 16:50:00 +0800</pubDate><description><![CDATA[http://acm.split.hdu.edu.cn/showproblem.php?pid=1325





“英雄互娱”欢迎ACM选手加盟~





Is It A Tree?
Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)
Total Su]]></description><category></category></item><item><title><![CDATA[hdu 1272 小希的迷宫]]></title><link>https://blog.youkuaiyun.com/bushadid/article/details/53977357</link><guid>https://blog.youkuaiyun.com/bushadid/article/details/53977357</guid><author>bushadid</author><pubDate>Mon, 02 Jan 2017 12:40:17 +0800</pubDate><description><![CDATA[http://acm.split.hdu.edu.cn/showproblem.php?pid=1272



上次Gardon的迷宫城堡小希玩了很久（见Problem B），现在她也想设计一个迷宫让Gardon来走。但是她设计迷宫的思路不一样，首先她认为所有的通道都应该是双向连通的，就是说如果有一个通道连通了房间A和B，那么既可以通过它从房间A走到房间B，也可以通过它从房间B走到房间A，]]></description><category></category></item><item><title><![CDATA[hdu 3350 #define is unsafe]]></title><link>https://blog.youkuaiyun.com/bushadid/article/details/53957763</link><guid>https://blog.youkuaiyun.com/bushadid/article/details/53957763</guid><author>bushadid</author><pubDate>Sat, 31 Dec 2016 19:20:09 +0800</pubDate><description><![CDATA[http://acm.split.hdu.edu.cn/showproblem.php?pid=3350

#define is unsafe
Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 494    Accepted Sub]]></description><category></category></item><item><title><![CDATA[hdu 1426 Sudoku Killer]]></title><link>https://blog.youkuaiyun.com/bushadid/article/details/53892998</link><guid>https://blog.youkuaiyun.com/bushadid/article/details/53892998</guid><author>bushadid</author><pubDate>Tue, 27 Dec 2016 09:39:45 +0800</pubDate><description><![CDATA[http://acm.split.hdu.edu.cn/showproblem.php?pid=1426



自从2006年3月10日至11日的首届数独世界锦标赛以后，数独这项游戏越来越受到人们的喜爱和重视。
据说，在2008北京奥运会上，会将数独列为一个单独的项目进行比赛，冠军将有可能获得的一份巨大的奖品———HDU免费七日游外加lcy亲笔签名以及同hdu acm team合影留念的]]></description><category></category></item><item><title><![CDATA[再code blocks中配置NTL]]></title><link>https://blog.youkuaiyun.com/bushadid/article/details/53759957</link><guid>https://blog.youkuaiyun.com/bushadid/article/details/53759957</guid><author>bushadid</author><pubDate>Tue, 20 Dec 2016 10:38:55 +0800</pubDate><description><![CDATA[1. 在  http://www.shoup.net/ntl/  下载NTL压缩包


2.将include下的NTL文件放到  clodeblocks 的安装路径的 include 文件夹下







3.新建一个  静态库的工程文件







4.然后在项目中添加  src 文件   里面是cpp文件









5.编译]]></description><category></category></item><item><title><![CDATA[hdu 1547 Bubble Shooter]]></title><link>https://blog.youkuaiyun.com/bushadid/article/details/53391335</link><guid>https://blog.youkuaiyun.com/bushadid/article/details/53391335</guid><author>bushadid</author><pubDate>Tue, 29 Nov 2016 12:35:39 +0800</pubDate><description><![CDATA[http://acm.split.hdu.edu.cn/showproblem.php?pid=1547



Bubble Shooter
Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 1074    Accepted S]]></description><category></category></item><item><title><![CDATA[hdu 2612 Find a way]]></title><link>https://blog.youkuaiyun.com/bushadid/article/details/53383505</link><guid>https://blog.youkuaiyun.com/bushadid/article/details/53383505</guid><author>bushadid</author><pubDate>Mon, 28 Nov 2016 20:08:04 +0800</pubDate><description><![CDATA[http://acm.split.hdu.edu.cn/showproblem.php?pid=2612





Problem Description
Pass a year learning in Hangzhou, yifenfei arrival hometown Ningbo at finally. Leave Ningbo one year, yifenfei have]]></description><category></category></item><item><title><![CDATA[hdu  1242 Rescue]]></title><link>https://blog.youkuaiyun.com/bushadid/article/details/53365703</link><guid>https://blog.youkuaiyun.com/bushadid/article/details/53365703</guid><author>bushadid</author><pubDate>Sun, 27 Nov 2016 17:53:14 +0800</pubDate><description><![CDATA[Rescue
Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 27762    Accepted Submission(s): 9819


Problem Description
Angel was caught by th]]></description><category></category></item><item><title><![CDATA[hdu 1180 诡异的楼梯]]></title><link>https://blog.youkuaiyun.com/bushadid/article/details/53349783</link><guid>https://blog.youkuaiyun.com/bushadid/article/details/53349783</guid><author>bushadid</author><pubDate>Sat, 26 Nov 2016 11:44:10 +0800</pubDate><description><![CDATA[http://acm.split.hdu.edu.cn/showproblem.php?pid=1180



诡异的楼梯
Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 131072/65536 K (Java/Others)
Total Submission(s): 13536    Accepted Submissi]]></description><category></category></item><item><title><![CDATA[hdu 5971 Wrestling Match]]></title><link>https://blog.youkuaiyun.com/bushadid/article/details/53066876</link><guid>https://blog.youkuaiyun.com/bushadid/article/details/53066876</guid><author>bushadid</author><pubDate>Mon, 07 Nov 2016 15:46:12 +0800</pubDate><description><![CDATA[http://acm.split.hdu.edu.cn/showproblem.php?pid=5971





Wrestling Match
Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others)
Total Submission(s): 116    Accept]]></description><category></category></item><item><title><![CDATA[JAVA之BigInteger]]></title><link>https://blog.youkuaiyun.com/bushadid/article/details/52892977</link><guid>https://blog.youkuaiyun.com/bushadid/article/details/52892977</guid><author>bushadid</author><pubDate>Sat, 22 Oct 2016 16:06:57 +0800</pubDate><description><![CDATA[JAVA之BigInteger








用Java来处理高精度问题，相信对很多ACMer来说都是一件很happy的事，简单易懂。用Java刷了一些题，感觉Java还不错，在处理高精度和进制转换中，调用库函数的来处理。下面是写的一些Java中一些基本的函数的及其……

头文件：import java.io.*;

import java.util.*;

imp]]></description><category></category></item><item><title><![CDATA[hdu 2511 汉诺塔 X]]></title><link>https://blog.youkuaiyun.com/bushadid/article/details/52784933</link><guid>https://blog.youkuaiyun.com/bushadid/article/details/52784933</guid><author>bushadid</author><pubDate>Tue, 11 Oct 2016 09:10:52 +0800</pubDate><description><![CDATA[http://acm.hdu.edu.cn/showproblem.php?pid=2511







Problem Description
1,2,...,n表示n个盘子．数字大盘子就大．n个盘子放在第１根柱子上．大盘不能放在小盘上．在第１根柱子上的盘子是a[1],a[2],...,a[n]. a[1]=n,a[2]=n-1,...,a[n]=1.即a[1]是最下面的盘子]]></description><category></category></item><item><title><![CDATA[hud 1010 Tempter of the Bone]]></title><link>https://blog.youkuaiyun.com/bushadid/article/details/52698447</link><guid>https://blog.youkuaiyun.com/bushadid/article/details/52698447</guid><author>bushadid</author><pubDate>Thu, 29 Sep 2016 09:03:00 +0800</pubDate><description><![CDATA[http://acm.split.hdu.edu.cn/showproblem.php?pid=1010



Problem Description
The doggie found a bone in an ancient maze, which fascinated him a lot. However, when he picked it up, the maze began t]]></description><category></category></item><item><title><![CDATA[hdu 2102 A计划]]></title><link>https://blog.youkuaiyun.com/bushadid/article/details/52652828</link><guid>https://blog.youkuaiyun.com/bushadid/article/details/52652828</guid><author>bushadid</author><pubDate>Sat, 24 Sep 2016 19:18:10 +0800</pubDate><description><![CDATA[http://acm.split.hdu.edu.cn/showproblem.php?pid=2102

Problem Description
可怜的公主在一次次被魔王掳走一次次被骑士们救回来之后，而今，不幸的她再一次面临生命的考验。魔王已经发出消息说将在T时刻吃掉公主，因为他听信谣言说吃公主的肉也能长生不老。年迈的国王正是心急如焚，告招天下勇士来拯救公主。不过公主早已习以为常，她深信智]]></description><category></category></item><item><title><![CDATA[hdu 2133 What day is it]]></title><link>https://blog.youkuaiyun.com/bushadid/article/details/52643214</link><guid>https://blog.youkuaiyun.com/bushadid/article/details/52643214</guid><author>bushadid</author><pubDate>Fri, 23 Sep 2016 21:02:45 +0800</pubDate><description><![CDATA[http://acm.split.hdu.edu.cn/showproblem.php?pid=2133



Problem Description
Today is Saturday, 17th Nov,2007. Now, if i tell you a date, can you tell me what day it is ?

 

Input
There are ]]></description><category></category></item><item><title><![CDATA[hdu 2191 悼念512汶川大地震遇难同胞——珍惜现在，感恩生活]]></title><link>https://blog.youkuaiyun.com/bushadid/article/details/52593617</link><guid>https://blog.youkuaiyun.com/bushadid/article/details/52593617</guid><author>bushadid</author><pubDate>Tue, 20 Sep 2016 10:44:18 +0800</pubDate><description><![CDATA[http://acm.split.hdu.edu.cn/showproblem.php?pid=2191



Problem Description
急！灾区的食物依然短缺！
为了挽救灾区同胞的生命，心系灾区同胞的你准备自己采购一些粮食支援灾区，现在假设你一共有资金n元，而市场有m种大米，每种大米都是袋装产品，其价格不等，并且只能整袋购买。
请问：你用有限的资金最多能采购多少公斤粮]]></description><category></category></item><item><title><![CDATA[hdu 2222 Keywords Search  （AC自动机）]]></title><link>https://blog.youkuaiyun.com/bushadid/article/details/52555032</link><guid>https://blog.youkuaiyun.com/bushadid/article/details/52555032</guid><author>bushadid</author><pubDate>Fri, 16 Sep 2016 12:56:17 +0800</pubDate><description><![CDATA[视频地址  
http://www.bilibili.com/video/av6295004/index_2.html
题目地址 
http://acm.hdu.edu.cn/showproblem.php?pid=2222
简介地址 
http://blog.youkuaiyun.com/niushuai666/article/details/7002823



AC自动机简介： 
首]]></description><category></category></item><item><title><![CDATA[hdu 1455 Sticks]]></title><link>https://blog.youkuaiyun.com/bushadid/article/details/52538457</link><guid>https://blog.youkuaiyun.com/bushadid/article/details/52538457</guid><author>bushadid</author><pubDate>Wed, 14 Sep 2016 15:36:15 +0800</pubDate><description><![CDATA[http://acm.hdu.edu.cn/showproblem.php?pid=1455
 
http://www.acmerblog.com/hdu-1455-Sticks-1979.html
 
Problem Description
George took sticks of the same length and cut them randomly until all par]]></description><category></category></item><item><title><![CDATA[hdu 2553 N皇后问题]]></title><link>https://blog.youkuaiyun.com/bushadid/article/details/52537220</link><guid>https://blog.youkuaiyun.com/bushadid/article/details/52537220</guid><author>bushadid</author><pubDate>Wed, 14 Sep 2016 13:22:23 +0800</pubDate><description><![CDATA[http://acm.hdu.edu.cn/showproblem.php?pid=2553





Problem Description
在N*N的方格棋盘放置了N个皇后，使得它们不相互攻击（即任意2个皇后不允许处在同一排，同一列，也不允许处在与棋盘边框成45角的斜线上。
你的任务是，对于给定的N，求出有多少种合法的放置方法。


 

Input
共有若干行，每]]></description><category></category></item></channel></rss>