Grass is Green

Grass is Green

.
.
题意：水题，给定每个人的钱、买地的单位价格，买草的单位价格，买篱笆的单位价格，问买地面积比第一位大的有多少人。
解法：直接解二元一次方程组，计算每个人能买的最大变长，然后判断即可。
.
.

#include <iostream>
#include <stdio.h>
#include <stdlib.h>
#include <algorithm>
#include <math.h>
using namespace std;

const double eps = 1e-8;
double c_a, c_g, c_f, money, a, b, c;
struct Node {
    double r;
    int index;
}f[20000];
int n, ans;

int main() {
    while (scanf("%d %lf", &n, &c_a) != EOF) {
        if (n == 0 && fabs(c_a) < eps) break;
        for (int i = 1; i <= n; i++) {
            scanf("%lf %lf %lf", &money, &c_g, &c_f);
            a = c_a+c_g;
            b = 4*c_f;
            c = -money;
            f[i].index = i;
            if (b*b-4*a*c < -eps) {
                f[i].r = 0;
            } else {
                f[i].r = (-b+sqrt(fabs(b*b-4*a*c)))/(2*a);
                if (f[i].r < -eps) f[i].r = 0;
            }
        }
        ans = 0;
        for (int i = 2; i <= n; i++) if (f[i].r - f[1].r > eps) {
            ans++;
        }
        printf("%d\n", ans);
    }
}