#711479 (C++14) No.1728 [Cherry 3rd Tune] Bullet

• 問題: No.1728 [Cherry 3rd Tune] Bullet
• ユーザー: square1001
• 提出日時: 2021-10-29 22:11:35
• 言語: C++14 (gcc 12.3.0 + boost 1.83.0)
• 結果: AC
• 実行時間: 51 ms / 2,000 ms
• コード長: 3,148 bytes
• コンパイル時間: 1,890 ms
• コンパイル使用メモリ: 79,096 KB
• 実行使用メモリ: 5,248 KB
• 最終ジャッジ日時: 2024-10-07 11:29:35
• 合計ジャッジ時間: 2,046 ms
• ジャッジサーバーID （参考情報）: judge2 / judge4

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	2 ms; 5,248 KB
testcase_01	AC	2 ms; 5,248 KB
testcase_02	AC	2 ms; 5,248 KB
testcase_03	AC	2 ms; 5,248 KB
testcase_04	AC	2 ms; 5,248 KB
testcase_05	AC	2 ms; 5,248 KB
testcase_06	AC	2 ms; 5,248 KB
testcase_07	AC	1 ms; 5,248 KB
testcase_08	AC	3 ms; 5,248 KB
testcase_09	AC	2 ms; 5,248 KB
testcase_10	AC	3 ms; 5,248 KB
testcase_11	AC	2 ms; 5,248 KB
testcase_12	AC	2 ms; 5,248 KB
testcase_13	AC	2 ms; 5,248 KB
testcase_14	AC	2 ms; 5,248 KB
testcase_15	AC	2 ms; 5,248 KB
testcase_16	AC	3 ms; 5,248 KB
testcase_17	AC	2 ms; 5,248 KB
testcase_18	AC	2 ms; 5,248 KB
testcase_19	AC	2 ms; 5,248 KB
testcase_20	AC	2 ms; 5,248 KB
testcase_21	AC	3 ms; 5,248 KB
testcase_22	AC	2 ms; 5,248 KB
testcase_23	AC	51 ms; 5,248 KB
testcase_24	AC	34 ms; 5,248 KB
testcase_25	AC	3 ms; 5,248 KB
testcase_26	AC	2 ms; 5,248 KB

ソースコード

#ifndef CLASS_MODINT
#define CLASS_MODINT

#include <cstdint>

template <std::uint32_t mod>
class modint {
private:
	std::uint32_t n;
public:
	modint() : n(0) {};
	modint(std::int64_t n_) : n((n_ >= 0 ? n_ : mod - (-n_) % mod) % mod) {};
	static constexpr std::uint32_t get_mod() { return mod; }
	std::uint32_t get() const { return n; }
	bool operator==(const modint& m) const { return n == m.n; }
	bool operator!=(const modint& m) const { return n != m.n; }
	modint& operator+=(const modint& m) { n += m.n; n = (n < mod ? n : n - mod); return *this; }
	modint& operator-=(const modint& m) { n += mod - m.n; n = (n < mod ? n : n - mod); return *this; }
	modint& operator*=(const modint& m) { n = std::uint64_t(n) * m.n % mod; return *this; }
	modint operator+(const modint& m) const { return modint(*this) += m; }
	modint operator-(const modint& m) const { return modint(*this) -= m; }
	modint operator*(const modint& m) const { return modint(*this) *= m; }
	modint inv() const { return (*this).pow(mod - 2); }
	modint pow(std::uint64_t b) const {
		modint ans = 1, m = modint(*this);
		while (b) {
			if (b & 1) ans *= m;
			m *= m;
			b >>= 1;
		}
		return ans;
	}
};

#endif // CLASS_MODINT

#ifndef CLASS_DISJOINT_SET
#define CLASS_DISJOINT_SET

#include <vector>
#include <cstdint>
#include <cstring>
#include <algorithm>

class disjoint_set {
private:
	typedef std::int32_t value_type;
	std::vector<value_type> val;
public:
	explicit disjoint_set() : val() {};
	explicit disjoint_set(std::size_t n) : val(n, -1) {};
	std::size_t size() const { return val.size(); }
	std::size_t size(std::size_t elem) { return std::size_t(-val[root(elem)]); }
	std::size_t root(std::size_t elem) {
		// path halving
		while (val[elem] >= 0 && val[val[elem]] >= 0) {
			val[elem] = val[val[elem]];
			elem = val[elem];
		}
		return std::size_t(val[elem] >= 0 ? val[elem] : elem);
	}
	void link(std::size_t elemx, std::size_t elemy) {
		elemx = root(elemx);
		elemy = root(elemy);
		if (elemx == elemy) return;
		if (val[elemx] > val[elemy]) {
			std::swap(elemx, elemy);
		}
		val[elemx] += val[elemy];
		val[elemy] = elemx;
	}
	bool connected(std::size_t elemx, std::size_t elemy) {
		return root(elemx) == root(elemy);
	}
};

#endif // CLASS_DISJOINT_SET

#include <iostream>
using namespace std;
using mint = modint<1000000007>;
int gcd(int x, int y) {
	if (y == 0) return x;
	return gcd(y, x % y);
}
int main() {
	int Q;
	cin >> Q;
	while (Q--) {
		int N, C;
		cin >> N >> C;
		vector<int> divisors;
		for (int i = 1; i * i <= N; ++i) {
			if (N % i == 0) {
				divisors.push_back(i);
				if (i * i != N) {
					divisors.push_back(N / i);
				}
			}
		}
		sort(divisors.begin(), divisors.end());
		vector<int> dp = divisors;
		reverse(dp.begin(), dp.end());
		for (int i = int(divisors.size()) - 1; i >= 0; --i) {
			for (int j = i + 1; j < int(divisors.size()); ++j) {
				if (divisors[j] % divisors[i] == 0) {
					dp[i] -= dp[j];
				}
			}
		}
		mint ans = mint(C).pow(N) * N;
		for (int i = 0; i < int(divisors.size()); ++i) {
			ans += mint(C).pow(2 * divisors[i]) * dp[i];
		}
		ans *= mint(2 * N).inv();
		cout << ans.get() << endl;
	}
	return 0;
}