国产探花免费观看_亚洲丰满少妇自慰呻吟_97日韩有码在线_资源在线日韩欧美_一区二区精品毛片,辰东完美世界有声小说,欢乐颂第一季,yy玄幻小说排行榜完本

首頁 > 學院 > 開發設計 > 正文

1088. Rational Arithmetic (20)-細節很多,要注意

2019-11-11 03:10:24
字體:
來源:轉載
供稿:網友

For two rational numbers, your task is to implement the basic arithmetics, that is, to calculate their sum, difference, PRoduct and quotient.

Input Specification:

Each input file contains one test case, which gives in one line the two rational numbers in the format “a1/b1 a2/b2”. The numerators and the denominators are all in the range of long int. If there is a negative sign, it must appear only in front of the numerator. The denominators are guaranteed to be non-zero numbers.

Output Specification:

For each test case, print in 4 lines the sum, difference, product and quotient of the two rational numbers, respectively. The format of each line is “number1 Operator number2 = result”. Notice that all the rational numbers must be in their simplest form “k a/b”, where k is the integer part, and a/b is the simplest fraction part. If the number is negative, it must be included in a pair of parentheses. If the denominator in the division is zero, output “Inf” as the result. It is guaranteed that all the output integers are in the range of long int.

Sample Input 1: 2/3 -4/2 Sample Output 1: 2/3 + (-2) = (-1 1/3) 2/3 - (-2) = 2 2/3 2/3 * (-2) = (-1 1/3) 2/3 / (-2) = (-1/3) Sample Input 2: 5/3 0/6 Sample Output 2: 1 2/3 + 0 = 1 2/3 1 2/3 - 0 = 1 2/3 1 2/3 * 0 = 0 1 2/3 / 0 = Inf

#include<cstdio>#include<algorithm>using namespace std;typedef long long ll;struct Fraction{ ll up,down;}; ll gcd(ll a,ll b){ if(b==0) return a; else return gcd(b,a%b) ;}Fraction reduction(Fraction result){ if(result.down<0){ result.up*=(-1); result.down*=(-1); } 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 a,Fraction b){ Fraction sum; sum.up=a.up*b.down+b.up*a.down; sum.down=a.down*b.down; return reduction(sum);}Fraction minu(Fraction a,Fraction b){ Fraction dif; dif.up=a.up*b.down-b.up*a.down; dif.down=a.down*b.down; return reduction(dif);}Fraction multi(Fraction a,Fraction b){ Fraction pro; pro.up=a.up*b.up; pro.down=a.down*b.down; return reduction(pro);}Fraction divide(Fraction a,Fraction b){ Fraction quo; quo.up=a.up*b.down; quo.down=a.down*b.up; return reduction(quo);}void showResult(Fraction r){ r=reduction(r); if(r.up<0) printf("("); if(r.down==1) printf("%lld",r.up); else if(abs(r.up)>r.down){ printf("%lld %lld/%lld",r.up/r.down,abs(r.up%r.down),r.down); }else{ printf("%lld/%lld",r.up,r.down); } if(r.up<0) printf(")");}int main(){ Fraction a,b; scanf("%lld/%lld %lld/%lld",&a.up,&a.down,&b.up,&b.down); showResult(a); printf(" + "); showResult(b); printf(" = "); showResult(add(a,b)); printf("/n"); showResult(a); printf(" - "); showResult(b); printf(" = "); showResult(minu(a,b)); printf("/n"); showResult(a); printf(" * "); showResult(b); printf(" = "); showResult(multi(a,b)); printf("/n"); showResult(a); printf(" / "); showResult(b); printf(" = "); if(b.up==0) printf("Inf"); else showResult(divide(a,b)); printf("/n"); return 0;}
發表評論 共有條評論
用戶名: 密碼:
驗證碼: 匿名發表
主站蜘蛛池模板: 濮阳市| 新津县| 丹阳市| 延吉市| 海丰县| 克山县| 内丘县| 安吉县| 道孚县| 海盐县| 汉源县| 卢龙县| 清水河县| 鞍山市| 五原县| 中卫市| 裕民县| 安图县| 石河子市| 安徽省| 石渠县| 高台县| 嫩江县| 资中县| 乐东| 门头沟区| 阜南县| 霞浦县| 嫩江县| 株洲市| 安阳市| 绥化市| 会东县| 胶州市| 包头市| 台北市| 勃利县| 策勒县| 图木舒克市| 寿宁县| 吴桥县|