沧浪之水

problem descriptioncalculate A+Binputeach line will contain two integers A and B. process to end of lfileoutputfor each case , output A+B in one linesample input1 1sample outpu...

problem descriptionIgnatius 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.inputThe input co...

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

problem descriptionNowadays, 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...

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 some problems have the same titles with this...

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 of a pair of integers a and b, separated by a s...

problem descriptionYour task is to Calculate a + b.inputInput 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...

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

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. Each line starts with a integer M, and then M i...

解题思路： 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.youkuaiyun.com/landcruiser007/article/details/...

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

problem descriptionhey, 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.outputfor e...

problem descriptiongiven 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=14input...

problem descriptioncontest 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 ...

problem 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 of f(n).inputThe i...

problem descriptionFatMouse 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...

problem descriptionThe 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...

problem descriptionIn 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 ...

problem descriptionAs 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...

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