红旗杯_第十四届东北地区大学生程序设计竞赛-热身赛
Problem AProblem DescriptionMo’s algorithm can solve some difficult data structure problems. Like this: You are given an array a1,a2,…,an and m querie
...
codeforcesround668div2
Codeforces Round #668 EditorialA题目链接A题A. Permutation Forgerytime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstan
...
codeforces round 655 div2
Codeforces Round #655 (Div. 2)A. Omkar and CompletionA题time limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard
...
PAT甲1140字符串
PAT甲1140字符串题目链接1140 Look-and-say Sequence (20分)Look-and-say sequence is a sequence of integers as the following:
D, D1, D111, D113, D11231, D112213111
...
PAT甲1005字符串
PAT甲1005字符串题目链接1005 Spell It Right (20分)Given a non-negative integer N, your task is to compute the sum of all the digits of N, and output every digit
...