70pts 求调

#include <bits/stdc++.h>
using namespace std;

int e, m, a, b, c;

int gcd(int x, int y) {
    return y > 0 ? gcd(y, x % y) : x;
}

void p1(int x, int y) {
    if (x == 0) {
        cout << 0;
    }
    else {
        if (y < 0) {
            x = -x;
            y = -y;
        }
        int t = gcd(x, y);
        x /= t;
        y /= t;
        cout << x;
        if (y != 1)
            cout << '/' << y;
    }
}

int find(int x) {
    int ans = 0;
    for (int i = 1; i * i <= x; i++)
        if (x % (i * i) == 0)
            ans = i;
    return ans;
}

void p2(int x, int y) {
    int q = find(x), r = x / (q * q);
    int t = gcd(q, y);
    q /= t;
    y /= t;
    if (q != 1)
        cout << q << "*sqrt(" << r << ")";
    else
        cout << "sqrt(" << r << ")";
    if (y != 1)
        cout << "/" << y;
}

int main() {
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    cin >> e >> m;
    while (e--) {
        cin >> a >> b >> c;
        int det = b * b - 4 * a * c;
        if (det < 0) {
            cout << "NO" << endl;
            continue;
        }
        int t = sqrt(det);
        if (t * t == det) {
            if (a > 0)
                p1(-b + t, 2 * a);
            else
                p1(-b - t, 2 * a);
        }
        else {
            if (b != 0) {
                p1(-b, 2 * a);
                cout << '+';
            }
            if (a < 0)
                p2(det, -2 * a);
            else
                p2(det, 2 * a);
        }
        cout << endl;

    }
    return 0;
}