對分數求加減乘除，以及化簡

#include<iostream>
#include<math.h>
using namespace std;
struct Fraction{
    long  up,down;
};
//求分子分母的最大公約數
int gcb(int a,int b)
{
    if(b==0)
        return a;
    else
        return gcb(b,a%b);
}
//化簡
Fraction reduction(Fraction &result)
{
    if(result.down < 0)  //分母為負
    {
        result.down = -result.down;
        result.up = - result.up;
    }
    else if(result.up == 0)  //分母為0
        result.down = 1;
    else
    {
        int x = gcb(abs(result.up),abs(result.down));  //分子分母同時除最大公約數
        result.up /= x;
        result.down /= x;
    }
    return result;
}
//加法
Fraction Add(Fraction a,Fraction b)
{
    Fraction c;
    c.up = a.up * b.down + a.down * b.up;
    c.down = a.down * b.down;
    return reduction(c);
}
//減法
Fraction minu(Fraction a,Fraction b)
{
    Fraction c;
    c.up = a.up * b.down - a.down * b.up;
    c.down = a.down * b.down;
    return reduction(c);
}
//乘法
Fraction multi(Fraction a,Fraction b)
{
    Fraction c;
    c.up = a.up * b.up;
    c.down = a.down * b.down;
    return reduction(c);
}
//除法
Fraction divide(Fraction a,Fraction b)
{
    Fraction c;
    c.up = a.up * b.down;
    c.down = a.down * b.up;
    return reduction(c);
}
void showresult(Fraction result)
{
    if(result.down == 1)
        cout<<result.up<<endl;
    else if(abs(result.up)>abs(result.down))
        cout<<result.up /result.down <<" "<<abs(result.up % result.down)<<"/"<<result.down<<endl;
    else
        cout<<result.up<<"/"<<result.down<<endl;
}
int main()
{
    Fraction f1,f2;
    while(cin>>f1.up>>f1.down>>f2.up>>f2.down)
    {
        showresult(Add(f1,f2));
        showresult(minu(f1,f2));
        showresult(multi(f1,f2));
        showresult(divide(f1,f2));
    }
    return 0;
}

總結

以上是生活随笔為你收集整理的C++ 实现分数的四则运算的全部內容，希望文章能夠幫你解決所遇到的問題。

如果覺得生活随笔網站內容還不錯，歡迎將生活随笔推薦給好友。