分数四则运算
Time Limit: 1000MS
Memory Limit: 65536KB
Problem Description
编写程序,实现两个分数的加减法
Input
输入包含多行数据;
每行数据是一个字符串,格式是"a/boc/d",其中a, b, c, d为数字(每个数字保证为正数并且不存在正号)。o是运算符"+"或者"-","*","\"。
数据以EOF结束,输入数据保证合法。
Output
直接输出结果,并且注意结果应符合书写习惯,没有多余的符号、分子、分母,并且化简至最简分数形式。
Example Input
1/100+3/100 1/4-1/2 1/3-1/3 1/2*2/1 1/2\1/2
Example Output
1/25 -1/4 0 1 1
Hint
Author
import java.util.*;
public class Main {
public static void main(String[] args) {
Scanner input = new Scanner(System.in);
while(input.hasNext())
{
String ch = input.next();
char[] sc = ch.toCharArray();
int g=0,a,b,c,d,f = 0;
for(int i=0;i<sc.length;i++)
{
if(sc[i]=='+')
{
g = i;
f = 1;
break;
}
else if(sc[i]=='-')
{
g = i;
f = 2;
break;
}
else if(sc[i]=='*')
{
g = i;
f = 3;
break;
}
else if(sc[i]=='\\')
{
g = i;
f = 4;
break;
}
}
String s1 = ch.substring(0,g);
String s2 = ch.substring(g+1,ch.length());
String p[] = s1.split("\\/");
String q[] = s2.split("\\/");
a = Integer.parseInt(p[0]);
b = Integer.parseInt(p[1]);
c = Integer.parseInt(q[0]);
d = Integer.parseInt(q[1]);
Fs fs1 = new Fs(a,b);
Fs fs2 = new Fs(c,d);
Fs result = new Fs();
if(f==1)
{
result = fs1.add(fs2);
}
else if(f==2)
{
result = fs1.su(fs2);
}
else if(f==3)
{
result = fs1.mul(fs2);
}
else if(f==4)
{
result = fs1.avl(fs2);
}
if((result.fz%result.fm)==0)
System.out.println(result.fz/result.fm);
else System.out.println(result.fz+"/"+result.fm);
}
}
}
class Fs {
int fz;
int fm;
Fs(int a,int b)
{
this.fz = a;
this.fm = b;
}
Fs()
{
}
public Fs add(Fs fs)
{
int newfz = fz*fs.fm+fm*fs.fz;
int newfm = fm*fs.fm;
int gys = gys(newfz,newfm);
return new Fs(newfz/gys,newfm/gys);
}
public Fs su(Fs fs)
{
int newfz = fz*fs.fm-fs.fz*fm;
int newfm = fm*fs.fm;
int gys = gys(newfz,newfm);
return new Fs(newfz/gys,newfm/gys);
}
public Fs mul(Fs fs)
{
int newfz = fz*fs.fz;
int newfm = fm*fs.fm;
int gys = gys(newfz,newfm);
return new Fs(newfz/gys,newfm/gys);
}
public Fs avl(Fs fs)
{
int newfz = fz*fs.fm;
int newfm = fm*fs.fz;
int gys = gys(newfz,newfm);
return new Fs(newfz/gys,newfm/gys);
}
public int gys(int m,int n)
{
int max = Math.max(Math.abs(m),Math.abs(n) );
int min = Math.min(Math.abs(m),Math.abs(n));
int r;
while(min!=0)
{
r = max%min;
max = min;
min = r;
}
return max;
}
}