本文共 1198 字,大约阅读时间需要 3 分钟。
为了达到数字黑洞6174,我们需要按照特定的步骤处理四位正整数。以下是详细的过程和代码实现:
#include#include using namespace std;void to_array(int n, int arr[4]) { for(int i = 0; i < 4; i++) { arr[i] = n % 10; n /= 10; } reverse(arr, arr + 4);}int to_number(int arr) { int num = 0; for(int i = 0; i < 4; i++) { num = num * 10 + arr[i]; } return num;}int main() { int n; cin >> n; int arr[4]; bool stop = false; while(!stop) { to_array(n, arr); int min_val = to_number(arr); sort(arr, arr + 4); int max_val = to_number(arr); sort(arr, arr + 4, greater ()); int diff = max_val - min_val; if(diff == 0 || diff == 6174) { stop = true; } printf("%04d - %04d = %04d\n", max_val, min_val, diff); n = diff; } return 0;}
通过以上步骤和代码,我们可以准确地模拟数字黑洞6174的形成过程。
转载地址:http://tsynz.baihongyu.com/