[UVA] 10922 - 2 the 9s
Problem C - 2 the 9sTime Limit: 1 second
Introduction to the problem
A well-known trick to know if an integer N is a multiple of nine is to
compute the sum S of its digits. If S is a multiple of nine, then so is
N. This is a recursive test, and the depth of the recu...
