蓝桥杯 数字黑洞 模拟

 1 #include <bits/stdc++.h>
 2 using namespace std;
 3 int cnt;
 4 int num[4]; //存储四位数字的每一位 
 5 int main() {
 6     int n;
 7     cin >> n;
 8     while (n != 6174) {
 9         num[0] = n % 10;
10         num[1] = n / 10 % 10;
11         num[2] = n / 100 % 10;
12         num[3] = n / 1000;
13         sort(num, num + 4); 
14         int minn = num[0] * 1000 + num[1] * 100 + num[2] * 10 + num[3];
15         int maxx = num[0] * 1 + num[1] * 10 + num[2] * 100 + num[3] * 1000;
16         //cout << "maxx: " << maxx << endl;
17         //cout << "minn: " << minn << endl;
18         n = maxx - minn;
19         cnt++;
20     }
21     cout << cnt << endl;
22     return 0;
23 }