求最简分数

Problem Description

Input

Output

Sample Input

3
2/6
3/1
11/36

Sample Output

1/3
3/1
11/36

#include <iostream>

using namespace std;
int mgcd(int a,int b)
{

    int t;
    if(a<b)
    {

        t=a;a=b;b=t;
    }
    while(a%b)
    {
        t=b;
        b=a%b;
        a=t;
    }
    return b;
}

int main()
{
    int a,b,t;
    char ch;
    int count=0;
    int T;
    cin>>T;
    while(cin>>a>>ch>>b)
    {
        ++count;
        t=mgcd(a,b);
        a /= t;
        b /= t;
        cout<<a<<"/"<<b<<endl;
        if(count==T)
        {
            break;
        }
    }

    return 0;
}