(sscanf,sprintf)Cabric Number Problem(P1350)

又学到东东了,哈哈,

注意:要限制其输入的数是四位的,不然不合法,

#include <iostream>
#include<algorithm>
using namespace std;

bool cmp(char a,char b)
{
	return a>b;
}

bool get_next(int &x)
{
	int a,b,n;
	char s[11];
	sprintf(s,"%d",x);
	n = strlen(s);
	sort(s,s+n);
	sscanf(s,"%d",&a);
	sort(s,s+n,cmp);
	sscanf(s,"%d",&b);
	
	printf("%d-%d=%d\n",b,a,b-a);

	x=b-a;
    if (b-a==6174||b-a==0)
		return false;
	return true;
}

int main()
{
	int i,j,k;
	int n;
	while (cin>>n,n!=-1)
	{
		printf("N=%d:\n",n);
		int step=1;
		if (n%1111==0||n>9999||n<1000)
		{
			printf("No!!\n");
			continue;
		}
		while (get_next(n))
			step++;
		printf("Ok!! %d times\n",step);
	}
	return 0;
}

Cabric Number Problem

Time Limit: 1000MS		Memory Limit: 65536K
Total Submissions: 8209		Accepted: 2519

Description

If we input a number formed by 4 digits and these digits are not all of one same value, then it obeys the following law. Let us operate the number in the following way:
(1) Arrange the digits in the way from bigger to smaller, such that it forms the biggest number that could be made from these 4 digits;
(2) Arrange the digits in the way from smaller to bigger, such that it forms the smallest number that could be made from these 4 digits (If there is 0 among these 4 digits, the number obtained may be less than four digits);
(3) Find the difference of these two numbers that is a new four digital number.
Repeat the above process, we can finally always get the result 6174 or 0.
Please write the program to realize the above algorithm.

Input

Each case is a line of an integer.-1 denotes the end of input.

Output

If the integer is formed exactly by 4 digits and these digits are not all of one same value, then output from the program should show the procedure for finding this number and the number of repetition times. Otherwise output "No!!".

Sample Input

5364
2221
4444
-1

Sample Output

N=5364:
6543-3456=3087
8730-378=8352
8532-2358=6174
Ok!! 3 times
N=2221:
2221-1222=999
999-999=0
Ok!! 2 times
N=4444:
No!!

Source

Xi'an 2002