随笔分类 - 杭电ACM简单题
摘要:Problem Description There are another kind of Fibonacci numbers: F(0) = 7, F(1) = 11, F(n) = F(n-1) + F(n-2) (n>=2). Input Input consists of a sequenc
阅读全文
摘要:Problem Description Given a string containing only 'A' - 'Z', we could encode it using the following method: 1. Each sub-string containing k same char
阅读全文
摘要:Problem Description The least common multiple (LCM) of a set of positive integers is the smallest positive integer which is divisible by all the numbe
阅读全文
摘要:Problem Description A simple mathematical formula for e iswhere n is allowed to go to infinity. This can actually yield very accurate approximations o
阅读全文
摘要:Problem Description The highest building in our city has only one elevator. A request list is made up with N positive numbers. The numbers denote at w
阅读全文
摘要:Problem Description Contest time again! How excited it is to see balloons floating around. But to tell you a secret, the judges' favorite time is gues
阅读全文
摘要:Problem Description I have a very simple problem for you. Given two integers A and B, your job is to calculate the Sum of A + B. Input The first line
阅读全文
摘要:Problem Description 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, o
阅读全文
摘要:Problem Description Calculate A + B. Input Each line will contain two integers A and B. Process to end of file. Output For each case, output A + B in
阅读全文

浙公网安备 33010602011771号