#include <iostream>
#include <cstdio>
#include <string>
#include <cstring>
#include <algorithm>
using namespace std;
const int Maxn = 2020;
struct Fraction //分数结构体
{
int up,down;
};
int gcd(int a,int b) //最大公约数模板
{
if(b == 0) return a;
else return gcd(b,a%b);
}
int lcm(int a,int b) //最小公倍数模板
{
int d = gcd(a,b); //得到最大公约数d
return a * b / d; // 也可以通过(a / d * b)防止溢出
}
Fraction reduction(Fraction f)
{
if(f.down < 0) //如果分母为负数就让分子分母变成其相反数,保证格式统一
{
f.down = - f.down;
f.up = - f.up;
}
if(f.up == 0)
{
f.down = 1; //如果分子为0就让分母为1
}
else
{
int d = gcd(abs(f.up),abs(f.down)); //约分
f.up /= d;
f.down /= d;
}
return f;
}
Fraction add(Fraction f1,Fraction f2) //加法
{
Fraction f;
f.up = f1.up * f2.down + f1.down * f2.up;
f.down = f1.down * f2.down;
return reduction(f);
}
Fraction sub(Fraction f1,Fraction f2) //减法
{
Fraction f;
f.up = f1.up * f2.down - f1.down * f2.up;
f.down = f1.down * f2.down;
return reduction(f);
}
Fraction mul(Fraction f1,Fraction f2) //乘法
{
Fraction f;
f.up = f1.up * f2.up;
f.down = f1.down * f2.down;
return reduction(f);
}
Fraction div(Fraction f1,Fraction f2) //除法,除数f2不能为零!f2.up != 0
{
Fraction f;
f.up = f1.up * f2.down;
f.down = f1.down * f2.up;
return reduction(f);
}
int main()
{
freopen("1.txt","r",stdin);
int a,b,c;
cin>>a>>b;
c = gcd(a,b);
cout<<c;
return 0;
}
最大公约数、最小公倍数和分数四则运算模板
猜你喜欢
转载自blog.csdn.net/qq_15556537/article/details/104084769
今日推荐
周排行