2015年08月_Mr丶Gao

原创 HDU 1060.Leftmost Digit【重点在分析】【格式【晕】】【8月31】【记录】

Leftmost DigitProblem DescriptionGiven a positive integer N, you should output the leftmost digit of N^N. InputThe input contains several test cases. The first line of the in

2015-08-31 19:56:14 669

原创 HDU 1062.Text Reverse【栈或数组或字符串流】【字符处理】【8月30】

Text ReverseProblem 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.

2015-08-30 14:32:58 699

原创 HDU 1061.Rightmost Digit【数论及方法】【8月30】

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

2015-08-30 13:21:13 620

原创 HDU 1058.Humble Numbers【这个题怎么定位呢···就【DP】吧】【8月28】

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

2015-08-28 19:40:43 529

原创 HDU 1056.HangOver【水！水！水！】【8月28】

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

2015-08-28 17:56:05 585

原创 HDU 1052.Tian Ji -- The Horse Racing【很好的贪心】【8月27】

Tian Ji -- The Horse RacingProblem DescriptionHere is a famous story in Chinese history."That was about 2300 years ago. General Tian Ji was a high official in the country Qi. He likes to

2015-08-27 12:51:22 784

原创 HDU 1051.Wooden Sticks【贪心】【8月26】

Wooden SticksProblem DescriptionThere is a pile of n wooden sticks. The length and weight of each stick are known in advance. The sticks are to be processed by a woodworking machine in one b

2015-08-26 13:33:26 799

原创 HDU 1050.Moving Tables【细节与方法选取】【8月26】

Moving TablesProblem DescriptionThe famous ACM (Advanced Computer Maker) Company has rented a floor of a building whose shape is in the following figure. The floor has 200 rooms ea

2015-08-26 13:09:41 588

原创 HDU 1049.Climbing Worm【水！水！水！】【8月25】

Climbing WormProblem 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 minute before climbing agai

2015-08-25 20:02:32 835

原创 HDU 1048.The Hardest Problem Ever【字符串处理】【8月25】

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

2015-08-25 19:32:38 619

原创 HDU 1047.Integer Inquiry【多个大数相加】【高精度】【8月25】

Integer InquiryProblem DescriptionOne of the first users of BIT's new supercomputer was Chip Diller. He extended his exploration of powers of 3 to go from 0 to 333 and he explored taking var

2015-08-25 19:09:26 698

原创 HDU 1046.Gridland【非搜索，找规律】【8月25】

GridlandProblem DescriptionFor years, computer scientists have been trying to find efficient solutions to different computing problems. For some of them efficient algorithms are already avai

2015-08-25 17:29:43 783

原创 HDU 1042.N!【高精度乘法】【8月24】

N!Problem DescriptionGiven an integer N(0 ≤ N ≤ 10000), your task is to calculate N! InputOne N in one line, process to the end of file. OutputFor each N, out

2015-08-24 12:44:17 671

原创 HDU 1040.As Easy As A+B【排序】【如题（水！水！水！）】【8月24】

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

2015-08-24 11:34:59 609

原创 HDU 1039.Easier Done Than Said?【字符串处理】【8月24】

Easier Done Than Said?Problem DescriptionPassword security is a tricky thing. Users prefer simple passwords that are easy to remember (like buddy), but such passwords are often insecure. Som

2015-08-24 11:26:58 712

原创 HDU 1038.Biker's Trip Odometer【单位换算】【水水水】【8月24】

Biker's Trip OdometerProblem DescriptionMost bicycle speedometers work by using a Hall Effect sensor fastened to the front fork of the bicycle. A magnet is attached to one of the spokes on t

2015-08-24 11:00:51 632

原创 HDU 1037.Keep on Truckin'【水水水（重要事情说三遍）】【8月23】【记录】

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

2015-08-23 17:06:36 749

原创 HDU 1036.Average is not Fast Enough!【精度及格式控制】【8月23】

Average is not Fast Enough!Problem DescriptionA relay is a race for two or more teams of runners. Each member of a team runs one section of the race. Your task is to help to evaluate the res

2015-08-23 16:49:02 922

原创 HDU 1035.Robot Motion【还是模拟】【8月22】

Robot MotionProblem DescriptionA robot has been programmed to follow the instructions in its path. Instructions for the next direction the robot is to move are laid down in a grid. The p

2015-08-22 21:32:56 1001

原创 HDU 1034.Candy Sharing Game【又是模拟】【8月22】

Candy Sharing GameProblem DescriptionA number of students sit in a circle facing their teacher in the center. Each student initially has an even number of pieces of candy. When the teacher b

2015-08-22 19:42:31 728

原创 HDU 1033.Edge【模拟】【8月22】

EdgeProblem DescriptionFor products that are wrapped in small packings it is necessary that the sheet of paper containing the directions for use is folded until its size becomes small enough

2015-08-22 18:44:04 778

原创 HDU 1032.The 3n + 1 problem【注意细节】【估计数据不强】【8月21】

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

2015-08-21 19:34:22 1207

原创 HDU 1031.Design T-Shirt【结构体二次排序】【8月21】

Design T-ShirtProblem DescriptionSoon after he decided to design a T-shirt for our Algorithm Board on Free-City BBS, XKA found that he was trapped by all kinds of suggestions from everyone o

2015-08-21 19:15:03 728

原创 HDU 1029.Ignatius and the Princess IV【数据弱鸡】【咦，水题！】【8月20】

Ignatius and the Princess IVProblem Description"OK, you are not too bad, em... But you can never pass the next test." feng5166 says."I will tell you an odd number N, and then N integers.

2015-08-20 16:59:50 542

原创 HDU 1028.Ignatius and the Princess III【分析】【8月20】

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

2015-08-20 15:52:50 698

原创 HDU 1022.Train Problem I【栈的应用】【8月19】

Train Problem IProblem 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 Igna

2015-08-19 14:09:40 545

原创 HDU 1021.Fibonacci Again【规律】【不可直接求】【8月18】【记录】

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,

2015-08-18 20:46:48 616

原创 HDU 1019.Least Common Multiple【多个数的最小公倍数】【自己的算法】【8月18】【8月19更新】

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 e

2015-08-18 19:28:51 839

原创 HDU 1017.A Mathematical Curiosity【细节及转换】【8月18】

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 lin

2015-08-18 19:09:35 804

原创 HDU 1016.Prime Ring Problem【DFS（递归）】【素数打表】【8月17】

Prime Ring ProblemProblem DescriptionA ring is compose of n circles as shown in diagram. Put natural number 1, 2, ..., n into each circle separately, and the sum of numbers in two adjacent c

2015-08-17 14:08:33 613

原创 HDU 1015.Safecracker【暴力枚举】【8月17】

SafecrackerProblem Description=== Op tech briefing, 2002/11/02 06:42 CST === "The item is locked in a Klein safe behind a painting in the second-floor library. Klein safes are extremely ra

2015-08-17 13:11:03 726

原创 HDU 1014.Uniform Generator【模拟及优化】【8月16】

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]

2015-08-16 17:40:21 1108

原创 HDU 1013.Digital Roots【模拟或数论】【8月16】

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

2015-08-16 17:06:46 634

原创 HDU 1012.u Calculate e【水】【8月16】

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 relatively

2015-08-16 16:40:14 666

原创 HDU 1009.FatMouse' Trade【贪心算法】【8月16】

FatMouse' TradeProblem 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 roo

2015-08-16 16:10:27 788

原创 HDU 1005.Number Sequence【很多问题是不能直接求的】【8月15】

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 v

2015-08-15 22:10:28 411

原创 SDNU 1125 HDU 1004 Let the Balloon Rise【用map做水题】【map应用】【8月14】

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

2015-08-14 19:09:07 919

原创 HDU 1003.Max Sum【最大连续子序列和】【8月14】

Max SumProblem 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

2015-08-14 18:36:26 621

原创 HDU 4508.湫湫系列故事——减肥记I【背包】【算法的优化】【8月13】

湫湫系列故事——减肥记IProblem Description　　对于吃货来说，过年最幸福的事就是吃了，没有之一！　　但是对于女生来说，卡路里（热量）是天敌啊！　　资深美女湫湫深谙“胖来如山倒，胖去如抽丝”的道理，所以她希望你能帮忙制定一个食谱，能使她吃得开心的同时，不会制造太多的天敌。　　当然，为了方便你制作食谱，湫湫给了你每日食物清单，上面描述了当天她想吃的

2015-08-13 18:55:24 1137

原创 HDU 1097.A hard puzzle【快速幂或规律】【8月12】

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

2015-08-12 20:50:21 1901

空空如也

空空如也