2018年09月_landcruiser007

11月 09月 03月 02月 01月

原创 HDU 1094 A+B for input-output practice(6)

problem description Your task is to calculate the sum of some integers. input Input contains multiple test cases, and one case one line. Each case starts with an integer N, and then N integers foll...

2018-09-02 12:02:28 416

原创 HDU 1093 for input-output practice(5)

problem description Your task is to calculate the sum of some integers. input Input contains an integer N in the first line, and then N lines follow. Each line starts with a integer M, and then M i...

2018-09-02 11:56:08 299

原创 HDU 1092 for input-output practice(4)

problem description Your task is to Calculate the sum of some integers. input Input contains multiple test cases. Each test case contains a integer N, and then N integers follow in the same line. A...

2018-09-02 11:53:07 221

原创 HDU 1091 for input-output practice(3)

problem description Your task is to Calculate a + b. input Input contains multiple test cases. Each test case contains a pair of integers a and b, one pair of integers per line. A test case contain...

2018-09-02 11:50:23 201

原创 HDU 1090 for input-output practice(2)

problem description Your task is to Calculate a + b. input Input contains an integer N in the first line, and then N lines follow. Each line consists of a pair of integers a and b, separated by a s...

2018-09-02 11:46:38 152

原创 HDU 1089 for input-output practice(1)

problem description Your task is to Calculate a + b. Too easy?! Of course! I specially designed the problem for acm beginners. You must have found that some problems have the same titles with this...

2018-09-02 11:39:12 154

原创 HDU 1087 super jumping!jumping!jumping!

problem description Nowadays, a kind of chess game called “Super Jumping! Jumping! Jumping!” is very popular in HDU. Maybe you are a good boy, and know little about this game, so I introduce it to yo...

2018-09-02 11:36:33 385

原创 HDU 1064 financial management

problem description Larry 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 ...

2018-09-02 11:17:35 182

原创 HDU 1062 text reverse

problem description Ignatius likes to write words in reverse way. Given a single line of text which is written by Ignatius, you should reverse all the words and then output them. input The input co...

2018-09-02 11:13:41 295

原创 HDU 1060 leftmost digit

解题思路： N^N用科学计数法表示为a*10^x 我们要得到的就是a 以10为底取对数 log10(N^N)=log10(a)+x Nlog10(N)=log10(a)+x log10(a)=Nlog10(N)-x a=10^(Nlog10(N)-x) 而由HDU 1018题（https://blog.csdn.net/landcruiser007/article/details/...

2018-09-02 11:09:34 176

原创 HDU 1052 tian ji--the horse racing

思路：首先比较最慢的马。 1.如果田忌最慢的马比齐王最慢的马还慢：那么让田忌最慢的马去和齐王最快的马比。输一次。 2.如果田忌最慢的马比齐王最慢的马快：那么让两个比，胜一次。 3.如果最慢的马一样快：再比较田忌和齐王最快的马。如果田忌最快的马比齐王最快的马快，就让两个最快的马比。胜一次。如果田忌最快的马比齐王最快的马慢，那么让田忌最慢的马去和齐王最快的马比。输一次。 #includ...

2018-09-01 15:46:51 143

原创 HDU 1022 train problem 1(栈)

problem description As the new term comes, the Ignatius Train Station is very busy nowadays. A lot of student want to get back to school by train(because the trains in the Ignatius Train Station is t...

2018-09-01 15:32:01 187

原创 HDU 1018 big number(求n!的位数)

problem description In many applications very large integers numbers are required. Some of these applications are using keys for secure transmission of data, encryption, etc. In this problem you are ...

2018-09-01 15:16:11 178

原创 HDU 1010 tempter of the bone(DFS)

problem description The doggie found a bone in an ancient maze, which fascinated him a lot. However, when he picked it up, the maze began to shake, and the doggie could feel the ground sinking. He re...

2018-09-01 15:07:46 135

原创 HDU 1009 fatmouse' trade(贪心)

problem description FatMouse prepared M pounds of cat food, ready to trade with the cats guarding the warehouse containing his favorite food, JavaBean. The warehouse has N rooms. The i-th room conta...

2018-09-01 15:00:11 198

原创 HDU 1005 number sequence(重点题)

problem description A 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 of f(n). input The i...

2018-09-01 14:51:16 234

原创 HDU 1004 let the balloon rise

problem description contest time again! how excited it is to see balloons floating around. but to tell you a secret, the judges’ favourite time is suessing the most popular problem. when the contest ...

2018-09-01 14:10:16 116

原创 HDU 1003 max sum

problem description given a sequence a[1],a[2],a[3]……a[n], your job is to calculate the max sum of a sub-sequence. for example, given(6,-1,5,4,-7),the max sum in this sequence is 6+(-1)+5+4=14 input...

2018-09-01 13:49:25 138

原创 HDU 1001 sum problem

problem description hey, welcome to HDOJ. in this problem, your task is to calculate SUM(n)=1+2+3+…+n. input the input will consist of a series of integers n, one integer per line. output for e...

2018-09-01 13:19:34 177

原创 HDU 1000 A+B problem

problem description calculate A+B input each line will contain two integers A and B. process to end of lfile output for each case , output A+B in one line sample input 1 1 sample outpu...

2018-09-01 13:14:29 192