PAT(甲级)1088
来源:互联网 发布:女神威捏脸数据 编辑:程序博客网 时间:2024/06/06 11:05
1088. Rational Arithmetic (20)
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/2Sample Output 1:
2/3 + (-2) = (-1 1/3)2/3 - (-2) = 2 2/32/3 * (-2) = (-1 1/3)2/3 / (-2) = (-1/3)Sample Input 2:
5/3 0/6Sample Output 2:
1 2/3 + 0 = 1 2/31 2/3 - 0 = 1 2/31 2/3 * 0 = 01 2/3 / 0 = Inf
#include <iostream>using namespace std;/////////////////////////////////////////////////////where is the bug?????????????????////MD numerator is long type, but when scanf("%d.......FUCKKKKK!//FUCK!!! IT SAID THE DENOMINATOR OF INPUT DATA IS NON-ZERO,BUT IT ATE ITS WORDS!!!!////////////////////////////////////////////////long long mygcd(long long a,long long b){if(a < 0) a = -a;if(a < b){ //long long tmp =b;b=a;a= tmp;}long long tmp = b%a;while(tmp){b= a;a= tmp;tmp = b%a;}return a;}void display(long long a,long long b){ //this function is correct!! if(b == 0 ) cout <<"Inf";else if(b == 1 ){ //integerif(a >=0) cout <<a;else{cout <<"(" <<a <<")";}}else if(a <0){ //negtivecout <<"(";if(-a > b){cout <<a/b <<' ' <<-a%b <<'/' <<b <<")";}else cout <<a <<'/' <<b <<")"; }else{ //possitiveif(a > b ) cout <<a/b <<' ';cout <<a%b <<'/' <<b;}return ;}void add(long long numerator1,long long denominator1,long long numerator2,long long denominator2){display(numerator1,denominator1);cout <<" + ";display(numerator2,denominator2);cout <<" = ";numerator1= numerator1*denominator2+numerator2*denominator1;denominator1 = denominator1*denominator2;if(numerator1 !=0){ long long factor = mygcd(numerator1,denominator1); numerator1 /=factor; denominator1 /=factor;}else //the result is zero denominator1 =1;display(numerator1,denominator1);cout <<endl;}void sub(long long numerator1,long long denominator1,long long numerator2,long long denominator2){display(numerator1,denominator1);cout <<" - ";display(numerator2,denominator2);cout <<" = ";numerator1= numerator1*denominator2-numerator2*denominator1;denominator1 = denominator1*denominator2;if(numerator1 !=0){ long long factor = mygcd(numerator1,denominator1); numerator1 /=factor; denominator1 /=factor;}else //the result is zero denominator1 =1;display(numerator1,denominator1);cout <<endl;}void mul(long long numerator1,long long denominator1,long long numerator2,long long denominator2){display(numerator1,denominator1);cout <<" * ";display(numerator2,denominator2);cout <<" = ";numerator1= numerator1*numerator2;denominator1 = denominator1*denominator2;if(numerator1 !=0){ long long factor = mygcd(numerator1,denominator1); numerator1 /=factor; denominator1 /=factor;}else //the result is zero denominator1 =1;display(numerator1,denominator1);cout <<endl;}void did(long long numerator1,long long denominator1,long long numerator2,long long denominator2){display(numerator1,denominator1);cout <<" / ";display(numerator2,denominator2);cout <<" = ";numerator1= numerator1*denominator2;denominator1 = denominator1*numerator2;if(numerator1 !=0 && denominator1 !=0 ){ long long factor = mygcd(numerator1,denominator1); numerator1 /=factor; denominator1 /=factor; if(denominator1 < 0){ //make sure denominator is possitive denominator1 =-denominator1; numerator1 =-numerator1;}}else if(numerator1 == 0 && denominator1 != 0) denominator1 =1;display(numerator1,denominator1);cout <<endl;}int main(){long long numerator,numerator1,numerator2;long long denominator,denominator1,denominator2;scanf("%lld/%lld %lld/%lld",&numerator1,&denominator1,&numerator2,&denominator2);if(numerator1 !=0 && denominator!= 0 ){long long factor = mygcd(numerator1,denominator1);numerator1 /=factor;denominator1 /=factor;}else if(numerator1 == 0&& denominator1 !=0) denominator1 = 1;if(numerator2 != 0 &&denominator2 !=0){long long factor = mygcd(numerator2,denominator2);numerator2 /=factor;denominator2 /=factor;}else if(numerator2==0 &&denominator2 !=0) denominator2 =1;add(numerator1,denominator1,numerator2,denominator2);sub(numerator1,denominator1,numerator2,denominator2);mul(numerator1,denominator1,numerator2,denominator2);did(numerator1,denominator1,numerator2,denominator2);return 0;}
- PAT(甲级)1088
- 浙大PAT甲级 1088
- PAT甲级1088
- PAT 甲级
- PAT甲级 A1025.PAT RANKING
- PAT 甲级 1025 PAT Ranking
- PAT(甲级)1003
- PAT(甲级)1004
- PAT(甲级)1005
- PAT(甲级)1006
- PAT(甲级)1007
- PAT(甲级)1008
- PAT(甲级)1009
- PAT(甲级)1010
- PAT(甲级)1011
- PAT(甲级)1012
- PAT(甲级)1013
- PAT(甲级)1014
- 解决“The executable was signed with invalid entitlements.”问题
- Lisp学习笔记1--Win7下环境搭建
- 判断手机号格式是否正确(写于2015年,过期时间未知)
- 序列化实现对象的拷贝
- eBay RUM实践
- PAT(甲级)1088
- crontab 环境变量的使用方法
- ubuntu 重启命令,ubuntu 重启网卡方法
- U盘变成驱动盘,如何恢复
- springmvc和mybatis整合关键配置
- Magento设置所有用户订阅新闻代码
- csdn提问解答专区
- AngularJS 官方案例:angular-phonecat
- PCM与DSD究竟是什么??