結果
| 問題 | No.1164 GCD Products hard |
| ユーザー |
 Shuz*
|
| 提出日時 | 2020-08-12 13:03:35 |
| 言語 | C++14 (gcc 12.3.0 + boost 1.83.0) |
| 結果 |
AC
|
| 実行時間 | 1,722 ms / 2,500 ms |
| コード長 | 7,295 bytes |
| コンパイル時間 | 1,776 ms |
| コンパイル使用メモリ | 176,280 KB |
| 実行使用メモリ | 237,764 KB |
| 最終ジャッジ日時 | 2024-11-14 22:56:56 |
| 合計ジャッジ時間 | 47,588 ms |
|
ジャッジサーバーID （参考情報） |
judge3 / judge5 |
（要ログイン）
テストケース
テストケース表示| 入力 | 結果 | 実行時間 実行使用メモリ |
|---|---|---|
| testcase_00 | AC | 1,556 ms
237,580 KB |
| testcase_01 | AC | 1,609 ms
237,660 KB |
| testcase_02 | AC | 1,505 ms
237,764 KB |
| testcase_03 | AC | 1,313 ms
237,580 KB |
| testcase_04 | AC | 1,327 ms
237,568 KB |
| testcase_05 | AC | 1,555 ms
237,460 KB |
| testcase_06 | AC | 1,629 ms
237,596 KB |
| testcase_07 | AC | 1,673 ms
237,548 KB |
| testcase_08 | AC | 1,645 ms
237,568 KB |
| testcase_09 | AC | 1,506 ms
237,576 KB |
| testcase_10 | AC | 1,318 ms
237,432 KB |
| testcase_11 | AC | 1,583 ms
237,592 KB |
| testcase_12 | AC | 1,651 ms
237,588 KB |
| testcase_13 | AC | 1,472 ms
237,640 KB |
| testcase_14 | AC | 1,516 ms
237,656 KB |
| testcase_15 | AC | 1,646 ms
237,560 KB |
| testcase_16 | AC | 1,538 ms
237,584 KB |
| testcase_17 | AC | 1,551 ms
237,464 KB |
| testcase_18 | AC | 1,519 ms
237,432 KB |
| testcase_19 | AC | 1,334 ms
237,620 KB |
| testcase_20 | AC | 1,400 ms
237,556 KB |
| testcase_21 | AC | 1,650 ms
237,568 KB |
| testcase_22 | AC | 1,203 ms
237,592 KB |
| testcase_23 | AC | 1,722 ms
237,556 KB |
| testcase_24 | AC | 1,717 ms
237,548 KB |
| testcase_25 | AC | 1,215 ms
237,632 KB |
| testcase_26 | AC | 1,208 ms
237,580 KB |
| testcase_27 | AC | 1,216 ms
237,640 KB |
| testcase_28 | AC | 1,201 ms
237,452 KB |
ソースコード
#include <bits/stdc++.h>
using namespace std;
#pragma region Template
// Define
using ll = long long;
using ull = unsigned long long;
using ld = long double;
template <class T> using pvector = vector<pair<T, T>>;
template <class T> using rpriority_queue = priority_queue<T, vector<T>, greater<T>>;
constexpr const ll dx[4] = {1, 0, -1, 0};
constexpr const ll dy[4] = {0, 1, 0, -1};
constexpr const ll MOD = 1e9 + 7;
constexpr const ll mod = 998244353;
constexpr const ll INF = 1LL << 60;
constexpr const ll inf = 1 << 30;
constexpr const char rt = '\n';
constexpr const char sp = ' ';
#define rt(i, n) (i == (ll)(n) -1 ? rt : sp)
#define len(x) ((ll)(x).size())
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define mp make_pair
#define mt make_tuple
#define pb push_back
#define eb emplace_back
#define ifn(x) if (not(x))
#define elif else if
#define elifn else ifn
#define fi first
#define se second
#define uniq(x) (sort(all(x)), (x).erase(unique(all(x)), (x).end()))
using graph = vector<vector<ll>>;
template <class T> using wgraph = vector<vector<ll, T>>;
bool __DIRECTED__ = true;
bool __ZERO_INDEXED__ = false;
istream &operator>>(istream &is, graph &g) {
ll a, b;
is >> a >> b;
if (__ZERO_INDEXED__ == false) a--, b--;
g[a].pb(b);
if (__DIRECTED__ == false) g[b].pb(a);
return is;
}
template <class T> istream &operator>>(istream &is, wgraph<T> &g) {
ll a, b;
T c;
is >> a >> b >> c;
if (__ZERO_INDEXED__ == false) a--, b--;
g[a].pb({b, c});
if (__DIRECTED__ == false) g[b].pb({a, c});
return is;
}
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 (a > b) {
a = b;
return 1;
}
return 0;
}
// Debug
#define debug(...) \
{ \
cerr << __LINE__ << ": " << #__VA_ARGS__ << " = "; \
for (auto &&__i : {__VA_ARGS__}) cerr << "[" << __i << "] "; \
cerr << rt; \
}
#define dump(a, h, w) \
{ \
cerr << __LINE__ << ": " << #a << " = [" << rt; \
rep(__i, h) { \
rep(__j, w) { \
if (abs(a[__i][__j]) >= INF / 2 and a[__i][__j] <= -INF / 2) cerr << '-'; \
if (abs(a[__i][__j]) >= INF / 2) cerr << "∞" << sp; \
else \
cerr << a[__i][__j] << sp; \
} \
cerr << rt; \
} \
cerr << "]" << rt; \
}
#define vdump(a, n) \
{ \
cerr << __LINE__ << ": " << #a << " = ["; \
rep(__i, n) { \
if (__i) cerr << sp; \
if (abs(a[__i]) >= INF / 2 and a[__i] <= -INF / 2) cerr << '-'; \
if (abs(a[__i]) >= INF / 2) cerr << "∞" << sp; \
else \
cerr << a[__i]; \
} \
cerr << "]" << rt; \
}
// Loop
#define inc(i, a, n) for (ll i = (a), _##i = (n); i <= _##i; ++i)
#define dec(i, a, n) for (ll i = (a), _##i = (n); i >= _##i; --i)
#define rep(i, n) for (ll i = 0, _##i = (n); i < _##i; ++i)
#define each(i, a) for (auto &&i : a)
// Stream
#define fout(n) cout << fixed << setprecision(n)
struct io {
io() { cin.tie(nullptr), ios::sync_with_stdio(false); }
} io;
///*
// Speed
#pragma GCC diagnostic push
#pragma GCC diagnostic ignored "-Wunknown-pragmas"
#pragma GCC optimize("Ofast,unroll-loops")
#pragma GCC target( \
"sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native,arch=skylake-avx512")
#pragma GCC diagnostic pop
//*/
// Math
inline constexpr ll gcd(const ll a, const ll b) { return b ? gcd(b, a % b) : a; }
inline constexpr ll lcm(const ll a, const ll b) { return a / gcd(a, b) * b; }
inline constexpr ll modulo(const ll n, const ll m = MOD) {
ll k = n % m;
return k + m * (k < 0);
}
inline constexpr ll chmod(ll &n, const ll m = MOD) {
n %= m;
return n += m * (n < 0);
}
inline constexpr ll mpow(ll a, ll n, const ll m = MOD) {
ll r = 1;
rep(i, 64) {
if (n & (1LL << i)) r *= a;
chmod(r, m);
a *= a;
chmod(a, m);
}
return r;
}
inline ll inv(const ll n, const ll m = MOD) {
ll a = n, b = m, x = 1, y = 0;
while (b) {
ll t = a / b;
a -= t * b;
swap(a, b);
x -= t * y;
swap(x, y);
}
return modulo(x, m);
}
#pragma endregion
struct fact {
ll N;
vector<ll> A, B, C;
fact(ll n = 1 << 20) : N(n), A(n + 1, 1), B(n + 1), C(n + 1, 1) {
A[0] = A[1] = C[0] = C[1] = 0;
inc(i, 2, N) {
if (A[i] == 1) {
for (ll k = 2 * i; k <= N; k += i) {
A[k] = 0;
B[k] = i;
}
} else {
C[i] = C[i / B[i]] + 1;
}
}
}
bool p(ll n) { return A[n]; }
ll mf(ll n) { return B[n]; }
ll sf(ll n) { return C[n]; }
} fact(10000000);
signed main() {
ll A, B, N;
cin >> A >> B >> N;
ll res = 1;
inc(i, 1, B) {
if (fact.p(i)) {
ll t = i;
while (t <= B) {
ll cnt = mpow(B / t - (A - 1) / t, N, MOD - 1);
res *= mpow(i, cnt);
res %= MOD;
t *= i;
}
}
}
cout << res << rt;
}