随笔分类 - hdu
摘要：B -As Easy As A+BTime Limit:1000MSMemory Limit:32768KB64bit IO Format:%I64d & %I64uSubmitStatusAppoint description:DescriptionThese days, I am thinking about a question, how can I get a problem as easy as A+B? It is fairly difficulty to do such a thing. Of course, I got it after many waking nigh
阅读全文
摘要：RobberiesTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 3934Accepted Submission(s): 1492Problem DescriptionThe aspiring Roy the Robber has seen a lot of American movies, and knows that the bad guys usually gets caught in the end, often because the
阅读全文
摘要：Climbing WormTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 7713Accepted Submission(s): 4935Problem DescriptionAn inch worm is at the bottom of a well n inches deep. It has enough energy to climb u inches every minute, but then has to rest a minut
阅读全文
摘要：MilkTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 7951Accepted Submission(s): 1893Problem DescriptionIgnatius drinks milk everyday, now he is in the supermarket and he wants to choose a bottle of milk. There are many kinds of milk in the supermar
阅读全文
摘要：变形课Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 131072/65536 K (Java/Others)Total Submission(s): 6113Accepted Submission(s): 2223Problem Description呃......变形课上Harry碰到了一点小麻烦,因为他并不像Hermione那样能够记住所有的咒语而随意的将一个棒球变成刺猬什么的,但是他发现了变形咒语的一个统一规律:如果咒语是以a开头b结尾的一个单词,那么它的作用就恰好是使A物体变成B物体. Harry已经将他所会的所有咒语都列成了一
阅读全文
摘要：确定比赛名次Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 5289Accepted Submission(s): 1968Problem Description有N个比赛队（1<=N<=500），编号依次为1，2，3，。。。。，N进行比赛，比赛结束后，裁判委员会要将所有参赛队伍从前往后依次排名，但现在裁判委员会不能直接获得每个队的比赛成绩，只知道每场比赛的结果，即P1赢P2，用P1，P2表示，排名时P1在P2之前。现在请你编程序确
阅读全文
摘要：Eddy's mistakesTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 4754Accepted Submission(s): 2697Problem DescriptionEddy usually writes articles ,but he likes mixing the English letter uses, for example "computer science" is written fre
阅读全文
摘要：Rightmost DigitTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 18122Accepted Submission(s): 6946Problem DescriptionGiven a positive integer N, you should output the most right digit of N^N.InputThe input contains several test cases. The first line
阅读全文
摘要：Eddy's research ITime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 3554Accepted Submission(s): 2182Problem DescriptionEddy's interest is very extensive, recently he is interested in prime number. Eddy discover the all number owned can be divi
阅读全文
摘要：Eddy's digital RootsTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 2355Accepted Submission(s): 1348Problem DescriptionThe digital root of a positive integer is found by summing the digits of the integer. If the resulting value is a single digi
阅读全文
摘要：Who's in the MiddleTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 4628Accepted Submission(s): 2347Problem DescriptionFJ is surveying his herd to find the most average cow. He wants to know how much milk this 'median' cow gives: half of
阅读全文
摘要：整除的尾数Time Limit: 1000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 13580Accepted Submission(s): 5665Problem Description一个整数，只知道前几位，不知道末二位，被另一个整数除尽了，那么该数的末二位该是什么呢？Input输入数据有若干组，每组数据包含二个整数a，b（0<a<10000, 10<b<100），若遇到0 0则处理结束。Output对应每组数据，将满足条件的所有尾数在一行内
阅读全文
摘要：AC MeTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 7077Accepted Submission(s): 3165Problem DescriptionIgnatius is doing his homework now. The teacher gives him some articles and asks him to tell how many times each letter appears.It's really
阅读全文
摘要：A Simple TaskTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 2422Accepted Submission(s): 1354Problem DescriptionGiven a positive integer n and the odd integer o and the nonnegative integer p such that n = o2^p.ExampleFor n = 24, o = 3 and p = 3.Tas
阅读全文
摘要：DoublesTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 2176Accepted Submission(s): 1509Problem DescriptionAs part of an arithmetic competency program, your students will be given randomly generated lists of from 2 to 15 unique positive integers and
阅读全文
摘要：The SnailTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 726Accepted Submission(s): 544Problem DescriptionA snail is at the bottom of a 6-foot well and wants to climb to the top. The snail can climb 3 feet while the sun is up, but slides down 1 foo
阅读全文
摘要：A + B Problem TooTime Limit: 3000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 7145Accepted Submission(s): 5393Problem DescriptionThis problem is also a A + B problem,but it has a little difference,you should determine does (a+b) could be divided with 86.For ex.
阅读全文
摘要：最简单的计算机Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 2666Accepted Submission(s): 1532Problem Description一个名叫是PigHeadThree的研究组织设计了一台实验用的计算机，命名为PpMm。PpMm只能执行简单的六种命令A，B，C，D，E，F；只有二个内存M1，M2；三个寄存器R1，R2，R3。六种命令的含义如下：命令A：将内存M1的数据装到寄存器R1中；命令B：将内存M2的数据装到寄
阅读全文
摘要：Reverse NumberTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 2924Accepted Submission(s): 1348Problem DescriptionWelcome to 2006'4 computer college programming contest!Specially, I give my best regards to all freshmen! You are the future of HDU
阅读全文
摘要：1 // Project name : 1235 ( 统计同成绩学生人数 ) 2 // File name : main.cpp 3 // Author : Izumu 4 // Date & Time : Thu Jul 5 17:20:47 2012 5 6 7 #include <iostream> 8 #include <stdio.h> 9 using namespace std;10 11 int main()12 {13 int n;14 while (scanf("%d", &n) != EOF &&
阅读全文
浙公网安备 33010602011771号