摘要:
Codeforces Round 534 (Div. 2)题解 A. Splitting into digits 题目大意 将一个数字分成几部分,几部分求和既是原数,问如何分可以使得分出来的各个数之间的差值尽可能小 解题思路 将n分成n个1相加即可 AC代码 cpp include include 阅读全文
摘要:
题目链接 https://ac.nowcoder.com/acm/contest/296/H 题目描述 Chiaki was trapped in a strange place which can be regarded as a connected undirected graph with n 阅读全文