题目
思路
还是参考《算法笔记》的做法。没啥说的,分数的运算直接记吧。
一个函数用于化简(a. 分母不为负、b. 分子为0时分母为1(输出时,分母为1直接输出分子)、c. 求分子分母最大公约数约分)。
一个函数用于输出。
坑点是数据范围,做乘法时,两个整型相乘可能会导致溢出。
AC代码
#include<bits/stdc++.h>
using namespace std;
struct fraction{
long long up;
long long down;
};
int gcd(long long a,long long b){
if(b==0) return a;
else return gcd(b,a%b);
}
fraction reduction(fraction result){
if(result.down<0){ //化简条件1:分母为负,分子分母变号
result.up=-result.up;
result.down=-result.down;
}
if(result.up==0) result.down=1; //化简条件2:分子为0时,令分母为1 (0%1=0),方便输出时直接输出0.
else{
int d=gcd(abs(result.up),abs(result.down)); // 化简条件3:分子不为0,找分子分母最大公约数,化简。
result.up /= d;
result.down /=d;
}
return result;
}
fraction add(fraction a,fraction b){
fraction c;
c.up=a.up*b.down+b.up*a.down;
c.down=a.down*b.down;
return reduction(c);
}
fraction sub(fraction a,fraction b){
fraction c;
c.up=a.up*b.down-b.up*a.down;
c.down=a.down*b.down;
return reduction(c);
}
fraction mul(fraction a,fraction b){
fraction c;
c.up=a.up*b.up;
c.down=a.down*b.down;
return reduction(c);
}
fraction dev(fraction a,fraction b){
fraction c;
c.up=a.up*b.down;
c.down=a.down*b.up;
return reduction(c);
}
void print(fraction a){
fraction r=reduction(a);
if(r.up<0) cout<<'(';
if(r.down==1) cout<<r.up;//当分子为0时,化简函数已经令分母为1,可直接输出0
else if(abs(r.up)>r.down){
cout<<r.up/r.down<<' '<<abs(r.up)%r.down<<'/'<<r.down;
}
else cout<<r.up<<'/'<<r.down;
if(r.up<0) cout<<')';
}
int main(){
fraction a,b;
char c;
cin>>a.up>>c>>a.down>>b.up>>c>>b.down;
print(a); cout<<" + "; print(b); cout<<" = "; print(add(a,b)); cout<<endl;
print(a); cout<<" - "; print(b); cout<<" = "; print(sub(a,b)); cout<<endl;
print(a); cout<<" * "; print(b); cout<<" = "; print(mul(a,b)); cout<<endl;
print(a); cout<<" / "; print(b); cout<<" = ";
fraction result=dev(a,b);
if(result.down==0) cout<<"Inf";
else {
print(result);
}
cout<<endl;
}