2011年8月16日

An easy problem

摘要： An easy problemTime Limit: 5000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2563Accepted Submission(s): 1806Problem DescriptionIn this problem you need to make a multiply table of N * N ,just like the sample out. The element in the ith row and jth column should 阅读全文

posted @ 2011-08-16 22:59 more think, more gains 阅读(174) 评论(0) 推荐(0) 编辑

Calculate S(n) hdu 2114

摘要： Calculate S(n)Time Limit: 10000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 3451Accepted Submission(s): 1335Problem DescriptionCalculate S(n).S(n)=13+23 +33 +......+n3 .InputEach line will contain one integer N(1 < n < 1000000000). Process to end of file. 阅读全文

posted @ 2011-08-16 21:54 more think, more gains 阅读(259) 评论(0) 推荐(0) 编辑

hide handkerchief hdu 2104

摘要： hide handkerchiefTime Limit: 10000/3000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1107Accepted Submission(s): 530Problem DescriptionThe Children’s Day has passed for some days .Has you remembered something happened at your childhood? I remembered I often played a 阅读全文

posted @ 2011-08-16 21:19 more think, more gains 阅读(340) 评论(0) 推荐(0) 编辑

Secret Number hdu 2113

摘要： Secret NumberTime Limit: 3000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 4174Accepted Submission(s): 1719Problem Description有一天, KIKI 收到一张奇怪的信, 信上要KIKI 计算出给定数各个位上数字为偶数的和.eg. 5548结果为12 , 等于 4 + 8KIKI 很苦恼. 想请你帮忙解决这个问题.Input输入数据有多组,每组占一行,只有一个数字,保证数字在INT范围内.Output 阅读全文

posted @ 2011-08-16 20:26 more think, more gains 阅读(188) 评论(0) 推荐(0) 编辑

Saving HDU hdu 2111

摘要： Saving HDUTime Limit: 3000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2171Accepted Submission(s): 977Problem Description话说上回讲到海东集团面临内外交困，公司的元老也只剩下XHD夫妇二人了。显然，作为多年拼搏的商人，XHD不会坐以待毙的。一天，当他正在苦思冥想解困良策的时候，突然想到了自己的传家宝，那是公司成立的时候，父亲作为贺礼送来的一个锦囊，徐父当时交代，不到万不得已的时候，不要打开它。“现在 阅读全文

posted @ 2011-08-16 20:17 more think, more gains 阅读(229) 评论(0) 推荐(0) 编辑

Fighting for HDU

摘要： Fighting for HDUTime Limit: 3000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 3100Accepted Submission(s): 1577Problem Description在上一回，我们让你猜测海东集团用地的形状，你猜对了吗？不管结果如何，都没关系，下面我继续向大家讲解海东集团的发展情况：在最初的两年里，HDU发展非常迅速，综合各种ACM算法生成的老鼠药效果奇好，据说该药专对老鼠有效，如果被人误食了，没有任何副作用，甚至有传闻说还有健 阅读全文

posted @ 2011-08-16 18:47 more think, more gains 阅读(371) 评论(0) 推荐(0) 编辑

Founding of HDU

摘要： Founding of HDUTime Limit: 3000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 3355Accepted Submission(s): 2218Problem Description经过慎重的考虑，XHD,8600, LL，Linle以及RPG等ACM队员集体退役，甚至正在酝酿退学。为什么？要考研？那也不用退学呀…当然不是！真正的原因是他们想提前创业，想合伙成立一家公司，据说公司的名称都想好了，为了感谢多年的ACM集训队队长XHD，公司就叫海东集 阅读全文

posted @ 2011-08-16 18:03 more think, more gains 阅读(155) 评论(0) 推荐(0) 编辑

The Center of Gravity

摘要： 编辑器加载中...The Center of GravityTime Limit: 3000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2423Accepted Submission(s): 1324Problem DescriptionEveryone know the story that how Newton discovered the Universal Gravitation. One day, Newton walked leisurely, suddenl 阅读全文

posted @ 2011-08-16 17:56 more think, more gains 阅读(230) 评论(0) 推荐(0) 编辑

hdu 2106 decimal system

摘要： decimal systemTime Limit: 3000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1575Accepted Submission(s): 892Problem DescriptionAs we know , we always use the decimal system in our common life, even using the computer. If we want to calculate the value that 3 plus 阅读全文

posted @ 2011-08-16 17:54 more think, more gains 阅读(808) 评论(0) 推荐(0) 编辑

Box of Bricks

摘要： Box of BricksTime Limit: 1000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 4334Accepted Submission(s): 1547Problem DescriptionLittle Bob likes playing with his box of bricks. He puts the bricks one upon another and builds stacks of different height. “Look, I' 阅读全文

posted @ 2011-08-16 11:07 more think, more gains 阅读(172) 评论(0) 推荐(0) 编辑

空心三角形 hdu 2091

摘要： 空心三角形Time Limit: 1000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 10699Accepted Submission(s): 3040Problem Description把一个字符三角形掏空，就能节省材料成本，减轻重量，但关键是为了追求另一种视觉效果。在设计的过程中，需要给出各种花纹的材料和大小尺寸的三角形样板，通过电脑临时做出来，以便看看效果。Input每行包含一个字符和一个整数n(0<n<41)，不同的字符表示不同的花纹，整数n表示等腰 阅读全文

posted @ 2011-08-16 10:39 more think, more gains 阅读(373) 评论(0) 推荐(0) 编辑

Sky数 hdu 2097

摘要： Sky数Time Limit: 1000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 5510Accepted Submission(s): 3268Problem DescriptionSky从小喜欢奇特的东西，而且天生对数字特别敏感，一次偶然的机会，他发现了一个有趣的四位数2992，这个数，它的十进制数表示，其四位数字之和为2+9+9+2=22，它的十六进制数BB0，其四位数字之和也为22，同时它的十二进制数表示1894，其四位数字之和也为22，啊哈，真是巧啊。Sky非 阅读全文

posted @ 2011-08-16 10:17 more think, more gains 阅读(1070) 评论(0) 推荐(0) 编辑

整除的尾数 hdu 2099

摘要： 整除的尾数Time Limit: 1000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 10173Accepted Submission(s): 4253Problem Description一个整数，只知道前几位，不知道末二位，被另一个整数除尽了，那么该数的末二位该是什么呢？Input输入数据有若干组，每组数据包含二个整数a，b（0<a<10000, 10<b<100），若遇到0 0则处理结束。Output对应每组数据，将满足条件的所有尾数在一行内 阅读全文

posted @ 2011-08-16 10:05 more think, more gains 阅读(329) 评论(0) 推荐(0) 编辑

导航