数学黑洞
Problem Description
Input
Output
Example Input
1000 1500 3000
Example Output
999 8991 8082 8532 6174 5 5085 7992 7173 6354 3087 8352 6174 7 2997 7173 6354 3087 8352 6174 6
Hint
Author
#include<stdio.h>
int max,min;
int count;
int f( int n )
{
int m, i;
int a[4] = {0};
for( i = 0; n != 0; i ++ )
{
a[i] = n % 10;
n /= 10;
}
sort_max_min(a);
m = max - min;
if(m == 6174)
{
printf("6174 \n");
count ++;
return count;
}
else
{
printf("%d ",m);
count++;
f(m);
}
}
int sort_max_min(int a[])
{
int i,j;
int t;
for(i = 0; i < 3; i ++ )
for(j = 0; j < 3 - i; j ++ )
{
if(a[j] < a[j+1])
{
t = a[j];
a[j] = a[j+1];
a[j+1] = t;
}
}
max = min = 0;
for(i = 0, j = 1; i < 4; i ++ )
{
min += a[i] * j;
j *= 10;
}
for(i = 3, j = 1; i >= 0 ; i --)
{
max += a[i] * j;
j *= 10;
}
}
int main()
{
int n;
while(~scanf("%d",&n))
{
count=0;
printf("%d\n",f(n));
}
return 0;
}