6 条题解

  • 0
    @ 2024-10-18 18:01:33

    #include #include #include using namespace std;

    int n,a[6],b[6];

    bool cmp(int x,int y) { return x > y; }

    int main() { cin >> n; while(n != 6174) { memset(a,0,sizeof(a)); memset(b,0,sizeof(b)); int num = n,sum = 0; n = 0; for(int i = 1;num != 0;i++) { a[i] = num%10; b[i] = num%10; num /= 10; } sort(a+1,a+5,cmp); sort(b+1,b+5); for (int i = 1;i <= 4;i++) { n = n10+a[i]; sum = sum10+b[i]; } cout << n << "-" << sum << "=" << n-sum << endl; n = n-sum; } return 0; }

    信息

    ID
    1014
    时间
    1000ms
    内存
    128MiB
    难度
    4
    标签
    递交数
    254
    已通过
    117
    上传者