#include <cstdio>
#include <cmath>
//分数的表示和化简
struct Fraction{
int up, down;
};
//求最大公约数
int gcd(int a, int b){
return !b ? a : gcd(b, a % b);
}
//分数的化简
Fraction reduction(Fraction result){
if(result.down < 0){
result.up = - result.up;
result.down = - result.down;
}
if(result.up == 0){
result.down = 1;
} else {
int d = gcd(abs(result.up), abs(result.down));
result.up /= d;
result.down /= d;
}
return result;
}
//分数的加法
Fraction add(Fraction f1, Fraction f2){
Fraction result;
result.up = f1.up * f2.down + f2.up * f1.down;
result.down = f1.down * f2.down;
return reduction(result);
}
//分数的减法
Fraction minu(Fraction f1, Fraction f2){
Fraction result;
result.up = f1.up * f2.down - f2.up * f1.down;
result.down = f1.down * f2.down;
return reduction(result);
}
//分数的乘法
Fraction multi(Fraction f1, Fraction f2){
Fraction result;
result.up = f1.up * f2.up;
result.down = f1.down * f2.down;
return reduction(result);
}
//分数的除法
Fraction divide(Fraction f1, Fraction f2){
Fraction result;
result.up = f1.up * f2.down;
result.down = f1.down * f2.up;
return reduction(result);
}
//分数的输出
Fraction showResult(Fraction r){
r = reduction(r);
if(r.down == 1) printf("%d", r.up);
else if(abs(r.up) > r.down){
printf("%d %d/%d", r.up / r.down, (int)abs(r.up) % r.down, r.down);
} else {
printf("%d/%d", r.up, r.down);
}
}
int main(){
return 0;
}
分数的四则运算
最新推荐文章于 2020-04-09 12:29:12 发布