Jack Ge for ACM

摘要： Alice and BobTime Limit: 1000ms Memory limit: 65536K有疑问？点这里^_^题目描述 Alice and Bob like playing games very much.Today, they introduce a new game. There is apolynomial like this:(a0*x^(2^0)+1) * (a1* x^(2^1)+1)*.......*(an-1* x^(2^(n-1))+1). Then Alice ask Bob Q questions. In theexpansion of the Poly.. 阅读全文

摘要： Matrix Power SeriesTime Limit:3000MSMemory Limit:131072KTotal Submissions:11954Accepted:5105DescriptionGiven an×nmatrixAand a positive integerk, find the sumS=A+A2+A3+ … +Ak.InputThe input contains exactly one test case. The first line of input contains three positive integersn(n≤ 30),k(k≤ 109) 阅读全文

摘要： DNA SequenceTime Limit:1000MSMemory Limit:65536KTotal Submissions:9889Accepted:3712DescriptionIt'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 segment AT 阅读全文

摘要： DNA repairTime Limit:2000MSMemory Limit:65536KTotal Submissions:4815Accepted:2237DescriptionBiologists finally invent techniques of repairing DNA that contains segments causing kinds of inherited diseases. For the sake of simplicity, a DNA is represented as a string containing characters 'A' 阅读全文

摘要： QueuingTime Limit: 10000/5000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1949Accepted Submission(s): 911Problem DescriptionQueues and Priority Queues are data structures which are known to most computer scientists. The Queue occurs often in our daily life. There ar 阅读全文

摘要： Problem of PrecisionTime Limit: 1000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 686Accepted Submission(s): 386Problem DescriptionInputThe first line of input gives the number of cases, T. T test cases follow, each on a separate line. Each test case contains on 阅读全文

摘要： A Simple Math ProblemTime Limit: 3000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1697Accepted Submission(s): 959Problem DescriptionLele now is thinking about a simple function f(x).If x < 10 f(x) = x.If x >= 10 f(x) = a0 * f(x-1) + a1 * f(x-2) + a2 * f(x 阅读全文

摘要： A Multiplication GameTime Limit: 5000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 2674Accepted Submission(s): 1532Problem DescriptionStan and Ollie play the game of multiplication by multiplying an integer p by one of the numbers 2 to 9. Stan always starts with 阅读全文

摘要： Organize Your Train part IITime Limit:1000MSMemory Limit:65536KTotal Submissions:6478Accepted:1871DescriptionRJ Freight, a Japanese railroad company for freight operations has recently constructed exchange lines at Hazawa, Yokohama. The layout of the lines is shown in Figure 1.Figure 1: Layout of th 阅读全文

摘要： Surprising StringsTime Limit:1000MSMemory Limit:65536KTotal Submissions:5081Accepted:3336DescriptionTheD-pairsof a string of letters are the ordered pairs of letters that are distance D from each other. A string isD-uniqueif all of its D-pairs are different. A string issurprisingif it is D-unique fo 阅读全文