7-31 掉入陷阱的数字

/*
7-31 掉入陷阱的数字 (15 分)

*/

#include<stdio.h>
int f(int n);
int main(void)
{
	int n;
	scanf("%d",&n);
	int result = 0;
	int result_new =n;
	int i=0;
	
	//肯定是两个变量，一个存放之前的结果，另一个存放新产生的结果 
	while(result_new != result)
	{
		result = result_new; 
		result_new =f(result);
		i++;
		printf("%d:%d\n",i,result_new);
	}
	
	/*
	(1)result_new = n0;
		result = n0;
		result_new =  f(n0);==及n1
		判断 n1!=n0
		result = n1;
		result_new = n2; 
	(2)result = n1 = f(n0)
		n1 != n0;
		result_new != result
	(3)result = n1
		result = result_new
		result_new = n2 = f(n1);
	(4)判断
		先给结果
		再赋值
	(5)判断 
			 
	*/
	return 0;
}

int f(int n)
{
	int sum=0;
	while(n!=0)
	{
		sum += n%10;
		n/=10; 
	}
	return sum*3+1;
}