https://ac.nowcoder.com/acm/contest/322/L

题解：很简单吧？？？

/*
*@Author:   STZG
*@Language: C++
*/
#include <bits/stdc++.h>
#include<iostream>
#include<algorithm>
#include<cstdlib>
#include<cstring>
#include<cstdio>
#include<string>
#include<vector>
#include<bitset>
#include<queue>
#include<deque>
#include<stack>
#include<cmath>
#include<list>
#include<map>
#include<set>
//#define DEBUG
#define RI register int
using namespace std;
typedef long long ll;
//typedef __int128 lll;
const int N=100000+10;
const int MOD=1e9+7;
const double PI = acos(-1.0);
const double EXP = 1E-8;
const int INF = 0x3f3f3f3f;
int t,n,m,k,q,ans;
int op,a,b,c,d;
char str;
int main()
{
#ifdef DEBUG
	freopen("input.in", "r", stdin);
	//freopen("output.out", "w", stdout);
#endif
    scanf("%d",&t);
    while(t--){
        scanf("%d%d%d%d%d",&op,&a,&b,&c,&d);
        if(op){
            n=a*d+b*c;
            m=b*d;
        }else{
            n=a*d-b*c;
            m=b*d;
        }
        if(!n){
            cout << 0<<"/"<<1 << endl;
            continue;
        }
        int x=abs(n);
        int y=abs(m);
        if(x<y)
            swap(x,y);
        int r=1;
        while(r){
            r=x%y;
            x=y;
            y=r;
        }
        cout << n/x<<"/"<<m/x << endl;
    }
    //cout << "Hello world!" << endl;
    return 0;
}