B3866 [GESP202309 二级] 数字黑洞

模拟即可

#include <cstdio>
#include <iostream>
#include <algorithm>
using namespace std; int n; int main() {
	cin >> n;
	for (int i = 0; ; i ++ ) {
		if (n == 495) return cout << i, 0;
		int a[3];
		a[0] = n / 100, a[1] = n / 10 % 10, a[2] = n % 10;
		std::sort(a, a + 3);
		n = (a[2] - a[0]) * 100 + a[0] - a[2];
	}
}