結果
問題 | No.890 移調の限られた旋法 |
ユーザー | はまやんはまやん |
提出日時 | 2019-09-21 09:10:40 |
言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 29 ms / 2,000 ms |
コード長 | 4,335 bytes |
コンパイル時間 | 2,341 ms |
コンパイル使用メモリ | 210,584 KB |
実行使用メモリ | 22,924 KB |
最終ジャッジ日時 | 2024-09-17 06:36:56 |
合計ジャッジ時間 | 4,413 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge6 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 29 ms
22,712 KB |
testcase_01 | AC | 29 ms
22,888 KB |
testcase_02 | AC | 29 ms
22,880 KB |
testcase_03 | AC | 29 ms
22,844 KB |
testcase_04 | AC | 29 ms
22,812 KB |
testcase_05 | AC | 29 ms
22,820 KB |
testcase_06 | AC | 29 ms
22,840 KB |
testcase_07 | AC | 29 ms
22,744 KB |
testcase_08 | AC | 29 ms
22,776 KB |
testcase_09 | AC | 29 ms
22,880 KB |
testcase_10 | AC | 29 ms
22,892 KB |
testcase_11 | AC | 29 ms
22,908 KB |
testcase_12 | AC | 29 ms
22,876 KB |
testcase_13 | AC | 29 ms
22,924 KB |
testcase_14 | AC | 29 ms
22,880 KB |
testcase_15 | AC | 28 ms
22,832 KB |
testcase_16 | AC | 29 ms
22,884 KB |
testcase_17 | AC | 29 ms
22,712 KB |
testcase_18 | AC | 29 ms
22,832 KB |
testcase_19 | AC | 29 ms
22,828 KB |
testcase_20 | AC | 28 ms
22,824 KB |
testcase_21 | AC | 29 ms
22,828 KB |
testcase_22 | AC | 29 ms
22,820 KB |
testcase_23 | AC | 29 ms
22,708 KB |
testcase_24 | AC | 29 ms
22,708 KB |
testcase_25 | AC | 28 ms
22,848 KB |
testcase_26 | AC | 29 ms
22,884 KB |
testcase_27 | AC | 29 ms
22,820 KB |
testcase_28 | AC | 29 ms
22,716 KB |
testcase_29 | AC | 29 ms
22,804 KB |
testcase_30 | AC | 29 ms
22,848 KB |
testcase_31 | AC | 29 ms
22,844 KB |
testcase_32 | AC | 29 ms
22,828 KB |
testcase_33 | AC | 29 ms
22,824 KB |
testcase_34 | AC | 28 ms
22,740 KB |
ソースコード
#include<bits/stdc++.h> #define rep(i,a,b) for(int i=a;i<b;i++) #define rrep(i,a,b) for(int i=a;i>=b;i--) #define fore(i,a) for(auto &i:a) #define all(x) (x).begin(),(x).end() //#pragma GCC optimize ("-O3") using namespace std; void _main(); int main() { cin.tie(0); ios::sync_with_stdio(false); _main(); } typedef long long ll; const int inf = INT_MAX / 2; const ll infl = 1LL << 60; template<class T>bool chmax(T& a, const T& b) { if (a < b) { a = b; return 1; } return 0; } template<class T>bool chmin(T& a, const T& b) { if (b < a) { a = b; return 1; } return 0; } //--------------------------------------------------------------------------------------------------- template<int MOD> struct ModInt { static const int Mod = MOD; unsigned x; ModInt() : x(0) { } ModInt(signed sig) { x = sig < 0 ? sig % MOD + MOD : sig % MOD; } ModInt(signed long long sig) { x = sig < 0 ? sig % MOD + MOD : sig % MOD; } int get() const { return (int)x; } ModInt &operator+=(ModInt that) { if ((x += that.x) >= MOD) x -= MOD; return *this; } ModInt &operator-=(ModInt that) { if ((x += MOD - that.x) >= MOD) x -= MOD; return *this; } ModInt &operator*=(ModInt that) { x = (unsigned long long)x * that.x % MOD; return *this; } ModInt &operator/=(ModInt that) { return *this *= that.inverse(); } ModInt operator+(ModInt that) const { return ModInt(*this) += that; } ModInt operator-(ModInt that) const { return ModInt(*this) -= that; } ModInt operator*(ModInt that) const { return ModInt(*this) *= that; } ModInt operator/(ModInt that) const { return ModInt(*this) /= that; } ModInt inverse() const { long long a = x, b = MOD, u = 1, v = 0; while (b) { long long t = a / b; a -= t * b; std::swap(a, b); u -= t * v; std::swap(u, v); } return ModInt(u); } bool operator==(ModInt that) const { return x == that.x; } bool operator!=(ModInt that) const { return x != that.x; } ModInt operator-() const { ModInt t; t.x = x == 0 ? 0 : Mod - x; return t; } }; template<int MOD> ostream& operator<<(ostream& st, const ModInt<MOD> a) { st << a.get(); return st; }; template<int MOD> ModInt<MOD> operator^(ModInt<MOD> a, unsigned long long k) { ModInt<MOD> r = 1; while (k) { if (k & 1) r *= a; a *= a; k >>= 1; } return r; } template<typename T, int FAC_MAX> struct Comb { vector<T> fac, ifac; Comb(){fac.resize(FAC_MAX,1);ifac.resize(FAC_MAX,1);rep(i,1,FAC_MAX)fac[i]=fac[i-1]*i; ifac[FAC_MAX-1]=T(1)/fac[FAC_MAX-1];rrep(i,FAC_MAX-2,1)ifac[i]=ifac[i+1]*T(i+1);} T aPb(int a, int b) { if (b < 0 || a < b) return T(0); return fac[a] * ifac[a - b]; } T aCb(int a, int b) { if (b < 0 || a < b) return T(0); return fac[a] * ifac[a - b] * ifac[b]; } T nHk(int n, int k) { if (n == 0 && k == 0) return T(1); if (n <= 0 || k < 0) return 0; return aCb(n + k - 1, k); } // nHk = (n+k-1)Ck : n is separator T pairCombination(int n) {if(n%2==1)return T(0);return fac[n]*ifac[n/2]/(T(2)^(n/2));} // combination of paris for n }; typedef ModInt<1000000007> mint; vector<int> enumdiv(int n) { vector<int> S; for (int i = 1; 1LL*i*i <= n; i++) if (n%i == 0) { S.push_back(i); if (i*i != n) S.push_back(n / i); } sort(S.begin(), S.end()); return S; } /*--------------------------------------------------------------------------------------------------- ∧_∧ ∧_∧ (´<_` ) Welcome to My Coding Space! ( ´_ゝ`) / ⌒i @hamayanhamayan / \ | | / / ̄ ̄ ̄ ̄/ | __(__ニつ/ _/ .| .|____ \/____/ (u ⊃ ---------------------------------------------------------------------------------------------------*/ int N, K; mint cnt[1010101]; Comb<mint, 2010101> com; //--------------------------------------------------------------------------------------------------- void _main() { cin >> N >> K; auto ed = enumdiv(N); fore(minloop, ed) if (minloop < N and K % (N / minloop) == 0) { cnt[minloop] = com.aCb(minloop, K / (N / minloop)); fore(x, ed) if (x < minloop and minloop % x == 0) cnt[minloop] -= cnt[x]; } mint ans = 0; fore(minloop, ed) ans += cnt[minloop]; cout << ans << endl; }