dixrqbzj69988-CSDN博客

转载 [HDOJ#1021]Fibonacci Again

#include<iostream>using namespace std;int main(void){ int n; while(cin>>n) { if (n%4==2) cout<<"yes"<<endl; ...

2015-05-20 11:03:00 69

转载 [HDOJ#1020]Encoding

Problem DescriptionGiven a string containing only 'A' - 'Z', we could encode it using the following method: 1. Each sub-string containing k same characters should be encoded to "kX" where "X" ...

2015-05-13 12:30:00 87

转载 [HDOJ#1018]Big Number

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

2015-05-12 21:40:00 82

转载 [HDOJ#1013]Digital Roots

Problem 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 root. If the ...

2015-05-12 10:19:00 79

转载 [HDOJ#1012]u Calculate e

Problem 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 small values of n....

2015-05-11 16:26:00 83

转载 [HDOJ#1009]FatMouse' Trade

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

2015-05-11 15:43:00 96

转载 [HDOJ#1008]Elevator

Problem 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, in speci...

2015-05-11 15:42:00 65

转载 [HDOJ#1007]Quoit Design

Problem DescriptionHave you ever played quoit in a playground? Quoit is a game in which flat rings are pitched at some toys, with all the toys encircled awarded. In the field of Cyberground, th...

2015-05-11 15:40:00 59

转载 [HDOJ#1006]Tick and Tick

Problem DescriptionThe three hands of the clock are rotating every second and meeting each other many times everyday. Finally, they get bored of this and each of them would like to stay away fr...

2015-05-11 15:38:00 105

转载 [HDOJ#1005]Number Sequence

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).Input...

2015-05-11 15:36:00 78

转载 [HDOJ#1004]Let the Balloon Rise

Problem 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 problem. When the cont...

2015-05-11 15:34:00 53

转载 [HDOJ#1003]Max Sum

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

2015-05-11 15:33:00 75

转载 [HDOJ#1002]A + B Problem II

Problem DescriptionI have a very simple problem for you. Given two integers A and B, your job is to calculate the Sum of A + B.InputThe first line of the input contains an integer T(1&lt...

2015-05-11 15:31:00 63

转载 [HDOJ#1001]Sum Problem

Problem 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 will consist of a...

2015-05-11 15:28:00 88

转载 [HDOJ#1000]A + B Problem

Problem DescriptionCalculate A + B.InputEach line will contain two integers A and B. Process to end of file.OutputFor each case, output A + B in one line.Sample Input1 1...

2015-05-11 15:24:00 89

dixrqbzj69988的博客