Codeforces Round #606 (Div. 2, based on Technocup 2020 Elimination Round 4)
A.HappyBirthday,Polycarp!(CF1277A)题目大意问\(1\)到\(n\)中有多少个数是由一个数字组成的数解题思路很显然只有\(11,22,33,44,55,66\)等诸如此类的数,则一共有(位数-\(1\))*\(9\)+首位-\(1\)+(\(n\)是否大于以首位数字构成,长度为\(n\)的数字).神奇的代码#include#defineMIN(a,b)((((a)(