結果
問題 | No.502 階乗を計算するだけ |
ユーザー |
|
提出日時 | 2017-05-05 01:21:42 |
言語 | C++14 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 56 ms / 1,000 ms |
コード長 | 2,402 bytes |
コンパイル時間 | 1,616 ms |
コンパイル使用メモリ | 166,548 KB |
実行使用メモリ | 5,376 KB |
最終ジャッジ日時 | 2024-09-14 07:18:45 |
合計ジャッジ時間 | 3,399 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge6 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
other | AC * 52 |
ソースコード
#include <bits/stdc++.h>#define FOR(i, a, b) for (int i = (a); i < (b); i++)#define RFOR(i, a, b) for (int i = (b)-1; i >= (a); i--)#define rep(i, n) for (int i = 0; i < (n); i++)#define rep1(i, n) for (int i = 1; i <= (n); i++)#define rrep(i, n) for (int i = (n)-1; i >= 0; i--)#define pb push_back#define mp make_pair#define fst first#define snd second#define show(x) cout << #x << " = " << x << endl#define chmin(x, y) x = min(x, y)#define chmax(x, y) x = max(x, y)#define pii pair<int, int>#define vi vector<int>using namespace std;template <class S, class T>ostream& operator<<(ostream& o, const pair<S, T>& p){return o << "(" << p.first << "," << p.second << ")";}template <class T>ostream& operator<<(ostream& o, const vector<T>& vc){o << "sz = " << vc.size() << endl<< "[";for (const T& v : vc)o << v << ",";o << "]";return o;}using ll = long long;constexpr ll MOD = 1000000007LL;constexpr ll DATA[101] = {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(){ll n;cin >> n;if (n >= MOD) {cout << 0 << endl;return 0;}const ll m = n / 10000000LL;const ll l = n % 10000000LL;ll s = DATA[m];for (ll i = 1; i <= l; i++) {s = (s * (m * 10000000LL + i)) % MOD;}cout << s << endl;return 0;}