新月

Time Limit: 3000/1000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 2046    Accepted Submission(s): 813Problem DescriptionAs we all known , the Fibona

DescriptionIt's well known that DNA Sequence is a sequence only contains A, C, T and G, and it's very useful to analyze a segment of DNA Sequence，For example, if a animal's DNA sequence contains s

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 4709    Accepted Submission(s): 1465Problem Description背单词，始终是复习英语的重要环节。在荒废了3年大学生涯

Time Limit: 5000/3000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 144    Accepted Submission(s): 84Problem DescriptionClarke is a patient with multi

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2181    Accepted Submission(s): 816Problem Description春天到了, HDU校园里开满了花, 姹紫嫣红, 非常美丽

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2383    Accepted Submission(s): 833Problem Description　　According to a research, V

Time Limit: 10000/5000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 3712    Accepted Submission(s): 1680Problem DescriptionQueues and Priority Queues

Time Limit: 2000/2000 MS (Java/Others)    Memory Limit: 65535/65535 K (Java/Others)Total Submission(s): 3354    Accepted Submission(s): 1055Problem DescriptionAn Arc of Dream is a curve

Time Limit: 2000MS Memory Limit: 65536KTotal Submissions: 11496 Accepted: 2815DescriptionFacer's pet cat just gave birth to a brood of little cats. Having considered the he

Time Limit: 3000MS Memory Limit: 131072KTotal Submissions: 18578 Accepted: 7858DescriptionGiven a n × n matrix A and a positive integer k, find the sum S = A + A2 + A3 +

Accept: 204    Submit: 627Time Limit: 1000 mSec    Memory Limit : 65536 KB Problem Descriptionn个六边形排成一行，相邻两个六边形共用一条边，如下图所示：记这个图形的生成树个数为t(n)（由于每条边都是不同的，不存在同构的问题）。那么t(1)=6，t(2)=35……给出n

FibonacciTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 11510 Accepted: 8179DescriptionIn the Fibonacci integer sequence, F0 = 0, F1 = 1, and Fn = Fn

递推求值时间限制：1000 ms  |  内存限制：65535 KB难度：4描述给你一个递推公式：f(x)=a*f(x-2)+b*f(x-1)+c并给你f(1),f(2)的值，请求出f(n)的值，由于f(n)的值可能过大，求出f(n)对1000007取模后的值。注意:-1对3取模后等于2输入第一行是一个整数T,表示测试数据

There are b blocks of digits. Each one consisting of the same n digits, which are given to you in the input. Wet Shark must chooseexactly one digit from each block and concatenate all of those digit