2635317_wa.c

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

#include <stdio.h>

int a, b;
int l, r;
int nume, deno;

int ab(int a)
{
	return a<0?-1*a:a;
}

int best(int c)
{
	int i, min, mini, minc;

	min = 0;

	mini = nume;minc = deno;
	for(i = nume+1; ; i++)
	{
		if(i*b>=a*c&&deno*ab(i*b-a*c)>=c*ab(nume*b-a*deno))
			break;
		if(minc*ab(i*b-a*c)<c*ab(mini*b-a*minc))
			min = mini = i, minc = c;
	}

	return min;
}

int main()
{
	int t;

	while(scanf("%d%d",&a,&b)==2)
	{
		r = 1;
		l = a/b;
		if(!l)
			l = 1;
		printf("%d/%d\n",l,r);
		nume = l; deno = 1;
		while(r<=b)
		{
			r++;
			if(t = best(r))
			{
				printf("%d/%d\n",t,r);
				nume = t,deno = r;
			}
			if(nume*b==deno*a)
				break;
		}
		printf("\n");
	}
	return 0;
}