問題：B - Ringo's Favorite Numbers #include <cmath> #include <iostream> using namespace std; #define DIGIT 100 int getDivCount(int x_val) { int cnt = 0; while (x_val % 100 == 0) { x_val /= 100; ++cnt; } return cnt; } int main(void) { int d, n, num, val; ci</iostream></cmath>…