HDU
文章平均质量分 60
wyj_2016
这个作者很懒,什么都没留下…
展开
-
HDU1201
18岁生日Problem DescriptionGardon的18岁生日就要到了,他当然很开心,可是他突然想到一个问题,是不是每个人从出生开始,到达18岁生日时所经过的天数都是一样的呢?似乎并不全都是这样,所以他想请你帮忙计算一下他和他的几个朋友从出生到达18岁生日所经过的总天数,让他好来比较一下。 Input一个数T,后面T行每行有一个日期,格式是YYYY原创 2017-09-22 09:50:26 · 303 阅读 · 0 评论 -
HDU1095
A+B for Input-Output Practice (VII)Problem DescriptionYour task is to Calculate a + b. InputThe input will consist of a series of pairs of integers a and b, separated by a space, o原创 2017-09-21 09:55:32 · 275 阅读 · 0 评论 -
HDU1094
A+B for Input-Output Practice (VI)Problem DescriptionYour task is to calculate the sum of some integers. InputInput contains multiple test cases, and one case one line. Each case s原创 2017-09-21 09:54:21 · 508 阅读 · 0 评论 -
HDU1093
A+B for Input-Output Practice (V)Problem DescriptionYour task is to calculate the sum of some integers. InputInput contains an integer N in the first line, and then N lines follow.原创 2017-09-21 09:52:59 · 353 阅读 · 0 评论 -
HDU1092
A+B for Input-Output Practice (IV)Problem DescriptionYour task is to Calculate the sum of some integers. InputInput contains multiple test cases. Each test case contains a integer N,原创 2017-09-21 09:51:28 · 649 阅读 · 0 评论 -
HDU1091
A+B for Input-Output Practice (III)Problem DescriptionYour task is to Calculate a + b. InputInput contains multiple test cases. Each test case contains a pair of integers a and b, on原创 2017-09-21 09:50:08 · 314 阅读 · 0 评论 -
HDU1090
A+B for Input-Output Practice (II)Problem DescriptionYour task is to Calculate a + b. InputInput contains an integer N in the first line, and then N lines follow. Each line consists原创 2017-09-21 09:48:22 · 248 阅读 · 0 评论 -
HDU1089
A+B for Input-Output Practice (I)Problem DescriptionYour task is to Calculate a + b.Too easy?! Of course! I specially designed the problem for acm beginners. You must have found that som原创 2017-09-21 09:45:18 · 500 阅读 · 0 评论 -
HDU1076
An Easy TaskProblem DescriptionIgnatius was born in a leap year, so he want to know when he could hold his birthday party. Can you tell him?Given a positive integers Y which indicate the s原创 2017-09-16 13:32:28 · 178 阅读 · 0 评论 -
HDU1096
A+B for Input-Output Practice (VIII)Problem DescriptionYour task is to calculate the sum of some integers. InputInput contains an integer N in the first line, and then N lines foll原创 2017-09-21 09:56:46 · 282 阅读 · 0 评论 -
HDU1097
A hard puzzleProblem Descriptionlcy gives a hard puzzle to feng5166,lwg,JGShining and Ignatius: gave a and b,how to know the a^b.everybody objects to this BT problem,so lcy makes the problem原创 2017-09-21 09:57:44 · 204 阅读 · 0 评论 -
HDU1098
Ignatius's puzzleProblem DescriptionIgnatius is poor at math,he falls across a puzzle problem,so he has no choice but to appeal to Eddy. this problem describes that:f(x)=5*x^13+13*x^5+k*a*x,in原创 2017-09-21 09:59:25 · 365 阅读 · 0 评论 -
HDU1197
Specialized Four-Digit NumbersProblem DescriptionFind and list all four-digit numbers in decimal notation that have the property that the sum of its four digits equals the sum of its digits原创 2017-09-22 09:49:51 · 278 阅读 · 0 评论 -
HDU1196
Lowest BitTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 12623 Accepted Submission(s): 9203Problem DescriptionGiven an positive原创 2017-09-22 09:47:53 · 241 阅读 · 0 评论 -
HDU1194
Beat the Spread!Problem DescriptionSuperbowl Sunday is nearly here. In order to pass the time waiting for the half-time commercials and wardrobe malfunctions, the local hackers have organize原创 2017-09-22 09:47:03 · 275 阅读 · 0 评论 -
HDU1170
Balloon Comes!Problem DescriptionThe contest starts now! How excited it is to see balloons floating around. You, one of the best programmers in HDU, can get a very beautiful balloon if only原创 2017-09-22 09:46:03 · 231 阅读 · 0 评论 -
HDU1164
Eddy's research IProblem DescriptionEddy's interest is very extensive, recently he is interested in prime number. Eddy discover the all number owned can be divided into the multiply of prime原创 2017-09-22 09:44:43 · 252 阅读 · 0 评论 -
HDU1163
Eddy's digital RootsProblem DescriptionThe digital root of a positive integer is found by summing the digits of the integer. If the resulting value is a single digit then that digit is the d原创 2017-09-22 09:43:17 · 226 阅读 · 0 评论 -
HDU1157
Who's in the MiddleProblem DescriptionFJ is surveying his herd to find the most average cow. He wants to know how much milk this 'median' cow gives: half of the cows give as much or more tha原创 2017-09-22 09:42:03 · 326 阅读 · 0 评论 -
HDU1108
最小公倍数Problem Description给定两个正整数,计算这两个数的最小公倍数。 Input输入包含多组测试数据,每组只有一行,包括两个不大于1000的正整数. Output对于每个测试用例,给出这两个数的最小公倍数,每个实例输出一行。 Sample Input10 14 Sample Outpu原创 2017-09-22 09:40:28 · 340 阅读 · 0 评论 -
HDU1070
MilkProblem 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 supermarket, so Ignatius wants原创 2017-09-16 13:30:52 · 250 阅读 · 0 评论 -
HDU1205
吃糖果Problem DescriptionHOHO,终于从Speakless手上赢走了所有的糖果,是Gardon吃糖果时有个特殊的癖好,就是不喜欢将一样的糖果放在一起吃,喜欢先吃一种,下一次吃另一种,这样;可是Gardon不知道是否存在一种吃糖果的顺序使得他能把所有糖果都吃完?请你写个程序帮忙计算一下。 Input第一行有一个整数T,接下来T组数据,每组数原创 2017-09-22 09:53:05 · 419 阅读 · 0 评论 -
HDU1017
A Mathematical CuriosityProblem DescriptionGiven two integers n and m, count the number of pairs of integers (a,b) such that 0 This problem contains multiple test cases!The first line原创 2017-09-16 10:32:17 · 277 阅读 · 0 评论 -
HDU1014
Uniform GeneratorProblem DescriptionComputer simulations often require random numbers. One way to generate pseudo-random numbers is via a function of the formseed(x+1) = [seed(x) + STEP] %原创 2017-09-16 10:30:59 · 188 阅读 · 0 评论 -
HDU1013
Digital RootsProblem DescriptionThe digital root of a positive integer is found by summing the digits of the integer. If the resulting value is a single digit then that digit is the digital ro原创 2017-09-16 10:29:15 · 226 阅读 · 0 评论 -
HDU1012
u Calculate eProblem DescriptionA simple mathematical formula for e iswhere n is allowed to go to infinity. This can actually yield very accurate approximations of e using rela原创 2017-09-16 10:27:22 · 224 阅读 · 0 评论 -
HDU1008
ElevatorProblem DescriptionThe highest building in our city has only one elevator. A request list is made up with N positive numbers. The numbers denote at which floors the elevator will stop,原创 2017-09-16 10:25:30 · 170 阅读 · 0 评论 -
HDU1005
Number SequenceProblem DescriptionA number sequence is defined as follows:f(1) = 1, f(2) = 1, f(n) = (A * f(n - 1) + B * f(n - 2)) mod 7.Given A, B, and n, you are to calculate the value原创 2017-09-16 10:24:18 · 163 阅读 · 0 评论 -
HDU1004
Let the Balloon RiseProblem DescriptionContest time again! How excited it is to see balloons floating around. But to tell you a secret, the judges' favorite time is guessing the most popular p原创 2017-09-16 10:22:47 · 217 阅读 · 0 评论 -
HDU1001
Sum ProblemProblem DescriptionHey, welcome to HDOJ(Hangzhou Dianzi University Online Judge).In this problem, your task is to calculate SUM(n) = 1 + 2 + 3 + ... + n. InputThe input原创 2017-09-16 10:21:02 · 1037 阅读 · 0 评论 -
HDU1019
Least Common MultipleProblem DescriptionThe least common multiple (LCM) of a set of positive integers is the smallest positive integer which is divisible by all the numbers in the set. For exa原创 2017-09-16 10:33:36 · 195 阅读 · 0 评论 -
HDU1021
Fibonacci AgainProblem DescriptionThere are another kind of Fibonacci numbers: F(0) = 7, F(1) = 11, F(n) = F(n-1) + F(n-2) (n>=2). InputInput consists of a sequence of lines, each co原创 2017-09-16 10:34:14 · 159 阅读 · 0 评论 -
HDU1028
Ignatius and the Princess IIIProblem Description"Well, it seems the first problem is too easy. I will let you know how foolish you are later." feng5166 says."The second problem is, given原创 2017-09-16 13:15:45 · 175 阅读 · 0 评论 -
HDU1061
Rightmost DigitProblem DescriptionGiven a positive integer N, you should output the most right digit of N^N. InputThe input contains several test cases. The first line of the input原创 2017-09-16 13:28:00 · 278 阅读 · 0 评论 -
HDU1058
Humble NumbersProblem DescriptionA number whose only prime factors are 2,3,5 or 7 is called a humble number. The sequence 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 12, 14, 15, 16, 18, 20, 21, 24, 25, 2原创 2017-09-16 13:26:48 · 226 阅读 · 0 评论 -
HDU1056
HangOverProblem 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 car原创 2017-09-16 13:25:38 · 180 阅读 · 0 评论 -
HDU1048
The Hardest Problem EverProblem DescriptionJulius Caesar lived in a time of danger and intrigue. The hardest situation Caesar ever faced was keeping himself alive. In order for him to surviv原创 2017-09-16 13:24:22 · 215 阅读 · 0 评论 -
HDU1040
As Easy As A+BProblem 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 man原创 2017-09-16 13:23:04 · 378 阅读 · 0 评论 -
HDU1037
Keep on Truckin'Problem DescriptionBoudreaux and Thibodeaux are on the road again . . ."Boudreaux, we have to get this shipment of mudbugs to Baton Rouge by tonight!""Don't worry, Th原创 2017-09-16 13:21:47 · 147 阅读 · 0 评论 -
HDU1032
The 3n + 1 problemProblem DescriptionProblems in Computer Science are often classified as belonging to a certain class of problems (e.g., NP, Unsolvable, Recursive). In this problem you will原创 2017-09-16 13:18:13 · 168 阅读 · 0 评论