結果
問題 | No.1164 GCD Products hard |
ユーザー | FF256grhy |
提出日時 | 2020-08-12 05:49:42 |
言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 389 ms / 2,500 ms |
コード長 | 6,491 bytes |
コンパイル時間 | 2,548 ms |
コンパイル使用メモリ | 207,656 KB |
実行使用メモリ | 42,320 KB |
最終ジャッジ日時 | 2024-10-09 15:07:19 |
合計ジャッジ時間 | 8,959 ms |
ジャッジサーバーID (参考情報) |
judge3 / judge2 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 258 ms
30,092 KB |
testcase_01 | AC | 297 ms
33,116 KB |
testcase_02 | AC | 206 ms
25,380 KB |
testcase_03 | AC | 46 ms
10,924 KB |
testcase_04 | AC | 41 ms
11,288 KB |
testcase_05 | AC | 257 ms
29,656 KB |
testcase_06 | AC | 312 ms
35,224 KB |
testcase_07 | AC | 321 ms
36,896 KB |
testcase_08 | AC | 308 ms
36,832 KB |
testcase_09 | AC | 207 ms
26,296 KB |
testcase_10 | AC | 43 ms
10,088 KB |
testcase_11 | AC | 222 ms
28,036 KB |
testcase_12 | AC | 315 ms
34,912 KB |
testcase_13 | AC | 167 ms
22,224 KB |
testcase_14 | AC | 182 ms
26,048 KB |
testcase_15 | AC | 325 ms
37,488 KB |
testcase_16 | AC | 212 ms
28,268 KB |
testcase_17 | AC | 238 ms
28,820 KB |
testcase_18 | AC | 216 ms
26,740 KB |
testcase_19 | AC | 47 ms
11,848 KB |
testcase_20 | AC | 89 ms
15,580 KB |
testcase_21 | AC | 344 ms
37,612 KB |
testcase_22 | AC | 2 ms
6,820 KB |
testcase_23 | AC | 338 ms
42,320 KB |
testcase_24 | AC | 389 ms
42,272 KB |
testcase_25 | AC | 2 ms
6,816 KB |
testcase_26 | AC | 2 ms
6,816 KB |
testcase_27 | AC | 2 ms
6,816 KB |
testcase_28 | AC | 2 ms
6,816 KB |
ソースコード
#include <bits/stdc++.h> using namespace std; using LL = long long int; #define incID(i, l, r) for(int i = (l) ; i < (r); i++) #define decID(i, l, r) for(int i = (r) - 1; i >= (l); i--) #define incII(i, l, r) for(int i = (l) ; i <= (r); i++) #define decII(i, l, r) for(int i = (r) ; i >= (l); i--) #define inc(i, n) incID(i, 0, n) #define dec(i, n) decID(i, 0, n) #define inc1(i, n) incII(i, 1, n) #define dec1(i, n) decII(i, 1, n) #define inID(v, l, r) ((l) <= (v) && (v) < (r)) #define inII(v, l, r) ((l) <= (v) && (v) <= (r)) #define PB push_back #define EB emplace_back #define MP make_pair #define MT make_tuple #define FI first #define SE second #define FR front() #define BA back() #define ALL(v) v.begin(), v.end() #define RALL(v) v.rbegin(), v.rend() auto setmin = [](auto & a, auto b) { return (b < a ? a = b, true : false); }; auto setmax = [](auto & a, auto b) { return (b > a ? a = b, true : false); }; auto setmineq = [](auto & a, auto b) { return (b <= a ? a = b, true : false); }; auto setmaxeq = [](auto & a, auto b) { return (b >= a ? a = b, true : false); }; #define SI(v) static_cast<int>(v.size()) #define RF(e, v) for(auto & e: v) #define until(e) while(! (e)) #define if_not(e) if(! (e)) #define ef else if #define UR assert(false) // 以下、入出力関係のテンプレ案のテスト auto * IS = & cin; // input elements (as a tuple) template<typename U, int I> void in_(U & t) { } template<typename U, int I, typename A, typename ... B> void in_(U & t) { (* IS) >> get<I>(t); in_<U, I + 1, B ...>(t); } template<typename ... T> auto in() { tuple<T ...> t; in_<tuple<T ...>, 0, T ...>(t); return t; } // input a array template<typename T, int N> auto ain() { array<T, N> a; inc(i, N) { (* IS) >> a[i]; } return a; } // input a (multi-dimensional) vector template<typename T> T vin() { return * istream_iterator<T>(* IS); } template<typename T, typename N, typename ... M> auto vin(N n, M ... m) { vector<decltype(vin<T, M ...>(m ...))> v(n); inc(i, n) { v[i] = vin<T, M ...>(m ...); } return v; } // input multi-column (as a tuple of vector) template<typename U, int I> void colin_(U & t) { } template<typename U, int I, typename A, typename ... B> void colin_(U & t) { get<I>(t).emplace_back(* istream_iterator<A>(* IS)); colin_<U, I + 1, B ...>(t); } template<typename ... T> auto colin(int n) { tuple<vector<T> ...> t; inc(i, n) { colin_<tuple<vector<T> ...>, 0, T ...>(t); } return t; } auto * OS = & cout; string SP = " ", LN = "\n"; // output elements void out() { (* OS) << LN << flush; } template<typename A > void out(A && a ) { (* OS) << a ; out( ); } template<typename A, typename ... B> void out(A && a, B && ... b) { (* OS) << a << SP; out(b ...); } // output a (multi-dimensional) vector template<typename T> ostream & operator<<(ostream & os, vector<T> const & v) { inc(i, v.size()) { os << (i == 0 ? "" : SP) << v[i]; } return os << flush; } template<typename T> void vout_(T && v) { (* OS) << v; } template<typename T, typename A, typename ... B> void vout_(T && v, A a, B ... b) { for(auto && w: v) { vout_(w, b ...); (* OS) << a; } } template<typename T, typename ... A> void vout(T && v, A ... a) { vout_(v, a ...); out(); } // ---- ---- template<LL M> class ModInt { private: LL v; pair<LL, LL> ext_gcd(LL a, LL b) { if(b == 0) { assert(a == 1); return { 1, 0 }; } auto p = ext_gcd(b, a % b); return { p.SE, p.FI - (a / b) * p.SE }; } public: ModInt(LL vv = 0) { v = vv; if(abs(v) >= M) { v %= M; } if(v < 0) { v += M; } } LL get_v() { return v; } ModInt inv() { return ext_gcd(M, v).SE; } ModInt exp(LL b) { ModInt p = 1, a = v; if(b < 0) { a = a.inv(); b = -b; } while(b) { if(b & 1) { p *= a; } a *= a; b >>= 1; } return p; } friend bool operator< (ModInt a, ModInt b) { return (a.v < b.v); } friend bool operator> (ModInt a, ModInt b) { return (a.v > b.v); } friend bool operator<=(ModInt a, ModInt b) { return (a.v <= b.v); } friend bool operator>=(ModInt a, ModInt b) { return (a.v >= b.v); } friend bool operator==(ModInt a, ModInt b) { return (a.v == b.v); } friend bool operator!=(ModInt a, ModInt b) { return (a.v != b.v); } friend ModInt operator+ (ModInt a ) { return ModInt(+a.v); } friend ModInt operator- (ModInt a ) { return ModInt(-a.v); } friend ModInt operator+ (ModInt a, ModInt b) { return ModInt(a.v + b.v); } friend ModInt operator- (ModInt a, ModInt b) { return ModInt(a.v - b.v); } friend ModInt operator* (ModInt a, ModInt b) { return ModInt(a.v * b.v); } friend ModInt operator/ (ModInt a, ModInt b) { return a * b.inv(); } friend ModInt operator^ (ModInt a, LL b) { return a.exp(b); } friend ModInt & operator+=(ModInt & a, ModInt b) { return (a = a + b); } friend ModInt & operator-=(ModInt & a, ModInt b) { return (a = a - b); } friend ModInt & operator*=(ModInt & a, ModInt b) { return (a = a * b); } friend ModInt & operator/=(ModInt & a, ModInt b) { return (a = a / b); } friend ModInt & operator^=(ModInt & a, LL b) { return (a = a ^ b); } friend istream & operator>>(istream & s, ModInt & b) { s >> b.v; b = ModInt(b.v); return s; } friend ostream & operator<<(ostream & s, ModInt b) { return (s << b.v); } }; // ---- using MI = ModInt<1'000'000'007>; using ME = ModInt<1'000'000'007 - 1>; auto fl = [](auto a, auto b) { assert(b != 0); return a / b - (a % b != 0 && ((a >= 0) != (b >= 0)) ? 1 : 0); }; auto ce = [](auto a, auto b) { assert(b != 0); return a / b + (a % b != 0 && ((a >= 0) == (b >= 0)) ? 1 : 0); }; auto mo = [](auto a, auto b) { assert(b != 0); a %= b; if(a < 0) { a += abs(b); } return a; }; // { x in (l, r] | x mod m = a } の要素数 LL cmCI(LL l, LL r, LL m, LL a) { assert(m > 0); return max(0LL, fl(r - a, m) - fl(l - a, m)); } LL cmCD(LL l, LL r, LL m, LL a) { return cmCI(l , r - 1, m, a); } LL cmII(LL l, LL r, LL m, LL a) { return cmCI(l - 1, r , m, a); } LL cmID(LL l, LL r, LL m, LL a) { return cmCI(l - 1, r - 1, m, a); } int main() { auto [a, b, n] = ain<int, 3>(); vector<int> f(b + 1); f[1] = 1; MI ans = 1; inc1(i, b) { if(f[i] == 1) { continue; } LL p = i; while(p * i <= b) { p *= i; } ME s = 0; until(p == 1) { ME v = ME(cmII(a, b, p, 0)) ^ n; ans *= MI(p) ^ (v - s).get_v(); s = v; p /= i; } for(int j = i; j <= b; j += i) { f[j] = 1; } } out(ans); }