上一页 1 ··· 5 6 7 8 9 10 11 下一页

2010年11月1日

摘要: 背景 Background  小Q玩开采金钱游戏因为赚了太多钱,而这些钱又没有用,所以他相当愤怒,投诉了出品游戏者。所以游戏出品者就推出了《购买气球》这一款游戏,这一游戏是可以使用经营餐厅游戏获得的钱的。描述 Description   小Q在经营餐厅中赚下了Money元,这些钱可以用来从商店买红色或者蓝色的气球,打破一个红色气球可以让分数score变为原来的red倍,打破一个蓝色的气球可以让分数... 阅读全文
posted @ 2010-11-01 20:33 I WILL BE BETTER. 阅读(321) 评论(0) 推荐(0) 编辑
 
摘要: 1.油滴扩展(box)搜索,注意精度。2.数列(sequence)f[i,j]=max{f[i-1,j-1],f[i-1,j]+(a[i]=i-j)}3.SOFTWARE二分答案,判断条件f[i,j+k]=max{f[i-1,j]+(mid-k*a[i])/b[i]} (k+j<=m&&mid>=a[i]*k)4.黑匣子(blackbox)二分查找树代码 阅读全文
posted @ 2010-11-01 14:54 I WILL BE BETTER. 阅读(401) 评论(0) 推荐(0) 编辑
 
摘要: p1 背包 tyvj1329代码p2 数学 tyvj1330p3 dfs tyvj1331 阅读全文
posted @ 2010-11-01 07:49 I WILL BE BETTER. 阅读(394) 评论(0) 推荐(0) 编辑

2010年10月31日

摘要: DescriptionDuring his last sabbatical, professor M. A. Ya made a surprising discovery about the old Maya calendar. From an old knotted message, professor discovered that the Maya civilization used a 3... 阅读全文
posted @ 2010-10-31 15:41 I WILL BE BETTER. 阅读(588) 评论(0) 推荐(0) 编辑

2010年10月29日

摘要: DescriptionOne measure of ``unsortedness'' in a sequence is the number of pairs of entries that are out of order with respect to each other. For instance, in the letter sequence ``DAABEC'', this measu... 阅读全文
posted @ 2010-10-29 17:50 I WILL BE BETTER. 阅读(776) 评论(1) 推荐(0) 编辑
 
摘要: DescriptionSome people believe that there are three cycles in a person's life that start the day he or she is born. These three cycles are the physical, emotional, and intellectual cycles, and they ha... 阅读全文
posted @ 2010-10-29 17:48 I WILL BE BETTER. 阅读(823) 评论(0) 推荐(0) 编辑
 
摘要: DescriptionFred Mapper is considering purchasing some land in Louisiana to build his house on. In the process of investigating the land, he learned that the state of Louisiana is actually shrinking by... 阅读全文
posted @ 2010-10-29 17:47 I WILL BE BETTER. 阅读(338) 评论(0) 推荐(0) 编辑
 
摘要: DescriptionLarry graduated this year and finally has a job. He's making a lot of money, but somehow never seems to have enough. Larry has decided that he needs to grab hold of his financial portfolio ... 阅读全文
posted @ 2010-10-29 17:46 I WILL BE BETTER. 阅读(297) 评论(0) 推荐(0) 编辑
 
摘要: DescriptionHow far can you make a stack of cards overhang a table? If you have one card, you can create a maximum overhang of half a card length. (We're assuming that the cards must be perpendicular t... 阅读全文
posted @ 2010-10-29 17:44 I WILL BE BETTER. 阅读(195) 评论(0) 推荐(0) 编辑
 
摘要: 我刚刚有将poj从开头做的想法,于是,开始了。poj1000 A+B Problem 不用说了poj1001Exponentiation 求高精度幂 将数字不断乘以10直到为整数为止,快速幂算法,最后加小数点,注意处理底数或指 数是零的情况。poj1002487-3279 将无关字符删去,使用字母树存储,都是7层,输出的时候从0开始递归输出即可。poj1003Hangover 数学题 迭代相加。p... 阅读全文
posted @ 2010-10-29 17:42 I WILL BE BETTER. 阅读(172) 评论(0) 推荐(0) 编辑
上一页 1 ··· 5 6 7 8 9 10 11 下一页