#include <iostream>
#include <stdio.h>
using namespace std;
int get_next(int x)
{
int a,b,n;
char s[10];
sprintf(s, "%d", x);
n = strlen(s);
for (int i = 0;i < n - 1 ;i++ )
{
for (int j = i + 1;j < n ;j++ )
{
if (s[i] > s[j])
{
int t = s[i];
s[i] = s[j];
s[j] = t;
}
}
}
sscanf(s, "%d", &b);
for (int i = 0;i < n / 2;i++ )
{
int t = s[i];
s[i] = s[n-1-i];
s[n-1-i] = t;
}
sscanf(s, "%d", &a);
return a - b;
}
int num[2000],count;
int main()
{
scanf("%d", &num[0]);
printf("%d", num[0]);
count = 1;
for (; ; )
{
num[count] = get_next(num[count - 1]);
printf("-> %d", num[count]);
int found = 0;
for (int i = 0;i < count;i++ )
{
if (num[i] == num[count])
{
found = 1;
break;
}
}
if (found)
{
break;
}
count++;
}
printf("\n");
return 0;
}
先放上代码,其实我最想说的是完整的看完代码很重要,书上原代码是有一点错误的,本来以为错误小可能就只是第一步排序出错了,改了半天都没用,最后发现错误确实很小但是只是循环问题,而不是排序。
下面说说这个程序我的收获吧,用到了两个我基本没用过的函数sscanf()和sprintf(),两个很实用的函数,在数与数组之间转化的时候很方便