結果
問題 | No.502 階乗を計算するだけ |
ユーザー |
![]() |
提出日時 | 2017-04-08 00:30:07 |
言語 | Java (openjdk 23) |
結果 |
AC
|
実行時間 | 221 ms / 1,000 ms |
コード長 | 5,285 bytes |
コンパイル時間 | 2,629 ms |
コンパイル使用メモリ | 77,956 KB |
実行使用メモリ | 51,976 KB |
最終ジャッジ日時 | 2024-07-16 03:33:25 |
合計ジャッジ時間 | 7,470 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge4 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
other | AC * 52 |
ソースコード
import java.io.IOException;import java.io.InputStream;import java.util.NoSuchElementException;public class Main {public static void main(String[] args) {FastScanner sc = new FastScanner();long N = sc.nextLong();int[] 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,};int mod = 1000000000 + 7;if (N >= mod) {System.out.println(0);} else {int idx = (int)(N / 10000000);long now = data[idx];for (long i = 10000000L * idx + 1; i <= N; i ++) {now *= i;now %= mod;}System.out.println(now);}}}class FastScanner {public static String debug = null;private final InputStream in = System.in;private int ptr = 0;private int buflen = 0;private byte[] buffer = new byte[1024];private boolean eos = false;private boolean hasNextByte() {if (ptr < buflen) {return true;} else {ptr = 0;try {if (debug != null) {buflen = debug.length();buffer = debug.getBytes();debug = "";eos = true;} else {buflen = in.read(buffer);}} catch (IOException e) {e.printStackTrace();}if (buflen < 0) {eos = true;return false;} else if (buflen == 0) {return false;}}return true;}private int readByte() {if (hasNextByte())return buffer[ptr++];elsereturn -1;}private static boolean isPrintableChar(int c) {return 33 <= c && c <= 126;}private void skipUnprintable() {while (hasNextByte() && !isPrintableChar(buffer[ptr]))ptr++;}public boolean isEOS() {return this.eos;}public boolean hasNext() {skipUnprintable();return hasNextByte();}public String next() {if (!hasNext())throw new NoSuchElementException();StringBuilder sb = new StringBuilder();int b = readByte();while (isPrintableChar(b)) {sb.appendCodePoint(b);b = readByte();}return sb.toString();}public long nextLong() {if (!hasNext())throw new NoSuchElementException();long n = 0;boolean minus = false;int b = readByte();if (b == '-') {minus = true;b = readByte();}if (b < '0' || '9' < b) {throw new NumberFormatException();}while (true) {if ('0' <= b && b <= '9') {n *= 10;n += b - '0';} else if (b == -1 || !isPrintableChar(b)) {return minus ? -n : n;} else {throw new NumberFormatException();}b = readByte();}}public int nextInt() {return (int) nextLong();}public long[] nextLongList(int n) {return nextLongTable(1, n)[0];}public int[] nextIntList(int n) {return nextIntTable(1, n)[0];}public long[][] nextLongTable(int n, int m) {long[][] ret = new long[n][m];for (int i = 0; i < n; i++) {for (int j = 0; j < m; j++) {ret[i][j] = nextLong();}}return ret;}public int[][] nextIntTable(int n, int m) {int[][] ret = new int[n][m];for (int i = 0; i < n; i++) {for (int j = 0; j < m; j++) {ret[i][j] = nextInt();}}return ret;}}