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

首頁(yè) > 學(xué)院 > 開(kāi)發(fā)設(shè)計(jì) > 正文

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

2019-11-11 03:29:13
字體:
來(lái)源:轉(zhuǎn)載
供稿:網(wǎng)友

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;}
發(fā)表評(píng)論 共有條評(píng)論
用戶(hù)名: 密碼:
驗(yàn)證碼: 匿名發(fā)表
主站蜘蛛池模板: 建瓯市| 嘉禾县| 正镶白旗| 固安县| 利津县| 石门县| 邵阳市| 三亚市| 山阴县| 霍山县| 建德市| 铜山县| 泰安市| 保德县| 观塘区| 崇左市| 威宁| 仙居县| 麻栗坡县| 齐河县| 金川县| 栾城县| 建宁县| 钦州市| 巩义市| 饶平县| 雅安市| 绥宁县| 利辛县| 海原县| 桃江县| 双江| 平潭县| 甘肃省| 韶山市| 延安市| 枞阳县| 吉木萨尔县| 仙游县| 巨鹿县| 普洱|