結果
問題 | No.502 階乗を計算するだけ |
ユーザー |
👑 |
提出日時 | 2019-01-27 00:40:55 |
言語 | D (dmd 2.109.1) |
結果 |
AC
|
実行時間 | 63 ms / 1,000 ms |
コード長 | 2,792 bytes |
コンパイル時間 | 893 ms |
コンパイル使用メモリ | 118,640 KB |
実行使用メモリ | 5,376 KB |
最終ジャッジ日時 | 2024-06-13 03:44:25 |
合計ジャッジ時間 | 2,724 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge2 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
other | AC * 52 |
ソースコード
import std.conv, std.stdio, std.string;import std.algorithm, std.array, std.bigint, std.container, std.math, std.numeric, std.range, std.regex, std.typecons;import core.bitop;class EOFException : Throwable { this() { super("EOF"); } }string[] tokens;string readToken() { for (; tokens.empty; ) { if (stdin.eof) { throw new EOFException; } tokens = readln.split; } auto token = tokens.front; tokens.popFront; return token; }int readInt() { return readToken.to!int; }long readLong() { return readToken.to!long; }real readReal() { return readToken.to!real; }bool chmin(T)(ref T t, in T f) { if (t > f) { t = f; return true; } else { return false; } }bool chmax(T)(ref T t, in T f) { if (t < f) { t = f; return true; } else { return false; } }int binarySearch(T)(in T[] as, in bool delegate(T) test) { int low = -1, upp = cast(int)(as.length); for (; low + 1 < upp; ) { int mid = (low + upp)>> 1; (test(as[mid]) ? low : upp) = mid; } return upp; }int lowerBound(T)(in T[] as, in T val) { return as.binarySearch((T a) => (a < val)); }int upperBound(T)(in T[] as, in T val) { return as.binarySearch((T a) => (a <= val)); }enum MO = 10L^^9 + 7;enum L = 10L^^7;enum long[] DATA =[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, 0];void main() {/*long[] data = [1];long f = 1;for (long n = 0; n < MO; n += L) {foreach (i; n + 1 .. n + L + 1) {(f *= i) %= MO;}data ~= f;}writeln(data);return;//*/try {for (; ; ) {const N = readLong();long ans;if (N < MO) {ans = DATA[cast(size_t)(N / L)];foreach (i; N / L * L + 1 .. N + 1) {(ans *= i) %= MO;}}writeln(ans);}} catch (EOFException e) {}}