結果
問題 | No.644 G L C C D M |
ユーザー | 37zigen |
提出日時 | 2018-04-08 15:08:56 |
言語 | Java21 (openjdk 21) |
結果 |
AC
|
実行時間 | 87 ms / 2,000 ms |
コード長 | 2,924 bytes |
コンパイル時間 | 2,220 ms |
コンパイル使用メモリ | 78,044 KB |
実行使用メモリ | 51,588 KB |
最終ジャッジ日時 | 2024-06-26 20:22:42 |
合計ジャッジ時間 | 4,556 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge2 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 53 ms
50,308 KB |
testcase_01 | AC | 54 ms
50,136 KB |
testcase_02 | AC | 53 ms
50,032 KB |
testcase_03 | AC | 52 ms
49,840 KB |
testcase_04 | AC | 53 ms
49,856 KB |
testcase_05 | AC | 53 ms
50,176 KB |
testcase_06 | AC | 52 ms
50,264 KB |
testcase_07 | AC | 54 ms
50,232 KB |
testcase_08 | AC | 52 ms
50,232 KB |
testcase_09 | AC | 52 ms
50,352 KB |
testcase_10 | AC | 52 ms
50,180 KB |
testcase_11 | AC | 51 ms
50,392 KB |
testcase_12 | AC | 52 ms
50,340 KB |
testcase_13 | AC | 57 ms
49,780 KB |
testcase_14 | AC | 56 ms
50,128 KB |
testcase_15 | AC | 54 ms
50,340 KB |
testcase_16 | AC | 54 ms
50,252 KB |
testcase_17 | AC | 52 ms
49,864 KB |
testcase_18 | AC | 53 ms
49,972 KB |
testcase_19 | AC | 53 ms
50,552 KB |
testcase_20 | AC | 52 ms
50,296 KB |
testcase_21 | AC | 53 ms
50,324 KB |
testcase_22 | AC | 87 ms
51,588 KB |
testcase_23 | AC | 80 ms
51,564 KB |
testcase_24 | AC | 68 ms
51,216 KB |
testcase_25 | AC | 57 ms
50,244 KB |
testcase_26 | AC | 58 ms
50,444 KB |
ソースコード
import java.io.File; import java.io.FileNotFoundException; import java.io.IOException; import java.io.InputStream; import java.io.PrintWriter; import java.util.Arrays; import java.util.NoSuchElementException; public class Main implements Runnable { public static void main(String[] args) { new Thread(null, new Main(), "", Runtime.getRuntime().maxMemory()).start(); } final long mod = 1_000_000_000 + 7; public void run() { Scanner sc = new Scanner(); int n = sc.nextInt(); int m = sc.nextInt(); if (m >= n) { System.out.println(0); return; } int x = n / m; long[] f = new long[x + 1]; for (int i = 2; i < f.length; ++i) f[i] = i; for (int i = 2; i < f.length; ++i) { if (f[i] == i) { for (int j = i; j < f.length; j += i) { f[j] = f[j] / i * (i - 1); } } } long ans = 0; for (int i = 1; i <= x; ++i) { ans = (ans + f[i]) % mod; } long fac = 1; for (int i = 2; i <= n - 2; ++i) fac = fac * i % mod; ans = 2 * ans % mod * fac % mod; System.out.println(ans); } class Scanner { private final InputStream in = System.in; private final byte[] buffer = new byte[1024]; private int ptr = 0; private int buflen = 0; private boolean hasNextByte() { if (ptr < buflen) { return true; } else { ptr = 0; try { buflen = in.read(buffer); } catch (IOException e) { e.printStackTrace(); } if (buflen <= 0) { return false; } } return true; } private int readByte() { if (hasNextByte()) return buffer[ptr++]; else return -1; } private boolean isPrintableChar(int c) { return 33 <= c && c <= 126; } public boolean hasNext() { while (hasNextByte() && !isPrintableChar(buffer[ptr])) ptr++; 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() { long nl = nextLong(); if (nl < Integer.MIN_VALUE || nl > Integer.MAX_VALUE) throw new NumberFormatException(); return (int) nl; } public double nextDouble() { return Double.parseDouble(next()); } } static void tr(Object... objects) { System.out.println(Arrays.deepToString(objects)); } }