CSP-J T3正（歪？）解

#include <bits/stdc++.h>
using namespace std;
struct num{
	int p,q;
	void yue(){
		if(q<0){
			q*=-1,p*=-1;
		}
		int t=abs(__gcd(p,q));
		p/=t,q/=t;
		return ;
	}
	void printnum(){
		if(p==q)cout << 1;
		else if(q==1)cout << p;
		else cout << p << '/' << q;
		return;
	}
};
struct root{
	num q1,q2;
	int gen;
	void get(){
		for(int i=2;i*i<=gen;i++){
			while(gen%(i*i)==0){
				gen/=(i*i);
				q2.p*=i;
			}
		}
		q2.yue();
	}
	void printroot(){
		if(q2.p==q2.q)cout << "sqrt(" << gen << ")";
		else if(q2.q==1)cout << q2.p << "*sqrt(" << gen << ")";
		else if(q2.p==1)cout << "sqrt(" << gen << ")/" << q2.q;
		else cout << q2.p << "*sqrt(" << gen << ")/" << q2.q;
		cout << endl;
	}
};
void solve(){
	int a,b,c;
	cin >> a >> b >> c;
	int del=b*b-(4*a*c);
	if(del<0){
		cout << "NO" << endl;
		return;
	}
	if((int)(sqrt(del))*(int)(sqrt(del))==del){
		num ans;
		if((0-b+(int)(sqrt(del))*1.0)/(2*a)>(0-b-(int)(sqrt(del))*1.0)/(2*a)){
			ans.p = 0-b+sqrt(del);
		}else{
			ans.p = 0-b-sqrt(del);
		}
		ans.q=2*a;
		ans.yue();
		ans.printnum();
		cout <<endl;
		return;
	}
	root x;
	x.q1.p=-b;
	x.q1.q=2*a;
	x.q1.yue() ;
	x.q2.q = 2*a;
	x.gen = del;
	if((0-b+(sqrt(del))*1.0)/(2*a)>(0-b-(sqrt(del))*1.0)/(2*a)){
		x.q2.p = 1;
	}else{
		x.q2.p = -1;
	}
	x.get();
	if(x.q1.p!=0){
		x.q1.printnum();
		cout << '+';
	}
	x.printroot();
	return;
}
int q,m;
int main(){
	cin >> q >> m;
	while(q--){
		solve();
	}
	return 0;
}