PAT-A 1081,題目地址:https://www.patest.cn/contests/pat-a-practise/1081
這道題目不難帮毁,細(xì)心點(diǎn)別寫錯(cuò)就好忱叭。
思路:
- 每輸入一個(gè)分?jǐn)?shù),就往最終結(jié)果里加一個(gè)汁果,不過此時(shí)還不急著化為假分?jǐn)?shù)
- 等加完所有的數(shù),在統(tǒng)一約分,化為假分?jǐn)?shù)等等
注意:分?jǐn)?shù)相加一般都要使得分母相乘耕驰,為了防止100個(gè)分?jǐn)?shù)相加使得分母過大超出數(shù)據(jù)范圍,建議每次加完都約分一下录豺,但是結(jié)果不化為假分?jǐn)?shù)朦肘。代碼直接AC了,也不知道不進(jìn)行約分會(huì)不會(huì)有case出錯(cuò)
代碼如下:
#include <iostream>
using namespace std;
//計(jì)算出兩個(gè)數(shù)a,b的最大公約數(shù)
int max_factor(int a, int b){
a = a < 0 ? -a : a;
b = b < 0 ? -b : b;
if(a > b){
int temp = a;
a = b;
b = temp;
}
for(int i = a; i >= 2; i--){
if(i > 0 && a % i == 0 && b % i == 0){
return i;
}
}
return 1;
}
class Number{
public:
int integer; //整數(shù)部分
int numrator; //分子
int deno; //分母
Number(): integer(0), numrator(0), deno(1){}
Number(int a, int b, int c): integer(a), numrator(b), deno(c){}
//化為假分?jǐn)?shù)并約分
void change(){
integer = numrator / deno;
numrator %= deno;
int factor = max_factor(numrator, deno);
numrator /= factor;
deno /= factor;
}
//僅僅約分
void simple(){
int factor = max_factor(numrator, deno);
numrator /= factor;
deno /= factor;
}
};
//兩個(gè)分?jǐn)?shù)相加
Number add(const Number& a, const Number& b){
int deno = a.deno * b.deno;
int numrator = a.deno * b.numrator + a.numrator * b.deno;
if(deno < 0)
numrator = -numrator;
return Number(0, numrator, deno);
}
int main(){
int n;
scanf("%d", &n);
Number each;
Number all;
for(int i = 0; i < n; i++){
scanf("%d/%d", &each.numrator, &each.deno);
all = add(all, each); //輸入一個(gè)双饥,加一個(gè)
all.simple();
}
all.change();
if(all.integer == 0 && all.numrator == 0){
cout << "0" << endl;
}
else if(all.integer != 0 && all.numrator == 0){
cout << all.integer << endl;
}
else if(all.integer == 0 && all.numrator != 0){
cout << all.numrator << "/" << all.deno << endl;
}
else{
cout << all.integer << " " << all.numrator << "/" << all.deno << endl;
}
return 0;
}