sunnykema的专栏

Problem C: Longest Common SubsequenceSequence 1: Sequence 2: Given two sequences of characters, print thelength of the longest common subsequence of both sequences. Forexample, the lon

You can say 11Time Limite: 1 secondIntroduction to the problemYour job is, given a positive number N, determine if it is a multiple of eleven.Description of the inputThe input is a f

CDTime Limit:3000MS    Memory Limit:0KB    64bit IO Format:%lld & %lluDescriptionYou have a long drive by car ahead. You have a tape recorder, but unfortunately your best music is on

Fractions Again?!Timelimit: 1 secondIt is easy to see that for every fraction in the form (k > 0), we can always find two positive integersx andy, x ≥ y, such that:.Now

2 the 9sTime Limit: 1 secondIntroduction to the problemA well-known trick to know if an integer N is a multiple of nine is to compute the sum S of its digits. If S is a multiple of nine, t

DollarsNew Zealand currency consists of $100, $50, $20, $10, and $5notes and $2, $1, 50c, 20c, 10c and 5c coins. Write a program thatwill determine, for any given amount, in how many ways that

Problem B - Find the TelephoneTime Limit: 1 secondIn some places is common to remember a phone number associating its digits to letters.In this way the expressionMY LOVE means 69 5683. Of

Wavio Sequence Input:StandardInputOutput: Standard Output Time Limit: 2 Seconds Wavio is a sequence of integers. It has some interestingproperties. ·  Wavio is of odd length i.e. L = 2*n+

Stacking Boxes BackgroundSome concepts in Mathematics and Computer Science are simple in one ortwo dimensions butbecome more complex when extended to arbitrary dimensions. Considersolving

ParityTime Limit: 1 secondWe define the parity of an integer n as the sum of the bits in binary representationcomputed modulo two. As an example, the number21 = 101012 has three 1sin its b