摘要: Problem Description Have you ever played quoit in a playground? Quoit is a game in which flat rings are pitched at some toys, with all the toys encirc 阅读全文
posted @ 2017-12-13 22:06 ixummer 阅读(288) 评论(0) 推荐(0)
摘要: Problem Description A 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 阅读全文
posted @ 2017-12-13 17:18 ixummer 阅读(655) 评论(0) 推荐(0)
摘要: 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 阅读全文
posted @ 2017-12-13 16:38 ixummer 阅读(203) 评论(0) 推荐(0)
摘要: Problem Description Given 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 阅读全文
posted @ 2017-12-13 16:03 ixummer 阅读(155) 评论(0) 推荐(0)
摘要: 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 阅读全文
posted @ 2017-12-13 15:06 ixummer 阅读(168) 评论(0) 推荐(0)