桁和 / Digit Sum -atcoder

Problem Statement For integers b(b≥2) and n(n≥1), let the function f(b,n) be defined as follows: f(b,n)=n, when n<b f(b,n)=f(b, floor(n⁄b))+(n mod b), when n≥b Here, floor(n⁄b) denotes the largest int

>>阅读原文<<