結果
問題 | No.502 階乗を計算するだけ |
ユーザー |
|
提出日時 | 2023-09-27 16:57:40 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 49 ms / 1,000 ms |
コード長 | 2,451 bytes |
コンパイル時間 | 3,497 ms |
コンパイル使用メモリ | 250,088 KB |
最終ジャッジ日時 | 2025-02-17 02:37:30 |
ジャッジサーバーID (参考情報) |
judge2 / judge1 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
other | AC * 52 |
ソースコード
#include <bits/stdc++.h>#include <atcoder/all>using ll = long long;#define rep(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)#define reps(i, n) for (int i = 1, i##_len = (n); i <= i##_len; ++i)#define rrep(i, n) for (int i = ((int)(n)-1); i >= 0; --i)#define rreps(i, n) for (int i = ((int)(n)); i > 0; --i)#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)#define repc2(i, s, n) for (int i = (s); i <= (int)(n); i++)constexpr int inf = 2000'000'000;constexpr ll linf = 4000000000000000000ll;constexpr ll M7 = 1000000007ll;constexpr ll M09 = 1000000009ll;constexpr ll M9 = 998244353ll;#define all(v) begin(v), end(v)#define rall(v) rbegin(v), rend(v)using namespace std;using namespace atcoder;constexpr ll M = 1000000007ll;constexpr ll B = 10'000'000;// int main() {// ll factorial = 1;// cout << 1 << ",\n";// for (ll i = 1; i <= M; ++i) {// factorial = factorial * i % M;// if (i % B == 0) cout << factorial << ",\n";// }// }constexpr ll factorialMemo[] = {1, 682498929, 491101308, 76479948, 723816384, 67347853, 27368307, 625544428, 199888908, 888050723, 927880474, 281863274, 661224977, 623534362,970055531, 261384175, 195888993, 66404266, 547665832, 109838563, 933245637, 724691727, 368925948, 268838846, 136026497, 112390913, 135498044,217544623, 419363534, 500780548, 668123525, 128487469, 30977140, 522049725, 309058615, 386027524, 189239124, 148528617, 940567523, 917084264,429277690, 996164327, 358655417, 568392357, 780072518, 462639908, 275105629, 909210595, 99199382, 703397904, 733333339, 97830135, 608823837,256141983, 141827977, 696628828, 637939935, 811575797, 848924691, 131772368, 724464507, 272814771, 326159309, 456152084, 903466878, 92255682,769795511, 373745190, 606241871, 825871994, 957939114, 435887178, 852304035, 663307737, 375297772, 217598709, 624148346, 671734977, 624500515,748510389, 203191898, 423951674, 629786193, 672850561, 814362881, 823845496, 116667533, 256473217, 627655552, 245795606, 586445753, 172114298,193781724, 778983779, 83868974, 315103615, 965785236, 492741665, 377329025, 847549272, 698611116,};int main() {ios_base::sync_with_stdio(false);cin.tie(NULL);ll n;cin >> n;if (n >= M) {cout << 0 << endl;} else {ll ans = factorialMemo[n / B];for (ll i = n / B * B + 1; i <= n; ++i) ans = ans * i % M;cout << ans << endl;}return 0;}