結果
問題 | No.890 移調の限られた旋法 |
ユーザー | paruki |
提出日時 | 2019-09-21 14:42:58 |
言語 | C++14 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 379 ms / 2,000 ms |
コード長 | 3,484 bytes |
コンパイル時間 | 1,660 ms |
コンパイル使用メモリ | 170,788 KB |
実行使用メモリ | 14,952 KB |
最終ジャッジ日時 | 2023-10-19 02:26:55 |
合計ジャッジ時間 | 8,920 ms |
ジャッジサーバーID (参考情報) |
judge14 / judge11 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
4,348 KB |
testcase_01 | AC | 2 ms
4,348 KB |
testcase_02 | AC | 2 ms
4,348 KB |
testcase_03 | AC | 2 ms
4,348 KB |
testcase_04 | AC | 2 ms
4,348 KB |
testcase_05 | AC | 2 ms
4,348 KB |
testcase_06 | AC | 2 ms
4,348 KB |
testcase_07 | AC | 2 ms
4,348 KB |
testcase_08 | AC | 2 ms
4,348 KB |
testcase_09 | AC | 2 ms
4,348 KB |
testcase_10 | AC | 2 ms
4,348 KB |
testcase_11 | AC | 2 ms
4,348 KB |
testcase_12 | AC | 2 ms
4,348 KB |
testcase_13 | AC | 378 ms
14,952 KB |
testcase_14 | AC | 379 ms
14,952 KB |
testcase_15 | AC | 376 ms
14,952 KB |
testcase_16 | AC | 378 ms
14,952 KB |
testcase_17 | AC | 343 ms
13,964 KB |
testcase_18 | AC | 341 ms
13,964 KB |
testcase_19 | AC | 200 ms
9,348 KB |
testcase_20 | AC | 128 ms
7,236 KB |
testcase_21 | AC | 29 ms
4,348 KB |
testcase_22 | AC | 291 ms
12,184 KB |
testcase_23 | AC | 356 ms
14,232 KB |
testcase_24 | AC | 204 ms
9,612 KB |
testcase_25 | AC | 49 ms
4,860 KB |
testcase_26 | AC | 364 ms
14,496 KB |
testcase_27 | AC | 369 ms
14,756 KB |
testcase_28 | AC | 239 ms
10,668 KB |
testcase_29 | AC | 157 ms
8,028 KB |
testcase_30 | AC | 343 ms
13,964 KB |
testcase_31 | AC | 195 ms
9,348 KB |
testcase_32 | AC | 315 ms
13,172 KB |
testcase_33 | AC | 335 ms
13,700 KB |
testcase_34 | AC | 335 ms
13,700 KB |
ソースコード
#define _USE_MATH_DEFINES #include "bits/stdc++.h" using namespace std; #define FOR(i,j,k) for(int (i)=(j);(i)<(int)(k);++(i)) #define rep(i,j) FOR(i,0,j) #define each(x,y) for(auto &(x):(y)) #define mp make_pair #define MT make_tuple #define all(x) (x).begin(),(x).end() #define debug(x) cout<<#x<<": "<<(x)<<endl #define smax(x,y) (x)=max((x),(y)) #define smin(x,y) (x)=min((x),(y)) #define MEM(x,y) memset((x),(y),sizeof (x)) #define sz(x) (int)(x).size() #define RT return using ll = long long; using pii = pair<int, int>; using vi = vector<int>; using vll = vector<ll>; template<int MOD> class ModInt { public: ModInt() :value(0) {} ModInt(long long val) :value((int)(val<0 ? MOD + val % MOD : val % MOD)) { } ModInt& operator+=(ModInt that) { value = value + that.value; if (value >= MOD)value -= MOD; return *this; } ModInt& operator-=(ModInt that) { value -= that.value; if (value<0)value += MOD; return *this; } ModInt& operator*=(ModInt that) { value = (int)((long long)value * that.value % 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 pow(long long k) const { ModInt n = *this, res = 1; while (k) { if (k & 1)res *= n; n *= n; k >>= 1; } return res; } ModInt inverse() const { long long a = value, b = MOD, u = 1, v = 0; while (b) { long long t = a / b; a -= t * b; swap(a, b); u -= t * v; swap(u, v); } return ModInt(u); } int toi() const { return value; } private: int value; }; typedef ModInt<1000000007> mint; ostream& operator<<(ostream& os, const mint& x) { os << x.toi(); return os; } class Combinatons { public: Combinatons(int n = 0) :fact(n + 1), rev(n + 1) { fact[0] = 1; for (int i = 1; i < n + 1; ++i)fact[i] = fact[i - 1] * i; for (int i = 0; i < n + 1; ++i)rev[i] = fact[i].inverse(); } mint C(int n, int r) { if (n < r)return 0; return fact[n] * rev[r] * rev[n - r]; } mint H(int n, int r) { return C(n + r - 1, r); } mint P(int n, int r) { if (r > n)return 0; return fact[n] * rev[n - r]; } mint catalan(int n) { return fact[2 * n] * rev[n + 1] * rev[n]; } private: vector<mint> fact, rev; }; void solve() { int N, K; cin >> N >> K; Combinatons comb(N); vector<mint> f(N); for (int i = 1; i < N; ++i) { if (N%i) { continue; } int j = N / i; if (K%j) { continue; } f[i] = comb.C(i, K/j); } mint ans; for (int i = 1; i < N; ++i) { ans += f[i]; for (int j = i * 2; j < N; j += i) { if (N%j == 0) { f[j] -= f[i]; } } } cout << ans << endl; } int main() { ios::sync_with_stdio(false); cin.tie(0); cout << fixed << setprecision(15); solve(); return 0; }