樱花落舞

摘要： Partial Sum Accepted : 124 Submit : 450 Time Limit : 3000 MS Memory Limit : 65536 KB Partial Sum Partial Sum Bobo has a integer sequence a1,a2,…,an of 阅读全文

摘要： Super Resolution Accepted : 133 Submit : 203 Time Limit : 1000 MS Memory Limit : 65536 KB Super Resolution Super Resolution Bobo has an n×m picture co 阅读全文

摘要： Coprime Sequence Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others)Total Submission(s): 545 Accepted Submission(s): 19 阅读全文

摘要： Automatic Judge Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others)Total Submission(s): 827 Accepted Submission(s): 284 阅读全文

摘要： Description You are given positive integer number n. You should create such strictly increasing sequence of k positive numbersa1, a2, ..., ak, that th 阅读全文

摘要： Description You are given the array of integer numbers a0, a1, ..., an - 1. For each element find the distance to the nearest zero (to the element whi 阅读全文

摘要： Description You are given matrix with n rows and n columns filled with zeroes. You should put k ones in it in such a way that the resulting matrix is 阅读全文

摘要： Description Mike has a sequence A = [a1, a2, ..., an] of length n. He considers the sequence B = [b1, b2, ..., bn] beautiful if the gcd of all its ele 阅读全文

摘要： Description Mike has n strings s1, s2, ..., sn each consisting of lowercase English letters. In one move he can choose a string si, erase the first ch 阅读全文

摘要： Description Mike has a string s consisting of only lowercase English letters. He wants to change exactly one character from the string so that the res 阅读全文