【C++】分数运算

运算

小数结构体

struct CFractionsNumber{
    int molecular;
    int denominator;
};

基本运算

最大公约数
int __greatestCommonDivisor(int a, int b){
    int x = 0;
    if(a >= b){
        x = b;
    } else{
        x = a;
    };
    for (int i = x; i > 0; --i) {
        if( a%i == 0 && b%i == 0 ){
            return i;
        }
    }
    return 1;
}
最小公倍数
int __leastCommonMultiple(int a, int b) {
    int max = 0;
    int min = 0;
    if(a <= b){
        if (b%a == 0){
            return b;
        }
        max = b;
        min = a;
    } else{
        if (a%b == 0){
            return a;
        }
        max = a;
        min = b;
    };
    for (int i = 1; i <= min; ++i) {
        if (max*i%min == 0){
            return max*i;
        }
    }
}

小数运算

化简
CFractionsNumber Fractions::reductionFractionsNumbers() {
    int commonDivisor =  __greatestCommonDivisor(Number.denominator, Number.molecular);
    Number.molecular = Number.molecular/commonDivisor;
    Number.denominator = Number.denominator/commonDivisor;
    return Number;
}
CFractionsNumber Fractions::addFractionsNumbers(CFractionsNumber a, CFractionsNumber b) {
    int commonMultiple = __leastCommonMultiple(a.denominator, b.denominator);
    Number.denominator = commonMultiple;
    Number.molecular = (a.molecular*(commonMultiple/a.denominator)) + (b.molecular*(commonMultiple/b.denominator));
    this->reductionFractionsNumbers();
    return Number;
}
CFractionsNumber Fractions::minusFractionsNumbers(CFractionsNumber a, CFractionsNumber b) {
    int commonMultiple = __leastCommonMultiple(a.denominator, b.denominator);
    Number.denominator = commonMultiple;
    Number.molecular = (a.molecular*(commonMultiple/a.denominator)) - (b.molecular*(commonMultiple/b.denominator));
    this->reductionFractionsNumbers();
    return Number;
}
CFractionsNumber Fractions::multiplyFractionsNumbers(CFractionsNumber a, CFractionsNumber b) {
    Number.molecular = a.molecular * b.molecular;
    Number.denominator = a.denominator * b.denominator;
    this->reductionFractionsNumbers();
    return Number;
}
CFractionsNumber Fractions::divideFractionsNumbers(CFractionsNumber a, CFractionsNumber b) {
    Number.molecular = a.molecular * b.denominator;
    Number.denominator = a.denominator * b.molecular;
    this->reductionFractionsNumbers();
    return Number;
}
比较大小
int compareFractionsNumbers(CFractionsNumber a, CFractionsNumber b){
    int leastCommon = __leastCommonMultiple(a.denominator, b.denominator);
    if (a.molecular*(leastCommon/a.denominator) > b.molecular*(leastCommon/b.denominator)){
        return 1;
    } else if (a.molecular*(leastCommon/a.denominator) == b.molecular*(leastCommon/b.denominator)){
        return 0;
    }else if (a.molecular*(leastCommon/a.denominator) < b.molecular*(leastCommon/b.denominator)){
        return -1;
    }
}
  • 0
    点赞
  • 2
    收藏
    觉得还不错? 一键收藏
  • 1
    评论
以下是一个简单的分数四则运算C++ 代码,可以进行加、减、乘、除和比较运算: ```c++ #include <iostream> #include <cmath> using namespace std; class Fraction { private: int numerator; // 分子 int denominator; // 分母 public: Fraction(int n, int d) { numerator = n; denominator = d; } void reduce() { int gcd = __gcd(numerator, denominator); numerator /= gcd; denominator /= gcd; } Fraction operator+(const Fraction& other) { int n = numerator * other.denominator + other.numerator * denominator; int d = denominator * other.denominator; Fraction result(n, d); result.reduce(); return result; } Fraction operator-(const Fraction& other) { int n = numerator * other.denominator - other.numerator * denominator; int d = denominator * other.denominator; Fraction result(n, d); result.reduce(); return result; } Fraction operator*(const Fraction& other) { int n = numerator * other.numerator; int d = denominator * other.denominator; Fraction result(n, d); result.reduce(); return result; } Fraction operator/(const Fraction& other) { int n = numerator * other.denominator; int d = denominator * other.numerator; Fraction result(n, d); result.reduce(); return result; } bool operator<(const Fraction& other) { return numerator * other.denominator < other.numerator * denominator; } bool operator>(const Fraction& other) { return numerator * other.denominator > other.numerator * denominator; } void print() { cout << numerator << "/" << denominator << endl; } }; int main() { Fraction a(1, 2); Fraction b(3, 4); Fraction c = a + b; c.print(); c = a - b; c.print(); c = a * b; c.print(); c = a / b; c.print(); cout << (a < b) << endl; cout << (a > b) << endl; return 0; } ``` 注意,这个代码只是一个简单的示例,没有考虑到分数的负数、零、约分等情况。在实际应用中,需要根据具体情况进行修改和完善。
评论 1
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值