这种题ez了已经,开局直接写函数:
struct f,clean,print,运算
问题:
1.clean函数调用gcd的时候一定要先赋值给一个数。
2.%lld
ac代码:
#include<stdio.h>
#include<iostream>
#include<algorithm>
using namespace std;
struct f{
long long up,down;
}ans,b[100];
long long gcd(long long a,long long b){
if(b==0) return a;
else return gcd(b,a%b);
}
f clean(f a){
if(a.down<0){
a.down=-a.down;
a.up=-a.up;
}
if(a.up==0){
a.down=1;
}
else{
int k=gcd(abs(a.up),abs(a.down));
a.up/=k;
a.down/=k;
}
return a;
}
void prin(f a){
if(a.down==0){
printf("Inf");
}
else if(a.down==1){
printf("%lld",a.up);
}
else if(abs(a.up)>abs(a.down)&&a.up<0){
printf("%lld %lld/%lld",a.up/a.down,-a.up%a.down,a.down);
}
else if(abs(a.up)>abs(a.down)){
printf("%lld %lld/%lld",a.up/a.down,a.up%a.down,a.down);
}
else{
printf("%lld/%lld",a.up,a.down);
}
}
f pl(f a,f b){
f c;
c.up=a.up*b.down+b.up*a.down;
c.down=a.down*b.down;
c=clean(c);
//printf("%lld %lld \n",c.up,c.down);
return(c);
}
int main(){
int n;
scanf("%d",&n);
for(int i=0;i<n;i++){
scanf("%lld/%lld",&b[i].up,&b[i].down);
}
ans.up=0;
ans.down=1;
for(int i=0;i<n;i++){
ans=pl(ans,b[i]);
}
prin(ans);
return 0;
}