上一页 1 ··· 6 7 8 9 10 11 12 下一页
2012年8月31日
acm steps chapter3总结
摘要： 3.1.1一只小蜜蜂...49.56%(279,563)3.1.2骨牌铺方格68.65%(265,386)3.1.3母牛的故事68.35%(270,395)3.1.4Tiling_easy version87.63%(262,299)3.1.5统计问题66.18%(270,408)3.1.6不容易系列之(3)—— LELE的RPG难题53.12%(264,497)3.1.7Children’s Queue56.30%(295,524)3.1.8Queuing45.65%(278,609)3.1 基础的DP题，状态和状态转移方程都较好表示3.2.1Common Subsequence56.25% 阅读全文
posted @ 2012-08-31 01:36 YogyKwan 阅读(148) 评论(0) 推荐(0) 编辑
hdu Queuing
摘要： QueuingTime Limit: 10000/5000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 608 Accepted Submission(s): 278Problem DescriptionQueues and Priority Queues are data structures which are known to most computer scientists. The Queue occurs often in our daily life. There . 阅读全文
posted @ 2012-08-31 01:24 YogyKwan 阅读(704) 评论(0) 推荐(0) 编辑
2012年8月30日
hdu Game of Connections
摘要： Game of ConnectionsTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 401 Accepted Submission(s): 265Problem Description This is a small but ancient game. You are supposed to write down the numbers 1, 2, 3, ... , 2n - 1, 2n consecutively in clockwis. 阅读全文
posted @ 2012-08-30 22:29 YogyKwan 阅读(288) 评论(0) 推荐(0) 编辑
hdu Buy the Ticket
摘要： Buy the TicketTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 785 Accepted Submission(s): 382Problem Description The \\\\\\\"Harry Potter and the Goblet of Fire\\\\\\\" will be on show in the next few days. As a crazy fan of Harry Potter 阅读全文
posted @ 2012-08-30 22:20 YogyKwan 阅读(261) 评论(1) 推荐(0) 编辑
hdu Hat's Fibonacci
摘要： Hat's FibonacciTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 789 Accepted Submission(s): 343Problem DescriptionA Fibonacci sequence is calculated by adding the previous two members the sequence, with the first two members being both 1. F(1) 阅读全文
posted @ 2012-08-30 21:44 YogyKwan 阅读(238) 评论(0) 推荐(0) 编辑
hdu Big Number
摘要： Big NumberTime Limit: 20000/10000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 480 Accepted Submission(s): 330Problem DescriptionIn many applications very large integers numbers are required. Some of these applications are using keys for secure transmission of data. 阅读全文
posted @ 2012-08-30 21:31 YogyKwan 阅读(147) 评论(0) 推荐(0) 编辑
hdu Examining the Rooms
摘要： Examining the RoomsTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 365 Accepted Submission(s): 218Problem DescriptionA murder happened in the hotel. As the best detective in the town, you should examine all the N rooms of the hotel immediately. H. 阅读全文
posted @ 2012-08-30 21:21 YogyKwan 阅读(260) 评论(0) 推荐(0) 编辑
hdu Fibonacci
摘要： FibonacciTime Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1525 Accepted Submission(s): 741Problem Description2007年到来了。经过2006年一年的修炼，数学神童zouyu终于把0到100000000的Fibonacci数列 (f[0]=0,f[1]=1;f[i] = f[i-1]+f[i-2](i>=2))的值全部给背了下来。 接下来，CodeStar决定要考考他，于是每问他一 阅读全文
posted @ 2012-08-30 17:40 YogyKwan 阅读(283) 评论(0) 推荐(0) 编辑
Windows下安装和配置netbeans以使用C/C++全过程
摘要： 第一部分：安装1、官网下载JDKhttp://www.oracle.com/technetwork/java/javase/downloads/jdk7-downloads-1637583.htmlWindows x8688.33 MB jdk-7u6-windows-i586.exeWindows x6490 MB jdk-7u6-windows-x64.exewindows系统选择上图中的一种：32位选择前者，64位选择后者。2、官网下载netbeanshttp://netbeans.org/downloads/start.html?platform=windows&lang=zh 阅读全文
posted @ 2012-08-30 16:53 YogyKwan 阅读(1114) 评论(0) 推荐(0) 编辑
如何从U盘引导安装win7/xp
摘要： 菜鸟装机攻略（成功率较软碟通高）。安装准备： 1、一个4G或以上的U盘 2、电脑店U盘启动盘制作工具 3、win7/xp的iso镜像文件PS：1、U盘制作成为启动盘后，原有内含文件会全部丢失，请提前备份。 2、U盘制作工具下载地址： http://u.diannaodian.com/ 3、推荐LDPY制作的iso系统下载地址： http://www.ldpy.cc/（如有其他镜像亦可使用，但建议下载安装版而非ghost版，装机时间虽然更长但使用效果更稳定）接下来开始正式安装：1、插入U盘，解压下载的U盘启动工具压缩文件，找到exe文件，双击打开，点击＂一键制作启动U盘＂（制作启动U盘一次即可， 阅读全文
posted @ 2012-08-30 16:32 YogyKwan 阅读(1406) 评论(1) 推荐(0) 编辑
上一页 1 ··· 6 7 8 9 10 11 12 下一页