結果
問題 | No.890 移調の限られた旋法 |
ユーザー | uwi |
提出日時 | 2019-09-20 21:34:29 |
言語 | Java21 (openjdk 21) |
結果 |
AC
|
実行時間 | 173 ms / 2,000 ms |
コード長 | 4,501 bytes |
コンパイル時間 | 6,024 ms |
コンパイル使用メモリ | 82,044 KB |
実行使用メモリ | 72,848 KB |
最終ジャッジ日時 | 2023-10-12 18:11:30 |
合計ジャッジ時間 | 11,690 ms |
ジャッジサーバーID (参考情報) |
judge12 / judge11 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 135 ms
68,728 KB |
testcase_01 | AC | 135 ms
68,616 KB |
testcase_02 | AC | 135 ms
68,648 KB |
testcase_03 | AC | 135 ms
68,772 KB |
testcase_04 | AC | 135 ms
68,576 KB |
testcase_05 | AC | 135 ms
68,624 KB |
testcase_06 | AC | 135 ms
67,032 KB |
testcase_07 | AC | 135 ms
68,596 KB |
testcase_08 | AC | 135 ms
68,536 KB |
testcase_09 | AC | 140 ms
68,796 KB |
testcase_10 | AC | 135 ms
68,632 KB |
testcase_11 | AC | 135 ms
68,620 KB |
testcase_12 | AC | 135 ms
68,620 KB |
testcase_13 | AC | 173 ms
72,496 KB |
testcase_14 | AC | 158 ms
72,484 KB |
testcase_15 | AC | 160 ms
72,128 KB |
testcase_16 | AC | 169 ms
72,848 KB |
testcase_17 | AC | 166 ms
71,692 KB |
testcase_18 | AC | 172 ms
71,720 KB |
testcase_19 | AC | 160 ms
69,224 KB |
testcase_20 | AC | 152 ms
69,032 KB |
testcase_21 | AC | 141 ms
68,628 KB |
testcase_22 | AC | 153 ms
70,068 KB |
testcase_23 | AC | 163 ms
71,936 KB |
testcase_24 | AC | 149 ms
66,848 KB |
testcase_25 | AC | 147 ms
68,784 KB |
testcase_26 | AC | 158 ms
71,796 KB |
testcase_27 | AC | 163 ms
72,228 KB |
testcase_28 | AC | 154 ms
69,700 KB |
testcase_29 | AC | 148 ms
68,620 KB |
testcase_30 | AC | 162 ms
71,736 KB |
testcase_31 | AC | 158 ms
69,068 KB |
testcase_32 | AC | 169 ms
71,440 KB |
testcase_33 | AC | 172 ms
72,008 KB |
testcase_34 | AC | 169 ms
71,660 KB |
ソースコード
package contest190920; import java.io.ByteArrayInputStream; import java.io.IOException; import java.io.InputStream; import java.io.PrintWriter; import java.util.Arrays; import java.util.InputMismatchException; public class D { InputStream is; PrintWriter out; String INPUT = ""; void solve() { int n = ni(), K = ni(); int mod = 1000000007; int[][] fif = enumFIF(2000000, mod); long[] x = new long[n+1]; for(int d = 1;d < n;d++) { if(n % d == 0) { if(K % (n/d) == 0) { int u = K / (n/d); x[d] = C(d, u, mod, fif); } } } long ans =0; for(int d = 1;d < n;d++) { if(n % d == 0 && K % (n/d) == 0) { for(int e = d*2;e <= n;e+=d) { x[e] -= x[d]; } ans += x[d]; } } ans %= mod; if(ans < 0)ans += mod; out.println(ans); } public static long C(int n, int r, int mod, int[][] fif) { if (n < 0 || r < 0 || r > n) return 0; return (long) fif[0][n] * fif[1][r] % mod * fif[1][n - r] % mod; } public static int[][] enumFIF(int n, int mod) { int[] f = new int[n + 1]; int[] invf = new int[n + 1]; f[0] = 1; for (int i = 1; i <= n; i++) { f[i] = (int) ((long) f[i - 1] * i % mod); } long a = f[n]; long b = mod; long p = 1, q = 0; while (b > 0) { long c = a / b; long d; d = a; a = b; b = d % b; d = p; p = q; q = d - c * q; } invf[n] = (int) (p < 0 ? p + mod : p); for (int i = n - 1; i >= 0; i--) { invf[i] = (int) ((long) invf[i + 1] * (i + 1) % mod); } return new int[][] { f, invf }; } public static long pow(long a, long n, long mod) { // a %= mod; long ret = 1; int x = 63 - Long.numberOfLeadingZeros(n); for (; x >= 0; x--) { ret = ret * ret % mod; if (n << 63 - x < 0) ret = ret * a % mod; } return ret; } void run() throws Exception { is = INPUT.isEmpty() ? System.in : new ByteArrayInputStream(INPUT.getBytes()); out = new PrintWriter(System.out); long s = System.currentTimeMillis(); solve(); out.flush(); if(!INPUT.isEmpty())tr(System.currentTimeMillis()-s+"ms"); // Thread t = new Thread(null, null, "~", Runtime.getRuntime().maxMemory()){ // @Override // public void run() { // long s = System.currentTimeMillis(); // solve(); // out.flush(); // if(!INPUT.isEmpty())tr(System.currentTimeMillis()-s+"ms"); // } // }; // t.start(); // t.join(); } public static void main(String[] args) throws Exception { new D().run(); } private byte[] inbuf = new byte[1024]; public int lenbuf = 0, ptrbuf = 0; private int readByte() { if(lenbuf == -1)throw new InputMismatchException(); if(ptrbuf >= lenbuf){ ptrbuf = 0; try { lenbuf = is.read(inbuf); } catch (IOException e) { throw new InputMismatchException(); } if(lenbuf <= 0)return -1; } return inbuf[ptrbuf++]; } private boolean isSpaceChar(int c) { return !(c >= 33 && c <= 126); } private int skip() { int b; while((b = readByte()) != -1 && isSpaceChar(b)); return b; } private double nd() { return Double.parseDouble(ns()); } private char nc() { return (char)skip(); } private String ns() { int b = skip(); StringBuilder sb = new StringBuilder(); while(!(isSpaceChar(b))){ // when nextLine, (isSpaceChar(b) && b != ' ') sb.appendCodePoint(b); b = readByte(); } return sb.toString(); } private char[] ns(int n) { char[] buf = new char[n]; int b = skip(), p = 0; while(p < n && !(isSpaceChar(b))){ buf[p++] = (char)b; b = readByte(); } return n == p ? buf : Arrays.copyOf(buf, p); } private int[] na(int n) { int[] a = new int[n]; for(int i = 0;i < n;i++)a[i] = ni(); return a; } private long[] nal(int n) { long[] a = new long[n]; for(int i = 0;i < n;i++)a[i] = nl(); return a; } private char[][] nm(int n, int m) { char[][] map = new char[n][]; for(int i = 0;i < n;i++)map[i] = ns(m); return map; } private int[][] nmi(int n, int m) { int[][] map = new int[n][]; for(int i = 0;i < n;i++)map[i] = na(m); return map; } private int ni() { return (int)nl(); } private long nl() { long num = 0; int b; boolean minus = false; while((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-')); if(b == '-'){ minus = true; b = readByte(); } while(true){ if(b >= '0' && b <= '9'){ num = num * 10 + (b - '0'); }else{ return minus ? -num : num; } b = readByte(); } } private static void tr(Object... o) { System.out.println(Arrays.deepToString(o)); } }