/*** * ___====-_ _-====___ * _--^^^#####// \\#####^^^--_ * _-^##########// ( ) \\##########^-_ * -############// |\^^/| \\############- * _/############// (@::@) \\############\_ * /#############(( \\// ))#############\ * -###############\\ (oo) //###############- * -#################\\ / VV \ //#################- * -###################\\/ \//###################- * _#/|##########/\######( /\ )######/\##########|\#_ * |/ |#/\#/\#/\/ \#/\##\ | | /##/\#/ \/\#/\#/\#| \| * ` |/ V V ` V \#\| | | |/#/ V ' V V \| ' * ` ` ` ` / | | | | \ ' ' ' ' * ( | | | | ) * __\ | | | | /__ * (vvv(VVV)(VVV)vvv) * 神兽保佑 * 代码无BUG! ***/ #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #define pf printf #define INF 0x3f3f3f3f #define scc(x) scanf("%c",&x); #define scd(x) scanf("%d", &x) #define scs(x) scanf("%s", x) #define scf(x) scanf("%lf", &x) #define scl(x) scanf("%lld", &x) #define mem(a,x) memset(a, x, sizeof(a)) #define rep(i,s,e) for(ll i = s; i < e; i++) #define dep(i,e,s) for(ll i = e; i >= s; i--) #define rush() int T;scanf("%d",&T);while(T--) using namespace std; typedef long long ll; const double PI = acos(-1.0); const int MAXN = 4000 + 10; const int mod = 998244353; const int inf=1e9+7; const int mo=1e9+7; const int N=1e6+10; int i,j,k,n,m,ans; int a[MAXN],b[MAXN]; int main() { int t; scanf("%d",&t); while(t--) { scanf("%d",&n); int maxx1=-1,maxx2=-1; int num1,num2; for(i=0;i=0;i--) { if(a[i]!=0) { maxx1=i; num1=a[i]; break; } } for(i=n-1;i>=0;i--) { if(b[i]!=0) { maxx2=i; num2=b[i]; break; } } if(maxx1>maxx2) printf("1/0\n"); else if(maxx1==maxx2) { int sa=__gcd(num1,num2); printf("%d/%d\n",num1/sa,num2/sa); } else printf("0/1\n"); } }