Polynomial/FOpera.cpp at master · hopeful0/Polynomial · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
#include "DataStruct.h"

int gcd(int m,int n)
{
   int mc,mi,i;
   mc=m>n? m:n;
   mi=m<n? m:n;
   for(i=mi;i>0;i--)
   {
       if(mc%i==0&&mi%i==0)
         return i;
   }
}

//The four operations of fractions
fraction operator +(fraction& a, fraction& b)
{
    fraction c;
    int m,n,mc;
    m=a.n*b.d+a.d*b.n;
    n=a.d*b.d;
    mc=gcd(m,n);
    c.n=m/mc;
    c.d=n/mc;
    return c;
}

fraction operator -(fraction& a, fraction& b)
{
    fraction c;
    c.n=(a.n*b.d-b.n*a.d)/gcd((a.n*b.d- a.d*b.n), a.d*b.d);
    c.d=a.d*b.d/gcd((a.n*b.d- a.d*b.n), a.d*b.d);
    return c;
}

fraction operator *(fraction &a, fraction &b)
{
    fraction c;
    c.n=a.n*b.n/gcd(a.n*b.n ,a.d*b.d);
    c.d=a.d*b.d/gcd(a.n*b.n ,a.d*b.d);
    return c;
}

fraction operator /(fraction &a, fraction &b)
{
    fraction c;
    c.n=a.n*b.d/gcd(a.n*b.d ,a.d*b.n);
    c.d=a.d*b.n/gcd(a.n*b.d,a.d*b.n);
    return c;
}