Codeforces
一只可怜的皮卡丘
每一个不曾起舞的日子,都是对生命的辜负。
怕什么题海无涯,水一题有水一题的欢喜。
你可不可以
成为我的main函数
做我此生必须有
且只能有一个的入口
我愿为自己加上private
在你的class中只有
你能调用
展开
-
Same Parity Summands
You are given two positive integers n (1≤n≤109) and k (1≤k≤100). Represent the number n as the sum of k positive integers of the same parity (have the same remainder when divided by 2).In other words, find a1,a2,…,ak such that all ai>0, n=a1+a2+…+ak an原创 2020-05-11 11:52:05 · 383 阅读 · 0 评论 -
1352A - Sum of Round Numbers
Sum of Round NumbersA positive (strictly greater than zero) integer is called round if it is of the form d00…0. In other words, a positive integer is round if all its digits except the leftmost (most significant) are equal to zero. In particular, all numb原创 2020-05-10 18:05:22 · 361 阅读 · 0 评论