实验11：Problem C: 分数类的乘法

#include<iostream>
using namespace std;
int cccc(int a,int b){
    if(!b)
        return a;
    return cccc(b,a%b);
}

class Fract{
public:
    int n,m;
    Fract(int a,int b):n(a),m(b)
    {
        int Max,Min,c,x,y;
        if(a<0) a*=-1;
        if(b<0) b*=-1;
        c=cccc(max(a,b),min(a,b));

        if(m<0)
        {
            n*=-1;
            m*=-1;
        }
        if(c!=1)
        {
            n/=c;
            m/=c;
        }
    }
    void show()
    {

        if(n==0||m==1)
            cout<<n<<endl;
        else
        {
            cout<<n<<"/"<<m<<endl;
        }
    }
    /*operator double()
    {
        return (double)n/m;
    }*/

};
Fract operator *(Fract f1,Fract f2)
    {
        Fract f(f1.n*f2.n,f1.m*f2.m);
        ///f.n=f1.n*f2.n;
        ///f.m=f1.m*f2.m;
        return f;
    }

int main()
{
    int n, m, p, q;
    while(cin >> n >> m >> q >> p)
    {
        Fract f1(n, m), f2(q, p);
        Fract fr = f1 * f2;
        fr.show();
    }
}