#include <stdio.h>
#include <math.h>
#include <stdlib.h>

int main()
{
	double a1,b1,tag;
	int B,W,C,ans;
	double b,w,c;
	double EX =0.00001f;
	while (scanf("%d%d%d",&B,&W,&C) && B+W+C)
	{
		ans = 1;
		b = 16.0*B; w = W*16; c = C;
		tag = b / w;
		b1 = c / w;
		a1 = (b-c) / (c * w / (c+w));
		while (fabs(b1-a1)>=EX)
		{
			b1 = (w * b1 * (1+a1) + c * a1 * (1+b1)) / (w * (1+a1) + c * (1+b1));
			a1 = ((b-c) * a1 * (1+b1) + c * b1 * (1+a1)) / ((b-c) * (1+b1) + c * (1+a1));
			ans++;
			printf("ans: %d tag: %lf a1: %lf b1: %lf\n",ans,tag,a1,b1);
			//system("PAUSE");
		}
		printf("%d\n",ans);
	}
	return 0;
}

• 计算次数太多导致浮点误差，应该推出递推式直接计算 (0) GODBLESSYOU 2007-02-26 00:53:56
• 可以把递推关系整成矩阵形式，应该能证明这个矩阵是可对角化的，这样对角化之后可以推出倒i次之后比值的通项公式 (0) bufan_2001 2007-02-26 20:03:09