結果
問題 | No.890 移調の限られた旋法 |
ユーザー | sntea |
提出日時 | 2019-09-24 22:44:16 |
言語 | C++14 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 344 ms / 2,000 ms |
コード長 | 4,697 bytes |
コンパイル時間 | 3,750 ms |
コンパイル使用メモリ | 179,300 KB |
実行使用メモリ | 26,624 KB |
最終ジャッジ日時 | 2024-09-19 13:31:44 |
合計ジャッジ時間 | 8,643 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge5 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
5,248 KB |
testcase_01 | AC | 2 ms
5,376 KB |
testcase_02 | AC | 2 ms
5,376 KB |
testcase_03 | AC | 2 ms
5,376 KB |
testcase_04 | AC | 2 ms
5,376 KB |
testcase_05 | AC | 1 ms
5,376 KB |
testcase_06 | AC | 2 ms
5,376 KB |
testcase_07 | AC | 2 ms
5,376 KB |
testcase_08 | AC | 2 ms
5,376 KB |
testcase_09 | AC | 2 ms
5,376 KB |
testcase_10 | AC | 1 ms
5,376 KB |
testcase_11 | AC | 2 ms
5,376 KB |
testcase_12 | AC | 1 ms
5,376 KB |
testcase_13 | AC | 344 ms
26,624 KB |
testcase_14 | AC | 339 ms
26,496 KB |
testcase_15 | AC | 340 ms
26,624 KB |
testcase_16 | AC | 344 ms
26,624 KB |
testcase_17 | AC | 308 ms
24,388 KB |
testcase_18 | AC | 309 ms
24,276 KB |
testcase_19 | AC | 181 ms
15,484 KB |
testcase_20 | AC | 119 ms
11,136 KB |
testcase_21 | AC | 27 ms
5,376 KB |
testcase_22 | AC | 262 ms
21,120 KB |
testcase_23 | AC | 319 ms
25,088 KB |
testcase_24 | AC | 185 ms
15,840 KB |
testcase_25 | AC | 45 ms
6,144 KB |
testcase_26 | AC | 327 ms
25,700 KB |
testcase_27 | AC | 331 ms
25,944 KB |
testcase_28 | AC | 215 ms
17,876 KB |
testcase_29 | AC | 142 ms
12,672 KB |
testcase_30 | AC | 309 ms
24,292 KB |
testcase_31 | AC | 179 ms
15,104 KB |
testcase_32 | AC | 288 ms
22,612 KB |
testcase_33 | AC | 306 ms
23,936 KB |
testcase_34 | AC | 303 ms
23,924 KB |
ソースコード
#ifdef LOCAL111 #else #pragma GCC optimize ("O3") #define NDEBUG #endif // #define _USE_MATH_DEFINES #include <bits/stdc++.h> const int INF = 1e9; using namespace std; template<typename T, typename U> ostream& operator<< (ostream& os, const pair<T,U>& p) { os << '(' << p.first << ' ' << p.second << ')'; return os; } #define endl '\n' #define ALL(a) (a).begin(),(a).end() #define SZ(a) int((a).size()) #define FOR(i,a,b) for(int i=(a);i<(b);++i) #define RFOR(i,a,b) for (int i=(b)-1;i>=(a);i--) #define REP(i,n) FOR(i,0,n) #define RREP(i,n) for (int i=(n)-1;i>=0;i--) #ifdef LOCAL111 #define DEBUG(x) cout<<#x<<": "<<(x)<<endl template<typename T> void dpite(T a, T b){ for(T ite = a; ite != b; ite++) cout << (ite == a ? "" : " ") << *ite; cout << endl;} #else #define DEBUG(x) true template<typename T> void dpite(T a, T b){ return; } #endif #define F first #define S second #define SNP string::npos #define WRC(hoge) cout << "Case #" << (hoge)+1 << ": " template<typename T> void pite(T a, T b){ for(T ite = a; ite != b; ite++) cout << (ite == a ? "" : " ") << *ite; cout << endl;} template<typename T> bool chmax(T& a, T b){if(a < b){a = b; return true;} return false;} template<typename T> bool chmin(T& a, T b){if(a > b){a = b; return true;} return false;} template<typename T> vector<T> make_v(size_t a){return vector<T>(a);} template<typename T,typename... Ts> auto make_v(size_t a,Ts... ts){ return vector<decltype(make_v<T>(ts...))>(a,make_v<T>(ts...)); } template<typename T,typename U,typename... V> typename enable_if<is_same<T, U>::value!=0>::type fill_v(U &u,const V... v){u=U(v...);} template<typename T,typename U,typename... V> typename enable_if<is_same<T, U>::value==0>::type fill_v(U &u,const V... v){ for(auto &e:u) fill_v<T>(e,v...); } const array<int, 4> dx = {0, 1, 0, -1}; const array<int, 4> dy = {1, 0, -1, 0}; typedef long long int LL; typedef unsigned long long ULL; typedef pair<int,int> P; template<long long MOD> class ModInt { public: const static long long mod = MOD; long long x; ModInt() { x = 0; } ModInt(long long x) { x %= mod; this->x = x < 0 ? x+mod : x; } int get() const { return (int)x; } ModInt &operator+=(ModInt that) { if((x += that.get()) >= mod) x -= mod; return *this; } ModInt &operator-=(ModInt that) { if((x += mod-that.get()) >= mod) x -= mod; return *this; } ModInt &operator*=(ModInt that) { x = x*that.get()%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 { using std::swap; long long a = x, 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); } ModInt pow(int n) const{ ModInt b = *this; ModInt res = 1; while(n != 0) { if(n&1){ res *= b; } b *= b; n >>= 1; } return res; } bool operator==(ModInt that) const { return x == that.get(); } bool operator!=(ModInt that) const { return x != that.get(); } ModInt operator-() const { return x == 0 ? 0 : ModInt(mod-x); } }; template<long long MOD> ostream& operator<< (ostream& os, const ModInt<MOD>& m) { os << m.get(); return os; } template<long long MOD> istream& operator>> (istream& is, ModInt<MOD>& m){ long long n; is >> n; m = n; return is;} typedef ModInt<1000000007> mint; class ConvQuery { vector<mint> fac; vector<mint> facinv; public: ConvQuery(int n) { fac = vector<mint>(n+1); facinv = vector<mint>(n+1); fac[0] = 1; facinv[0] = 1; for(int i = 0; i < n; ++i) { fac[i+1] = fac[i]*(i+1); facinv[i+1] = fac[i+1].inverse(); } } mint operator()(int n, int m) { if(n >= 0 and 0 <= m and m <= n) return fac[n]*facinv[n-m]*facinv[m]; else return 0; } }; void ios_init(){ //cout.setf(ios::fixed); //cout.precision(12); #ifdef LOCAL111 return; #endif ios::sync_with_stdio(false); cin.tie(0); } int main() { ios_init(); int n, k; while(cin >> n >> k) { vector<mint> dp(n + 1); ConvQuery c(n + 10); mint ans = 0; FOR(i, 1, n) { if(n % i == 0 && k % (n / i) == 0) { DEBUG(i); dp[i] += c(i, k / (n / i)); DEBUG(c(i, k / (n / i))); int p = i + i; while(p <= n) { DEBUG(p); DEBUG(dp[i]); dp[p] -= dp[i]; DEBUG(dp[p]); p += i; } ans += dp[i]; } else { dp[i] = 0; } } dpite(ALL(dp)); cout << ans << endl; } return 0; }