摘要： Gems Fight!Time Limit: 20000/10000 MS (Java/Others)Memory Limit: 327680/327680 K (Java/Others) Total Submission(s): 555Accepted Submission(s): 233 Problem Description Alice and Bob are playing "Gems Fight!": There are Gems of G different colors , packed in B bags. Each bag has several Gems 阅读全文

摘要： 哎，弄了半天这次的C还是没出，真是捉急！，还TM的以为前几次只是运气不好！太逗了！ 阅读全文

摘要： C. Matrixtime limit per test 1 secondmemory limit per test 256 megabytesYou have a string of decimal digits s. Let's define bij = si·sj. Find in matrix b the number of such rectangles that the sum bij for all cells (i, j) that are the elements of the rectangle equals a in each rectangle.A r 阅读全文

摘要： B. The Fibonacci Segmenttime limit per test 1 secondmemory limit per test 256 megabytesYou have array a1, a2, ..., an. Segment [l, r] (1 ≤ l ≤ r ≤ n) is good if ai = ai - 1 + ai - 2, for all i (l + 2 ≤ i ≤ r).Let's define len([l, r]) = r - l + 1, len([l, r]) is the length of the segment [l, r]. 阅读全文

摘要： A. Good Numbertime limit per test 1 secondmemory limit per test 256 megabytesLet's call a number k-good if it contains all digits not exceeding k (0, ..., k). You've got a number k and an array a containing n numbers. Find out how many k-good numbers are in a (count each number every time it 阅读全文