結果
問題 | No.890 移調の限られた旋法 |
ユーザー | Mayimg |
提出日時 | 2019-09-26 02:02:26 |
言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 114 ms / 2,000 ms |
コード長 | 8,492 bytes |
コンパイル時間 | 2,250 ms |
コンパイル使用メモリ | 206,020 KB |
実行使用メモリ | 58,456 KB |
最終ジャッジ日時 | 2024-09-23 02:39:28 |
合計ジャッジ時間 | 6,341 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge5 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 68 ms
50,576 KB |
testcase_01 | AC | 69 ms
50,544 KB |
testcase_02 | AC | 68 ms
50,644 KB |
testcase_03 | AC | 69 ms
50,596 KB |
testcase_04 | AC | 67 ms
50,612 KB |
testcase_05 | AC | 66 ms
50,444 KB |
testcase_06 | AC | 70 ms
50,468 KB |
testcase_07 | AC | 63 ms
50,568 KB |
testcase_08 | AC | 68 ms
50,528 KB |
testcase_09 | AC | 72 ms
50,580 KB |
testcase_10 | AC | 69 ms
50,472 KB |
testcase_11 | AC | 77 ms
50,568 KB |
testcase_12 | AC | 75 ms
50,420 KB |
testcase_13 | AC | 114 ms
58,232 KB |
testcase_14 | AC | 109 ms
58,456 KB |
testcase_15 | AC | 102 ms
58,348 KB |
testcase_16 | AC | 105 ms
58,232 KB |
testcase_17 | AC | 103 ms
57,580 KB |
testcase_18 | AC | 102 ms
57,568 KB |
testcase_19 | AC | 98 ms
54,624 KB |
testcase_20 | AC | 87 ms
53,084 KB |
testcase_21 | AC | 87 ms
50,972 KB |
testcase_22 | AC | 100 ms
56,544 KB |
testcase_23 | AC | 105 ms
57,800 KB |
testcase_24 | AC | 90 ms
54,732 KB |
testcase_25 | AC | 69 ms
51,508 KB |
testcase_26 | AC | 100 ms
57,912 KB |
testcase_27 | AC | 103 ms
58,040 KB |
testcase_28 | AC | 88 ms
55,500 KB |
testcase_29 | AC | 84 ms
53,716 KB |
testcase_30 | AC | 108 ms
57,588 KB |
testcase_31 | AC | 85 ms
54,500 KB |
testcase_32 | AC | 101 ms
57,048 KB |
testcase_33 | AC | 100 ms
57,404 KB |
testcase_34 | AC | 112 ms
57,412 KB |
ソースコード
#define _USE_MATH_DEFINES #include <bits/stdc++.h> using namespace std; template<int MOD> class Modular { private: long long value; public: constexpr Modular() : value() {}; constexpr Modular(const Modular& other) : value(other.value) {} template <typename U> constexpr Modular(const U& x) { value = normalize(x); } template <typename U> static long long normalize(const U& x) { long long v; if (-MOD <= x && x < MOD) v = static_cast<long long>(x); else v = static_cast<long long>(x % MOD); if (v < 0) v += MOD; return v; } constexpr long long inverse(long long x) { x = (x % MOD + MOD) % MOD; long long y = MOD, u = 1, v = 0; while(y) { long long t = x / y; x -= t * y; swap(x, y); u -= t * v; swap(u, v); } return (u % MOD + MOD) % MOD; } explicit operator long long() const noexcept { return value;} template <typename U> explicit operator U() const noexcept { return static_cast<U>(value); } constexpr Modular& operator=(const Modular& other) & noexcept { value = other.value; return *this; } template <typename U> constexpr Modular& operator=(const U& other) & noexcept { return *this = Modular(other); } constexpr Modular& operator+=(const Modular& other) noexcept { if ((value += other.value) >= MOD) value -= MOD; return *this; } template <typename U> constexpr Modular& operator+=(const U& other) noexcept { return *this += Modular(other); } constexpr Modular& operator-=(const Modular& other) noexcept { if ((value -= other.value) < 0) value += MOD; return *this; } template <typename U> constexpr Modular& operator-=(const U& other) noexcept { return *this -= Modular(other); } constexpr Modular& operator*=(const Modular& other) noexcept { value = value * other.value % MOD; return *this; } template <typename U> constexpr Modular& operator*=(const U& other) noexcept {return *this *= Modular(other); } constexpr Modular& operator/=(const Modular& other) noexcept { return *this *= Modular(inverse(other.value)); } template <typename U> constexpr Modular& operator/=(const U& other) noexcept { return *this *= Modular(inverse(normalize(other))); } constexpr Modular& operator++() noexcept {return *this += 1; } constexpr Modular operator++(int) noexcept { Modular ret(*this); *this += 1; return ret; } constexpr Modular& operator--() noexcept {return *this -= 1; } constexpr Modular operator--(int) noexcept { Modular ret(*this); *this += 1; return ret; } constexpr Modular operator-() const { return Modular(-value); } friend constexpr bool operator==(const Modular<MOD>& lhs, const Modular<MOD>& rhs) noexcept { return lhs.value == rhs.value; } template <typename U> friend constexpr bool operator==(const Modular<MOD>& lhs, U rhs) noexcept { return lhs == Modular<MOD>(rhs); } template <typename U> friend constexpr bool operator==(U lhs, const Modular<MOD>& rhs) noexcept { return Modular<MOD>(lhs) == rhs; } friend constexpr bool operator!=(const Modular<MOD>& lhs, const Modular<MOD>& rhs) noexcept { return !(lhs == rhs); } template <typename U> friend constexpr bool operator!=(const Modular<MOD>& lhs, U rhs) noexcept { return !(lhs == rhs); } template <typename U> friend constexpr bool operator!=(U lhs, const Modular<MOD> rhs) noexcept { return !(lhs == rhs); } friend constexpr bool operator<(const Modular<MOD>& lhs, const Modular<MOD>& rhs) noexcept { return lhs.value < rhs.value; } template <typename U> friend constexpr bool operator<(const Modular<MOD> &lhs, U rhs) noexcept { return lhs.value < rhs; } template <typename U> friend constexpr bool operator<(U lhs, const Modular<MOD> &rhs) noexcept { return lhs < rhs.value; } friend constexpr bool operator>(const Modular<MOD>& lhs, const Modular<MOD>& rhs) noexcept { return rhs.value < lhs.value; } template <typename U> friend constexpr bool operator>(const Modular<MOD> &lhs, U rhs) noexcept { return rhs.value < lhs; } template <typename U> friend constexpr bool operator>(U lhs, const Modular<MOD> &rhs) noexcept { return rhs < lhs.value; } friend constexpr bool operator<=(const Modular<MOD>& lhs, const Modular<MOD>& rhs) noexcept { return !(lhs.value > rhs.value); } template <typename U> friend constexpr bool operator<=(const Modular<MOD> &lhs, U rhs) noexcept { return !(lhs.value > rhs); } template <typename U> friend constexpr bool operator<=(U lhs, const Modular<MOD> &rhs) noexcept { return !(lhs < rhs.value); } friend constexpr bool operator>=(const Modular<MOD>& lhs, const Modular<MOD>& rhs) noexcept { return !(lhs.value < rhs.value); } template <typename U> friend constexpr bool operator>=(const Modular<MOD> &lhs, U rhs) noexcept { return !(lhs.value < rhs); } template <typename U> friend constexpr bool operator>=(U lhs, const Modular<MOD> &rhs) noexcept { return !(lhs < rhs.value); } friend constexpr Modular<MOD> operator+(const Modular<MOD>& lhs, const Modular<MOD>& rhs) noexcept { return Modular<MOD>(lhs) += rhs; } template <typename U> friend constexpr Modular<MOD> operator+(const Modular<MOD>& lhs, U rhs) noexcept { return Modular<MOD>(lhs) += rhs; } template <typename U> friend constexpr Modular<MOD> operator+(U lhs, const Modular<MOD> &rhs) noexcept { return Modular<MOD>(lhs) += rhs; } friend constexpr Modular<MOD> operator-(const Modular<MOD>& lhs, const Modular<MOD>& rhs) noexcept { return Modular<MOD>(lhs) -= rhs; } template <typename U> friend constexpr Modular<MOD> operator-(const Modular<MOD>& lhs, U rhs) noexcept { return Modular<MOD>(lhs) -= rhs; } template <typename U> friend constexpr Modular<MOD> operator-(U lhs, const Modular<MOD> &rhs) noexcept { return Modular<MOD>(lhs) -= rhs; } friend constexpr Modular<MOD> operator*(const Modular<MOD>& lhs, const Modular<MOD>& rhs) noexcept { return Modular<MOD>(lhs) *= rhs; } template <typename U> friend constexpr Modular<MOD> operator*(const Modular<MOD>& lhs, U rhs) noexcept { return Modular<MOD>(lhs) *= rhs; } template <typename U> friend constexpr Modular<MOD> operator*(U lhs, const Modular<MOD> &rhs) noexcept { return Modular<MOD>(lhs) *= rhs; } friend constexpr Modular<MOD> operator/(const Modular<MOD>& lhs, const Modular<MOD>& rhs) noexcept { return Modular<MOD>(lhs) /= rhs; } template <typename U> friend constexpr Modular<MOD> operator/(const Modular<MOD>& lhs, U rhs) noexcept { return Modular<MOD>(lhs) /= rhs; } template <typename U> friend constexpr Modular<MOD> operator/(U lhs, const Modular<MOD> &rhs) noexcept { return Modular<MOD>(lhs) /= rhs; } friend std::ostream& operator<<(std::ostream& stream, const Modular<MOD>& number) noexcept { return stream << number.value; } friend std::istream& operator>>(std::istream& stream, Modular<MOD>& number) { long long in; stream >> in; number.value = Modular<MOD>::normalize(in); return stream; } constexpr int getmod() const { return MOD; } }; template<int MOD, typename U> Modular<MOD> power(const Modular<MOD>& x, const U& y) { assert(y >= 0); Modular<MOD> k = x, result = 1; U p = y; while (p > 0) { if (p & 1) result *= k; k *= k; p >>= 1; } return result; } template<int MOD> class BinaryCoefficients { private: vector<Modular<MOD>> fact_, inv_, finv_; public: constexpr BinaryCoefficients(int n = 2020200) : fact_(n, 1), inv_(n, 1), finv_(n, 1) { for (int i = 2; i < n; i++) { fact_[i] = fact_[i - 1] * i; inv_[i] = -inv_[MOD % i] * (MOD / i); finv_[i] = finv_[i - 1] * inv_[i]; } } constexpr Modular<MOD> comb(int n, int k) const noexcept { if (n < k || n < 0 || k < 0) return 0; return fact_[n] * finv_[k] * finv_[n - k]; } constexpr Modular<MOD> fact(int n) const noexcept { if (n < 0) return 0; return fact_[n]; } constexpr Modular<MOD> inv(int n) const noexcept { if (n < 0) return 0; return inv_[n]; } constexpr Modular<MOD> finv(int n) const noexcept { if (n < 0) return 0; return finv_[n]; } }; constexpr int mod = 1e9 + 7; //constexpr int mod = 998244353; using mint = Modular<mod>; using bicoef = BinaryCoefficients<mod>; signed main() { ios::sync_with_stdio(false); cin.tie(0); int n, k; cin >> n >> k; vector<mint> v(n); bicoef bc; for (int i = 1; i < n; i++) { if (n % i) continue; if (k % (n / i)) continue; v[i] = bc.comb(i, k / (n / i)); } mint ans = 0; for (int i = 1; i < n; i++) { ans += v[i]; for (int j = i + i; j < n; j += i) { if (v[j]) v[j] -= v[i]; } } cout << ans << '\n'; return 0; }