[转]PAT甲级练习1081. Rational Sum (20)
来源:互联网 发布:seo sem 区别 编辑:程序博客网 时间:2024/04/27 17:45
1081. Rational Sum (20)
Given N rational numbers in the form "numerator/denominator", you are supposed to calculate their sum.
Input Specification:
Each input file contains one test case. Each case starts with a positive integer N (<=100), followed in the next line N rational numbers "a1/b1 a2/b2 ..." where all the numerators and denominators are in the range of "long int". If there is a negative number, then the sign must appear in front of the numerator.
Output Specification:
For each test case, output the sum in the simplest form "integer numerator/denominator" where "integer" is the integer part of the sum, "numerator" < "denominator", and the numerator and the denominator have no common factor. You must output only the fractional part if the integer part is 0.
Sample Input 1:52/5 4/15 1/30 -2/60 8/3Sample Output 1:
3 1/3Sample Input 2:
24/3 2/3Sample Output 2:
2Sample Input 3:
31/3 -1/6 1/8Sample Output 3:
7/24
分析:先根据分数加法的公式累加,后分离出整数部分和分数部分。
分子和分母都在长整型内,所以不能用int存储,否则有一个测试点不通过。
一开始一直是浮点错误,按理来说应该是出现了/0或者%0的情况,找了半天也不知道错在哪里。
后来注意到应该在累加的时候考虑是否会超出long long的范围,所以在累加每一步之前进行分子分母的约分处理,然后就AC了。
以及:abs()在stdlib.h头文件里面。
应该还要考虑整数和小数部分都为0时候输出0的情况,但是测试用例中不涉及,所以如果没有最后两句也是可以AC的。
#include <cstdio>#include <cstdlib>using namespace std;long long gcd(long long a, long long b) {return b == 0 ? abs(a) : gcd(b, a % b);}int main() { long long n, a, b, suma = 0, sumb = 1, gcdvalue; scanf("%lld", &n); for(int i = 0; i < n; i++) { scanf("%lld/%lld", &a, &b); gcdvalue = gcd(a, b); a = a / gcdvalue; b = b / gcdvalue; suma = a * sumb + suma * b; sumb = b * sumb; gcdvalue = gcd(suma, sumb); sumb = sumb / gcdvalue; suma = suma / gcdvalue; } long long integer = suma / sumb; suma = suma - (sumb * integer); if(integer != 0) { printf("%lld", integer); if(suma != 0) printf(" "); } if(suma != 0) printf("%lld/%lld", suma, sumb); if(integer == 0 && suma == 0) printf("0"); return 0;}
- [转]PAT甲级练习1081. Rational Sum (20)
- 1081. Rational Sum (20) PAT甲级
- 1081. Rational Sum (20)-PAT甲级
- PAT 甲级 1081. Rational Sum (20)
- 1081. Rational Sum (20)-PAT甲级真题
- [转]PAT甲级练习1088. Rational Arithmetic (20)
- PAT 1081. Rational Sum (20)
- PAT 1081. Rational Sum (20)
- PAT 1081. Rational Sum(20)
- 【PAT】1081. Rational Sum (20)
- PAT 1081. Rational Sum (20)
- PAT 1081. Rational Sum (20)
- 【PAT】1081. Rational Sum (20)
- PAT 1081. Rational Sum (20)
- PAT 1081. Rational Sum (20)
- 1081. Rational Sum (20) PAT
- PAT 1081. Rational Sum
- 【PAT】1081. Rational Sum
- 自定义ViewGroup可折叠控件,类似CoordinatorLayout的效果
- 【JAVA之多线程】3.线程同步
- 异常分类
- 如何区分[]与{}
- 2D游戏平滑的迷雾战争效果
- [转]PAT甲级练习1081. Rational Sum (20)
- HTML5的优点
- repeat和tile扩充数组
- 一个爬取沪深两市融资融券标的融资融券交易数据的小爬虫
- [Spark]Spark Streaming 指南二 初始化StreamingContext
- App Launch Time Measurement
- UVa 10815 Andy's First Dictionary 【set】【字典序】
- 给mysql授权多个数据库权限
- jQuery选择器