3473396_ce.cc

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

#include <math.h>

int main() {
    double a, min = 1e10;
    int L, D, N;

    scanf("%lf%d", &a, &L);
    for (int i = 1; i <= L; i++) {
        if (min < 1e-14) {
			min=0;
		}
		int k;
        k = a * i;
        if (k == 0) {
            k = 1;
		}
        if (k > L) {
			k = L;
		}
        if (min > fabs(a - (double) k / i)) {
			min = fabs(a - (double) k / i);
			N = k;
			D = i;
        }
        if (k < L) {
			k++;
		}
        if (min > fabs(a - (double) k / i)) {
			min = fabs(a - (double) k / i);
			N = k;
			D = i;
        }
    }
    printf("%d %d\n", N, D);
	return 0;
}