kyopro/library/math/prime_factor.cpp

• View this file on GitHub
• Last update: 2022-07-20 00:04:43+09:00

Code

map<ll, int> prime_factor(ll a) {
	map<ll, int> ret;
	for (ll x = 2; x * x <= a; ++x) {
		while (not(a % x))++ret[x], a /= x;
	}
	if (a != 1)++ret[a];
	return ret;
}

#line 1 "kyopro/library/math/prime_factor.cpp"
map<ll, int> prime_factor(ll a) {
	map<ll, int> ret;
	for (ll x = 2; x * x <= a; ++x) {
		while (not(a % x))++ret[x], a /= x;
	}
	if (a != 1)++ret[a];
	return ret;
}

Back to top page