CSP-J T3求hack

#include <bits/stdc++.h>
using namespace std;
int t=0,m=0,a=0,b=0,c=0,d=0;
int main(){
	scanf("%d%d",&t,&m);
	while(t--){
		scanf("%d%d%d",&a,&b,&c);
		int deta=b*b-4*a*c;
		if(deta<0){
			printf("NO\n");
			continue;
		}
		if(b==0 and deta!=0 and sqrt(deta)!=int(sqrt(deta))) d=1;
		else if(b==0 and deta==0) printf("0\n");
		else if(sqrt(deta)!=int(sqrt(deta))){
			if(b%(2*a)==0) cout << -b/(2*a);
			else{
				int gc=__gcd(abs(b),abs(2*a));
				if((b<0 and a<0) or (b>0 and a>0)) cout << "-" << abs(b)/gc << "/" << abs(2*a)/gc;
				else cout << abs(b)/gc << "/" << abs(2*a)/gc;
			}
		}
		else{
			b=-b;
			if(a<0) b-=sqrt(deta);
			else b+=sqrt(deta);
			if(b%(2*a)==0) cout << b/(2*a);
			else{
				int gc=__gcd(abs(b),abs(2*a));
				if((b<0 and a<0) or (b>0 and a>0)) cout << abs(b)/gc << "/" << abs(2*a)/gc;
				else cout << "-" << abs(b)/gc << "/" << abs(2*a)/gc;
			}
		}
		if(deta>0 and sqrt(deta)!=int(sqrt(deta))){
			if(b!=0)cout << "+";
			int u=0;
			for(int i=sqrt(deta);i>=1;i--){
				if(deta%(i*i)==0){
					u=i;
					deta/=(i*i);
					break;
				}
			}
			if(u<0) u=-u;
			if(a<0) a=-a;
			int gc=__gcd(abs(u),abs(2*a)); 
			if(u==2*a) cout << "sqrt(" << deta << ")";
			else if(u%(2*a)==0) cout << u/(2*a) << "*" << "sqrt(" << deta << ")";
			else if(u/gc==1) cout << "sqrt(" << deta << ")/" << 2*a/gc;
			else cout << u/gc << "*" << "sqrt(" << deta << ")/" << 2*a/gc;
		}
		cout << "\n";
	}
	return 0;
}