1968369_ac_0ms_60k.c

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

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

int main()
{
	int i, j, k, cas;
	int len[100], len1[100];
	__int64 p, q, tmp;
	__int64 num[100];

	cas = 1;
	while(scanf("%I64d%I64d",&p,&q)==2&&p&&q)
	{
		printf("Case %d:\n",cas++);
		printf("%I64d / %I64d\n",p,q);
		i = 0;
		while(1)
		{
			num[i] = p/q;
			tmp = p%q;
			if(tmp==0)
			{
				num[i]--;
				len[i] = (int)log10((double)num[i])+1;
				i++;
				break;
			}
			p = q;
			q = tmp;
			len[i] = (int)log10((double)num[i])+1;
			i++;
		}
		len[i] = len1[i] = 1;
		for(j = i-1; j >= 0; j--)
			len1[j]=len1[j+1]+len[j]+3;
		for(j = 0; j < 2*i; j++)
		{
			if(j%2==0)
			{
				for(k = 0; k < len1[0]; k++)
					if(k==(len1[j/2+1]+1)/2+len1[0]-len1[j/2+1]-1)
						printf("1");
					else
						printf(".");
				printf("\n");
			}
			else
			{
				for(k = 0; k < len1[0]-len[j/2]-3-len1[j/2+1]; k++)
					printf(".");
				printf("%I64d.+.",num[j/2]);
				for(k = 0; k < len1[j/2+1]; k++)
					printf("-");
				printf("\n");
			}
		}
		for(j = 0; j < len1[0]-1; j++)
			printf(".");
		printf("1\n");
	}
	return 1;
}