POJ1650 Integer Approximation（“追赶法”搜索）

Link：http://poj.org/problem?id=1650

Integer Approximation

Time Limit: 1000MS		Memory Limit: 65536K
Total Submissions: 5767		Accepted: 1942

Description

The FORTH programming language does not support floating-point arithmetic at all. Its author, Chuck Moore, maintains that floating-point calculations are too slow and most of the time can be emulated by integers with proper scaling. For example, to calculate the area of the circle with the radius R he suggests to use formula like R * R * 355 / 113, which is in fact surprisingly accurate. The value of 355 / 113 ≈ 3.141593 is approximating the value of PI with the absolute error of only about 2*10 ^-7. You are to find the best integer approximation of a given floating-point number A within a given integer limit L. That is, to find such two integers N and D (1 <= N, D <= L) that the value of absolute error |A - N / D| is minimal.

Input

The first line of input contains a floating-point number A (0.1 <= A < 10) with the precision of up to 15 decimal digits. The second line contains the integer limit L. (1 <= L <= 100000).

Output

Output file must contain two integers, N and D, separated by space.

Sample Input

3.14159265358979
10000

Sample Output

355 113

Source

Northeastern Europe 2001, Far-Eastern Subregion

AC code：

#include<iostream>
#include<stdio.h>
#include<algorithm>
#include<math.h>
#include<string.h>
#include<map>
#include<set>
#define LL long long
#define INF 0xfffffff

using namespace std;

int main()
{
//	freopen("in.txt","r",stdin);
	int L,N,D,ansN,ansD;
	double A,p,minp;
	while(scanf("%lf%d",&A,&L)!=EOF)
	{
		N=1;
		D=1;
		ansN=N;
		ansD=D;
		minp=INF;
		while(N<=L&&D<=L)
		{
			p=A-1.0*N/D;
			if(fabs(p)<minp)
			{
				ansN=N;
				ansD=D;
				minp=fabs(p);
			}
			if(p<=0)
			{
				D++;
			}
			else
			{
				N++;
			}
		}
		printf("%d %d\n",ansN,ansD);
	}
	return 0;
}