【 CodeForces - 1060B 】Maximum Sum of Digits(思维,构造)
题干:Youaregivenapositiveintegernn.LetS(x)S(x)besumofdigitsinbase10representationofxx,forexample,S(123)=1+2+3=6S(123)=1+2+3=6,S(0)=0S(0)=0.Yourtaskistofindtwointegersa,ba,b,suchthat0≤a,b≤n0≤a,b≤n,a+b=na