2016年2月25日
Super Jumping! Jumping! Jumping!
摘要： Super Jumping! Jumping! Jumping! Problem Description Nowadays, a kind of chess game called “Super Jumping! Jumping! Jumping!” is very popular in HDU. 阅读全文
posted @ 2016-02-25 12:00 ACMSaga 阅读(259) 评论(0) 推荐(0)
HDU 1040 As Easy As A+B(排序)
摘要： As Easy As A+B Problem Description These days, I am thinking about a question, how can I get a problem as easy as A+B? It is fairly difficulty to do s 阅读全文
posted @ 2016-02-25 11:08 ACMSaga 阅读(379) 评论(0) 推荐(0)
2016年2月24日
VS2015转VS2008
摘要： 对于Windows8及以上的系统，无法安装VS2008，也不是无法安装，如果玩游戏多的，应该已经安装了.NET3.5，可以正常安装。 既然不能安装VS2008，那就安装VS2015好了，现在已经是Update2了，不过Update1用用也没事。 警告：毕竟08和15的跨度太大，部分改变不能简单地概括 阅读全文
posted @ 2016-02-24 19:17 ACMSaga 阅读(3619) 评论(0) 推荐(0)
HDU 1329 Hanoi Tower Troubles Again!(乱搞)
摘要： Hanoi Tower Troubles Again! Problem Description People stopped moving discs from peg to peg after they know the number of steps needed to complete the 阅读全文
posted @ 2016-02-24 14:33 ACMSaga 阅读(355) 评论(0) 推荐(0)
HDU 1062 Text Reverse(字符串)
摘要： Text Reverse Problem Description Ignatius likes to write words in reverse way. Given a single line of text which is written by Ignatius, you should re 阅读全文
posted @ 2016-02-24 14:04 ACMSaga 阅读(235) 评论(0) 推荐(0)
HDU 1013 Digital Roots(字符串)
摘要： Digital Roots Problem Description The digital root of a positive integer is found by summing the digits of the integer. If the resulting value is a si 阅读全文
posted @ 2016-02-24 13:06 ACMSaga 阅读(205) 评论(0) 推荐(0)
HDU 1003 Max Sum(动态规划)
摘要： Max Sum Problem Description Given a sequence a[1],a[2],a[3]......a[n], your job is to calculate the max sum of a sub-sequence. For example, given (6,- 阅读全文
posted @ 2016-02-24 12:05 ACMSaga 阅读(167) 评论(0) 推荐(0)
2016年2月22日
HDU 1203 I NEED A OFFER!(01背包)
摘要： I NEED A OFFER! Problem Description Speakless很早就想出国，现在他已经考完了所有需要的考试，准备了所有要准备的材料，于是，便需要去申请学校了。要申请国外的任何大学，你都要交纳一定的申请费用，这可是很惊人的。Speakless没有多少钱，总共只攒了n万美元。 阅读全文
posted @ 2016-02-22 16:28 ACMSaga 阅读(316) 评论(0) 推荐(0)
HUD 1171 Big Event in HDU(01背包)
摘要： Big Event in HDU Problem Description Nowadays, we all know that Computer College is the biggest department in HDU. But, maybe you don't know that Comp 阅读全文
posted @ 2016-02-22 15:04 ACMSaga 阅读(288) 评论(0) 推荐(0)
2016年2月20日
HDU 2546 饭卡(01背包)
摘要： 饭卡 Problem Description 电子科大本部食堂的饭卡有一种很诡异的设计，即在购买之前判断余额。如果购买一个商品之前，卡上的剩余金额大于或等于5元，就一定可以购买成功（即使购买后卡上余额为负），否则无法购买（即使金额足够）。所以大家都希望尽量使卡上的余额最少。某天，食堂中有n种菜出售， 阅读全文
posted @ 2016-02-20 15:45 ACMSaga 阅读(378) 评论(0) 推荐(0)
点击右上角即可分享
微信分享提示