2142900_ole.cpp

北大大牛代码 1240道题的原代码 超级权威

# include <stdio.h>
# include <string.h>
# include <stdlib.h>
# include <algorithm>

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

void input()
{
	char num[5], num1[5];
	int t1, t2, n;

	while(scanf("%s",num)==1&&strcmp(num,"-1")!=0)
	{
		printf("N=%s:\n",num);
		n = 0;
		strcpy(num1,num);
		std::sort(num,num+4);
		std::sort(num1,num1+4,cmp);
		if(strcmp(num,num1)==0)
			printf("NO!!\n");
		else
			while(1)
			{
				t1 = atoi(num1);t2 = atoi(num);
				printf("%d-%d=%d\n",t1,t2,t1-t2);
				n++;
				if(t1-t2==0||t1-t2==6174)
				{
					printf("Ok!! %d times\n",n);
					break;
				}
				itoa(t1-t2,num,10);
				strcpy(num1,num);
				std::sort(num,num+strlen(num));
	        	std::sort(num1,num1+strlen(num1),cmp);
			}
	}
}

int main()
{
	input();
	return 1;
}