1062 最简分数 (20 分)

#include

int GCD(int i, int K)
{
    return K==0 ? i : GCD(K, i%K);
}

int main()
{
    int N1, N2, M1, M2, K;
    int i, flag = 0, temp;
    scanf("%d/%d %d/%d %d", &N1, &M1, &N2, &M2, &K);

    if(N1*M2 > N2*M1)
    {
        temp = N1;
        N1 = N2;
        N2 = temp;

        temp = M1;
        M1 = M2;
        M2 = temp;
    }


    for(i=0; i