結果
問題 | No.502 階乗を計算するだけ |
ユーザー |
![]() |
提出日時 | 2017-04-12 02:42:23 |
言語 | C++11 (gcc 13.3.0) |
結果 |
AC
|
実行時間 | 48 ms / 1,000 ms |
コード長 | 2,108 bytes |
コンパイル時間 | 500 ms |
コンパイル使用メモリ | 85,260 KB |
実行使用メモリ | 5,376 KB |
最終ジャッジ日時 | 2024-07-18 09:09:41 |
合計ジャッジ時間 | 1,885 ms |
ジャッジサーバーID (参考情報) |
judge3 / judge5 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
other | AC * 52 |
ソースコード
/* -*- coding: utf-8 -*-** 502.cc: No.502 階乗を計算するだけ - yukicoder*/#include<cstdio>#include<cstdlib>#include<cstring>#include<cmath>#include<iostream>#include<string>#include<vector>#include<map>#include<set>#include<stack>#include<list>#include<queue>#include<deque>#include<algorithm>#include<numeric>#include<utility>#include<complex>#include<functional>using namespace std;/* constant */typedef long long ll;const ll MOD = 1000000007;const ll D = 10000000;const ll frcs[] = {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};/* typedef *//* global variables *//* subroutines */void seeds() {ll f = 1;printf("1");for (ll i = 1; i < MOD; i++) {f = (f * i) % MOD;if (i % D == 0) printf(", %lld", f);}putchar('\n');exit(0);}/* main */int main() {//seeds(); return 0;ll n;cin >> n;if (n >= MOD) {puts("0");return 0;}ll f = frcs[n / D];for (ll i = n / D * D + 1; i <= n; i++)f = (f * i) % MOD;printf("%lld\n", f);return 0;}