PAT 1019 数字黑洞

基本思路：

输入数字只有4位

1. 先把int类型➡️vector类型
2. 如果vector.size() < 4，补0
3. 两个sort排序
4. vector➡️int

#include <bits/stdc++.h>
using namespace std;
ostream &sp(ostream &output);
int to_num(vector<int> x)//vector 转 int
{
    int temp = 0;
    for (int i = 0; i < x.size(); ++i)
    {
        temp = temp * 10 + x[i];
    }
    return temp;
}
pair<int, int> Sort(int num)
{
    pair<int, int> temp;//一次返回两个整数比较方便
    vector<int> a;
    vector<int> b;
    for (int i = 0; i < 4; ++i)//int转vector
    {
        int x = num % 10;
        a.push_back(x);
        num /= 10;
    }
    b = a;
    //补0
    while (a.size() < 4)
    {
        a.push_back(0);
    }
    while (b.size() < 4)
    {
        b.push_back(0);
    }
    sort(a.begin(), a.end(), less<int>{});
    sort(b.begin(), b.end(), greater<int>{});
    temp.first = to_num(b);
    temp.second = to_num(a);
    return temp;
}

int main()
{
    int n;
    cin >> n;
    int ans = n;
    while (1)
    {
        pair<int, int> temp;
        temp = Sort(ans);
        ans = temp.first - temp.second;
        if (ans == 0)
        {
            cout << setw(4) << setfill('0') << temp.first << sp << "-" << sp << setw(4) << setfill('0') << temp.second << sp << "=" << sp << "0000" << endl;
            break;
        }
        else if (ans == 6174)
        {
            cout << setw(4) << setfill('0') << temp.first << sp << "-" << sp << setw(4) << setfill('0') << temp.second << sp << "=" << sp << ans << endl;
            break;
        }
        else
        {
            cout << setw(4) << setfill('0') << temp.first << sp << "-" << sp << setw(4) << setfill('0') << temp.second << sp << "=" << sp << setw(4) << setfill('0') << ans << endl;
        }
    }
    return 0;
}
ostream &sp(ostream &output)
{
    return output << " ";
}