c how to program课后习题 16

//MyTime.h 16.4
class Time{
    public:
    Time(int ph,int ps,int pm){
        h=ph;
        s=ps;
        m=pm;
    }
    Time(Time &tt){
        h=tt.h;
        s=tt.s;
        m=tt.m;
    }
    private:
    int h,s,m;
}

//Rational类实现16.6
#include<iostream>
#include<cmath>
using namespace std;
//Rational.h
inline int decomplex(int &a,int &b){
    a/=gcd(a,b);
    b/=gcd(a,b);
}
inline int gcd(int a,int b){
    int temp=0;
    if(a<b)
        reverse(a,b);
    while(a%b){
        a%=b;
        reverse(a,b);
    }
    return b;
}
inline reverse(int &a,int &b){
    int temp=0;
    temp=a;
    a=b;
    b=temp;
}
//外部函数完成
class Rational
{

    public:
        Rational operator + (const Rational&r){
            Rational tmp;
            tep=r;
            tep.numerator=r.denominator*numerator+r.numerator*denominator;
            tep.denominator=r.denominator*denominator;
            decomplex(tep.numerator,tep.denominator);
            return tep;
        }
        Rational(int 1,int 1);
        Rational(Rational  &r){
            numerator=r.numerator;
            denominator=r.denominator;
            cout<<"call the conver fun"<<endl;
        }
        void setrat(int num,int deno){
            numerator=num;
            denominator=deno;
        }
        void display(){
            cout<<setw(3)<<numerator<<'/'<<setw(3)<<denominator<<endl;
        }
    private:
        int numerator;
        int denominator;
}
//
#include "Rational.h"
using namespace std;
Rational::Rational(int num,int deno){
    setrat(num,deno);
}
//gcd实现之二
int gcd(int m,int n)
{
    if (m < n)
    {
        int tmp = m;
        m = n;
        n = tmp;
    }
    if (n == 0)
        return m;
    else
        return gcd(n,m % n);
}