結果
問題 | No.890 移調の限られた旋法 |
ユーザー |
![]() |
提出日時 | 2019-09-20 21:37:30 |
言語 | C++14 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 37 ms / 2,000 ms |
コード長 | 3,364 bytes |
コンパイル時間 | 1,990 ms |
コンパイル使用メモリ | 176,568 KB |
実行使用メモリ | 22,892 KB |
最終ジャッジ日時 | 2024-09-14 16:51:19 |
合計ジャッジ時間 | 3,658 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge6 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 32 |
コンパイルメッセージ
main.cpp:11:20: warning: use of 'auto' in parameter declaration only available with '-std=c++20' or '-fconcepts' 11 | constexpr ModInt(auto x) : v(x >= 0 ? x % P : (P - -x % P) % P) {} | ^~~~ main.cpp:38:9: warning: use of 'auto' in parameter declaration only available with '-std=c++20' or '-fconcepts' 38 | M pow(auto n) const { | ^~~~ main.cpp:44:22: warning: use of 'auto' in parameter declaration only available with '-std=c++20' or '-fconcepts' 44 | friend M operator*(auto l, M r) { return M(l) *= r; } | ^~~~ main.cpp:45:22: warning: use of 'auto' in parameter declaration only available with '-std=c++20' or '-fconcepts' 45 | friend M operator/(auto l, M r) { return M(l) /= r; } | ^~~~ main.cpp:46:22: warning: use of 'auto' in parameter declaration only available with '-std=c++20' or '-fconcepts' 46 | friend M operator+(auto l, M r) { return M(l) += r; } | ^~~~ main.cpp:47:22: warning: use of 'auto' in parameter declaration only available with '-std=c++20' or '-fconcepts' 47 | friend M operator-(auto l, M r) { return M(l) -= r; } | ^~~~ main.cpp:50:26: warning: use of 'auto' in parameter declaration only available with '-std=c++20' or '-fconcepts' 50 | friend bool operator==(auto l, M r) { return M(l) == r; } | ^~~~ main.cpp:51:26: warning: use of 'auto' in parameter declaration only available with '-std=c++20' or '-fconcepts' 51 | friend bool operator!=(auto l, M r) { return !(l == r); } | ^~~~
ソースコード
#include <bits/stdc++.h>using namespace std;using lint = long long;template<class T = int> using V = vector<T>;template<class T = int> using VV = V< V<T> >;template<unsigned P> struct ModInt {using M = ModInt;unsigned v;constexpr ModInt() : v(0) {}constexpr ModInt(auto x) : v(x >= 0 ? x % P : (P - -x % P) % P) {}constexpr ModInt(unsigned v, int) : v(v) {}static constexpr unsigned p() { return P; }M operator+() const { return *this; }M operator-() const { return {v ? P - v : 0, 0}; }explicit operator bool() const noexcept { return v; }bool operator!() const noexcept { return !(bool)*this; }M operator*(M r) const { return M(*this) *= r; }M operator/(M r) const { return M(*this) /= r; }M operator+(M r) const { return M(*this) += r; }M operator-(M r) const { return M(*this) -= r; }bool operator==(M r) const { return v == r.v; }bool operator!=(M r) const { return !(*this == r); }M& operator*=(M r) { v = (uint64_t)v * r.v % P; return *this; }M& operator/=(M r) { return *this *= r.inv(); }M& operator+=(M r) { if ((v += r.v) >= P) v -= P; return *this; }M& operator-=(M r) { if ((v += P - r.v) >= P) v -= P; return *this; }M inv() const {int a = v, b = P, x = 1, u = 0;while (b) {int q = a / b;swap(a -= q * b, b);swap(x -= q * u, u);}assert(a == 1);return x;}M pow(auto n) const {if (n < 0) return pow(-n).inv();M res = 1;for (M a = *this; n; a *= a, n >>= 1) if (n & 1) res *= a;return res;}friend M operator*(auto l, M r) { return M(l) *= r; }friend M operator/(auto l, M r) { return M(l) /= r; }friend M operator+(auto l, M r) { return M(l) += r; }friend M operator-(auto l, M r) { return M(l) -= r; }friend ostream& operator<<(ostream& os, M r) { return os << r.v; }friend istream& operator>>(istream& is, M& r) { lint x; is >> x; r = x; return is; }friend bool operator==(auto l, M r) { return M(l) == r; }friend bool operator!=(auto l, M r) { return !(l == r); }};using Mint = ModInt<(unsigned)1e9 + 7>;V<Mint> fact, ifact, inv, powB;void init(int n, int B = 2) {fact.resize(n + 1);fact[0] = 1;for (int i = 1; i <= n; ++i) {fact[i] = i * fact[i - 1];}ifact.resize(n + 1);ifact[n] = 1 / fact[n];for (int i = n; i > 0; --i) {ifact[i - 1] = i * ifact[i];}inv.resize(n + 1);inv[1] = 1;for (int i = 2; i <= n; ++i) {int q = Mint::p() / i;inv[i] = -q * inv[Mint::p() - i * q];}powB.resize(n + 1);powB[0] = 1;for (int i = 0; i < n; ++i) {powB[i + 1] = powB[i] * B;}}Mint comb(int n, int r) {if (r < 0 or r > n) return 0;return fact[n] * ifact[r] * ifact[n - r];}template<class Z> V<Z> divisor(Z n) {V<Z> res;Z i;for (i = 1; i * i < n; ++i) if (n % i == 0) res.push_back(i), res.push_back(n / i);if (i * i == n) res.push_back(i);sort(begin(res), end(res));return res;}int main() {cin.tie(nullptr); ios::sync_with_stdio(false);int n, k; cin >> n >> k;init(n);V<Mint> dp(n);auto ds = divisor(n);for (int d : ds) if (d < n) {if (k % (n / d)) continue;int m = k / (n / d);dp[d] = comb(d, m);for (int i : ds) if (i < d and d % i == 0) {dp[d] -= dp[i];}}Mint res = accumulate(begin(dp), end(dp), Mint(0));cout << res << '\n';}