結果
問題 | No.2326 Factorial to the Power of Factorial to the... |
ユーザー |
![]() |
提出日時 | 2023-05-28 13:46:12 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 3 ms / 2,000 ms |
コード長 | 2,880 bytes |
コンパイル時間 | 1,174 ms |
コンパイル使用メモリ | 129,856 KB |
最終ジャッジ日時 | 2025-02-13 10:16:42 |
ジャッジサーバーID (参考情報) |
judge2 / judge5 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 2 |
other | AC * 20 |
コンパイルメッセージ
main.cpp: In function ‘int main()’: main.cpp:112:10: warning: ignoring return value of ‘int scanf(const char*, ...)’ declared with attribute ‘warn_unused_result’ [-Wunused-result] 112 | scanf("%d%d", &n, &p); | ~~~~~^~~~~~~~~~~~~~~~
ソースコード
#include <string.h>#include <algorithm>#include <array>#include <bitset>#include <cassert>#include <chrono>#include <ciso646>#include <climits>#include <cmath>#include <complex>#include <cstdio>#include <functional>#include <iomanip>#include <iostream>#include <map>#include <numeric>#include <optional>#include <queue>#include <random>#include <set>#include <stack>#include <string>#include <unordered_map>#include <unordered_set>#include <utility>#include <vector>#define REP_OVERLOAD(arg1, arg2, arg3, arg4, NAME, ...) NAME#define REP3(i, l, r, s) \for (int i = int(l), rep3_r = int(r), rep3_s = int(s); i < rep3_r; \i += rep3_s)#define REP2(i, l, r) REP3(i, l, r, 1)#define REP1(i, n) REP2(i, 0, n)#define rep(...) REP_OVERLOAD(__VA_ARGS__, REP3, REP2, REP1, )(__VA_ARGS__)#define repin(i, l, r) for (int i = int(l), repin_r = int(r); i <= repin_r; ++i)#define RREP_OVERLOAD(arg1, arg2, arg3, arg4, NAME, ...) NAME#define RREP3(i, l, r, s) \for (int i = int(r) - 1, rrep3_l = int(l), rrep3_s = int(s); i >= rrep3_l; \i -= rrep3_s)#define RREP2(i, l, r) RREP3(i, l, r, 1)#define RREP1(i, n) RREP2(i, 0, n)#define rrep(...) RREP_OVERLOAD(__VA_ARGS__, RREP3, RREP2, RREP1, )(__VA_ARGS__)#define rrepin(i, l, r) \for (int i = int(r), rrepin_l = int(l); i >= rrepin_l; --i)#define fi first#define se second#include <atcoder/modint>#include <algorithm>#include <cassert>#include <vector>namespace rklib {template <class T>bool chmax(T &a, const T &b) {if (a < b) {a = b;return true;}return false;}template <class T>bool chmin(T &a, const T &b) {if (a > b) {a = b;return true;}return false;}template <class T>bool chmin_non_negative(T &a, const T &b) {if (a < 0 || a > b) {a = b;return true;}return false;}template <class T>T div_floor(T num, T den) {if (den < 0) num = -num, den = -den;return num >= 0 ? num / den : (num + 1) / den - 1;}template <class T>T div_ceil(T num, T den) {if (den < 0) num = -num, den = -den;return num <= 0 ? num / den : (num - 1) / den + 1;}} // namespace rklibusing namespace std;using namespace rklib;using lint = long long;using pii = pair<int, int>;using pll = pair<lint, lint>;using mint = atcoder::modint1000000007;int main() {int n, p;scanf("%d%d", &n, &p);mint cnt = 0;{int tmp = n;while (tmp > 0) {cnt += tmp / p;tmp /= p;}}mint base = 1;lint power = 1;repin(i, 1, n) {base *= i;power = power * i % (mint::mod() - 1);}auto ans = base.pow(power) * cnt;printf("%u\n", ans.val());}