30分求调

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

inline int gcd(int x, int y);
void solve(int a, int b, int c); 
int f1(int x);


int a,b,c;
int main()
{
	//freopen("uqe2.in","r",stdin);  
	cin>>T;cin>>a;
	while(T--)
	{
		cin>>a>>b>>c;
		solve(a,b,c);
	}
	return 0;
}

void solve(int a, int b, int c)
{
	if(b==0 and c==0){cout<<"0\n";return;}; 
	if(a<0) a=-a,b=-b,c=-c;
	int delta=b*b-4*a*c;
	if(delta<0){cout<<"NO\n";return;}
	
	int check=sqrt(delta);
	
	if(check*check==delta)b-=check,delta=0; 
	int g=gcd(2*a,b);
	if(b!=0)
	{
		if(g==2*a)cout<<-b/g;
		else cout<<-b/g<<"/"<<2*a/g;
	}
	
	if(delta!=0)
	{
		if(b!=0)cout<<"+";
		int f=f1(delta);
		a*=2;
		int g=1;
		if(f!=1)
		{
			g=gcd(f,a);
			f/=g;
			a/=g;
		}
		if(f!=1)cout<<f<<"*";
		if(a!=1)cout<<"sqrt("<<(delta/f/f/g/g)<<")/"<<a;
		else cout<<"sqrt("<<(delta/f/f/g/g)<<")";
		//cout<<f;
	}
	cout<<"\n";
}

int gcd(int x, int y)
{
	if(x<0)x=-x;
	if(y<0)y=-y;
	if(x<y)swap(x,y);
	if(y==0) return x;
	return gcd(y,x%y);
}

int f1(int x)
{
	for(int i=ceil(sqrt(x));i>=1;i--)
	{
		if(x%(i*i)==0) return i;
	}
	return 1;
}