分数模板

最新推荐文章于 2023-04-10 23:45:00 发布

QiHang_QiHang

最新推荐文章于 2023-04-10 23:45:00 发布

阅读量332

点赞数

分类专栏： ACM技巧

本文链接：https://blog.csdn.net/QiHang_QiHang/article/details/81583115

版权

ACM技巧专栏收录该内容

2 篇文章 0 订阅

订阅专栏

struct fraction {
	long long numerator; // 分子
	long long denominator; // 分母
	fraction() {
		numerator = 0;
		denominator = 1;
	}
	fraction(long long num) {
		numerator = num;
		denominator = 1;
	}
	fraction(long long a, long long b) {
		numerator = a;
		denominator = b;
		this->reduction();
	}
 
	void operator = (const long long num) {
		numerator = num;
		denominator = 1;
		this->reduction();
	}
 
	void operator = (const fraction &b) {
		numerator = b.numerator;
		denominator = b.denominator;
		this->reduction();
	}
 
	fraction operator + (const fraction &b) const {
		long long gcdnum = __gcd(denominator, b.denominator);
		fraction tmp = fraction(numerator*(b.denominator/gcdnum) + b.numerator*(denominator/gcdnum), denominator/gcdnum*b.denominator);
		tmp.reduction();
		return tmp;
	}
 
	fraction operator + (const int &b) const {
		return ((*this) + fraction(b));
	}
 
	fraction operator - (const fraction &b) const {
		return ((*this) + fraction(-b.numerator, b.denominator));
	}
 
	fraction operator - (const int &b) const {
		return ((*this) - fraction(b));
	}
 
	fraction operator * (const fraction &b) const {
		fraction tmp = fraction(numerator*b.numerator, denominator * b.denominator);
		tmp.reduction();
		return tmp;
	}
 
	fraction operator * (const int &b) const {
		return ((*this) * fraction(b));
	}
 
	fraction operator / (const fraction &b) const {
		return ((*this) * fraction(b.denominator, b.numerator));
	}
 
	void reduction() {
		if (numerator == 0) {
			denominator = 1;
			return;
		}
		long long gcdnum = __gcd(numerator, denominator);
		numerator /= gcdnum;
		denominator /= gcdnum;
	}
}