結果
問題 | No.1259 スイッチ |
ユーザー | yuruhiya |
提出日時 | 2020-10-17 10:35:40 |
言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
結果 |
WA
|
実行時間 | - |
コード長 | 3,339 bytes |
コンパイル時間 | 663 ms |
コンパイル使用メモリ | 49,920 KB |
実行使用メモリ | 6,948 KB |
最終ジャッジ日時 | 2024-07-21 01:54:14 |
合計ジャッジ時間 | 2,825 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge1 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | WA | - |
testcase_01 | WA | - |
testcase_02 | WA | - |
testcase_03 | WA | - |
testcase_04 | WA | - |
testcase_05 | WA | - |
testcase_06 | WA | - |
testcase_07 | WA | - |
testcase_08 | WA | - |
testcase_09 | WA | - |
testcase_10 | WA | - |
testcase_11 | WA | - |
testcase_12 | WA | - |
testcase_13 | WA | - |
testcase_14 | WA | - |
testcase_15 | WA | - |
testcase_16 | WA | - |
testcase_17 | WA | - |
testcase_18 | WA | - |
testcase_19 | WA | - |
testcase_20 | WA | - |
testcase_21 | WA | - |
testcase_22 | WA | - |
testcase_23 | WA | - |
testcase_24 | WA | - |
testcase_25 | WA | - |
testcase_26 | WA | - |
testcase_27 | WA | - |
testcase_28 | WA | - |
testcase_29 | WA | - |
testcase_30 | AC | 8 ms
5,376 KB |
testcase_31 | WA | - |
testcase_32 | WA | - |
testcase_33 | WA | - |
testcase_34 | WA | - |
testcase_35 | WA | - |
testcase_36 | WA | - |
testcase_37 | WA | - |
testcase_38 | WA | - |
testcase_39 | WA | - |
testcase_40 | WA | - |
testcase_41 | WA | - |
testcase_42 | WA | - |
testcase_43 | WA | - |
testcase_44 | WA | - |
testcase_45 | WA | - |
testcase_46 | WA | - |
testcase_47 | WA | - |
testcase_48 | AC | 8 ms
5,376 KB |
testcase_49 | WA | - |
testcase_50 | WA | - |
testcase_51 | WA | - |
testcase_52 | WA | - |
testcase_53 | WA | - |
testcase_54 | WA | - |
testcase_55 | WA | - |
testcase_56 | WA | - |
testcase_57 | WA | - |
testcase_58 | WA | - |
testcase_59 | WA | - |
testcase_60 | WA | - |
ソースコード
#pragma GCC optimize("O3") #pragma GCC target("avx2") #pragma GCC optimize("unroll-loops") //#pragma GCC optimize ("Ofast") #include <cstdio> #include <vector> using namespace std; #define rep(i, n) for (int i = 0; i < (n); ++i) #define FOR(i, m, n) for (int i = (m); i < (n); ++i) #define rrep(i, n) for (int i = (n)-1; i >= 0; --i) #define rfor(i, m, n) for (int i = (m); i >= (n); --i) using ll = long long; #ifdef _WIN32 #define getchar_unlocked _getchar_nolock #define putchar_unlocked _putchar_nolock #define fwrite_unlocked _fwrite_nolock #define fread_unlocked _fread_nolock #endif #if __has_include("dump.hpp") #include "dump.hpp" #else #define dump(...) ((void)0) #endif // #define USE_FREAD #ifdef USE_FREAD struct Input { static constexpr size_t MAX_SIZE = 4400019; char buf[MAX_SIZE]; size_t i, end; Input() { i = 0; end = fread_unlocked(buf, 1, MAX_SIZE, stdin); } inline int gc() { if (i < end) { return buf[i++]; } else { return EOF; } } } in; #define gc in.gc #else #define gc getchar_unlocked #endif // USE_FREAD // #define USE_FWRITE #ifdef USE_FWRITE struct Output { static constexpr size_t MAX_SIZE = 4000009; char buf[MAX_SIZE]; size_t i = 0; void pc(int c) { buf[i++] = c; } ~Output() { fwrite_unlocked(buf, 1, i, stdout); } } out; #define pc out.pc #else #define pc putchar_unlocked #endif // USE_FWRITE inline void ini(int& v) noexcept { v = 0; char c = gc(); bool f = false; if (c == '-') { f = true; c = gc(); } for (; '0' <= c && c <= '9'; c = gc()) v = v * 10 + (c - '0'); if (f) v = -v; } inline void inui(int& v) noexcept { v = 0; for (char c = gc(); '0' <= c && c <= '9'; c = gc()) v = v * 10 + (c - '0'); } inline void inl(ll& v) noexcept { v = 0; char c = gc(); bool f = false; if (c == '-') { f = true; c = gc(); } for (; '0' <= c && c <= '9'; c = gc()) v = v * 10 + (c - '0'); if (f) v = -v; } inline void inul(ll& v) noexcept { v = 0; for (char c = gc(); '0' <= c && c <= '9'; c = gc()) v = v * 10 + (c - '0'); } inline void ins(char* c, int n) noexcept { while (n--) { *c = gc(); ++c; } } inline void puti(int v) noexcept { if (v < 0) pc('-'), v = -v; char b[10]; int n = 0; while (v) b[n++] = '0' + v % 10, v /= 10; if (!n) b[n++] = '0'; while (n--) pc(b[n]); } inline void putui(int v) noexcept { char b[10]; int n = 0; while (v) b[n++] = '0' + v % 10, v /= 10; if (!n) b[n++] = '0'; while (n--) pc(b[n]); } inline void putl(ll v) noexcept { if (v < 0) pc('-'), v = -v; char b[20]; int n = 0; while (v) b[n++] = '0' + v % 10, v /= 10; if (!n) b[n++] = '0'; while (n--) pc(b[n]); } inline void putul(ll v) noexcept { char b[20]; int n = 0; while (v) b[n++] = '0' + v % 10, v /= 10; if (!n) b[n++] = '0'; while (n--) pc(b[n]); } // ---------------------------------------------------------------- // constexpr ll MOD = 1000000007; inline ll Powmod(ll a, ll n) { ll r = 1; while (n > 0) { if (n & 1) r = r * a % MOD, n--; else a = a * a % MOD, n >>= 1; } return r; } int main() { ll n, m, k; inul(n); inul(m); inul(k); ll acc = 1, x = 0; FOR(i, 1, n + 1) { if (k % i == 0) { x = (x + acc * Powmod(n, n - i)) % MOD; } acc = (acc * (n - i)) % MOD; } if (m == 1) { putul(x); } else { putul((Powmod(n, n) - x) * Powmod(n - 1, MOD - 2) % MOD); } }