#include <iostream>
#include <cstdio>
#include <cstring>
#include <string>
#include <cstdlib>
#include <cmath>
#include <vector>
#include <list>
#include <deque>
#include <queue>
#include <iterator>
#include <stack>
#include <map>
#include <set>
#include <algorithm>
#include <cctype>
using namespace std;
#define si1(a) scanf("%d",&a)
#define si2(a,b) scanf("%d%d",&a,&b)
#define sd1(a) scanf("%lf",&a)
#define sd2(a,b) scanf("%lf%lf",&a,&b)
#define ss1(s) scanf("%s",s)
#define pi1(a) printf("%d\n",a)
#define pi2(a,b) printf("%d %d\n",a,b)
#define mset(a,b) memset(a,b,sizeof(a))
#define forb(i,a,b) for(int i=a;i<b;i++)
#define ford(i,a,b) for(int i=a;i<=b;i++)
typedef long long LL;
const int N=1100001;
const int M=6666666;
const int INF=0x3f3f3f3f;
const double PI=acos(-1.0);
const double eps=1e-7;
char s[16];
int gcd(int a,int b)
{
return b==0?a:gcd(b,a%b);
}
int main()
{
int a,b,c,d;
while(~scanf("%s",s))
{
int flag=0;
if(s[0]!='-')
{
a=s[0]-'0';
b=s[2]-'0';
c=s[4]-'0';
d=s[6]-'0';
}
else
{
a=s[1]-'0';
a=-a;
b=s[3]-'0';
c=s[5]-'0';
d=s[7]-'0';
}
if(s[3]=='-'||s[4]=='-')
c=-c;
//printf("%d %d %d %d\n",a,b,c,d);
int num;
if(b<d)
{
num=gcd(d,b);
}
else
num=gcd(b,d);
int fenzi=a*(d/num)+c*(b/num);
int fenmu=b*(d/num);
//printf("%d %d\n",fenzi,fenmu);
if(fenzi<0)
{
flag=1;
fenzi=-fenzi;
}
if(fenmu>fenzi)
num=gcd(fenmu,fenzi);
if(fenzi == fenmu)
{
if(fenzi==0)
printf("0\n");
else if(flag)
printf("-1\n");
else printf("1\n");
continue;
}
if(fenzi==0)
{
printf("0\n");
continue;
}
if(fenzi>fenmu)
{
num=gcd(fenzi,fenmu);
}
if(!flag)
{
if(fenmu/num==1)
printf("%d\n",fenzi/num);
else
printf("%d/%d\n",fenzi/num,fenmu/num);
}
else
{
if(fenmu/num==1)
printf("-%d\n",fenzi/num);
else
printf("-%d/%d\n",fenzi/num,fenmu/num);
}
}
}
poj 3979
最新推荐文章于 2020-09-30 06:52:56 发布