結果
問題 | No.1973 Divisor Sequence |
ユーザー | tenten |
提出日時 | 2023-07-24 17:34:52 |
言語 | Java21 (openjdk 21) |
結果 |
AC
|
実行時間 | 86 ms / 2,000 ms |
コード長 | 3,388 bytes |
コンパイル時間 | 2,271 ms |
コンパイル使用メモリ | 90,124 KB |
実行使用メモリ | 39,324 KB |
最終ジャッジ日時 | 2024-10-01 12:42:46 |
合計ジャッジ時間 | 4,313 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge3 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 48 ms
37,348 KB |
testcase_01 | AC | 49 ms
36,948 KB |
testcase_02 | AC | 48 ms
37,184 KB |
testcase_03 | AC | 49 ms
37,312 KB |
testcase_04 | AC | 43 ms
37,156 KB |
testcase_05 | AC | 64 ms
38,604 KB |
testcase_06 | AC | 44 ms
37,348 KB |
testcase_07 | AC | 55 ms
37,904 KB |
testcase_08 | AC | 44 ms
36,908 KB |
testcase_09 | AC | 44 ms
37,252 KB |
testcase_10 | AC | 43 ms
37,116 KB |
testcase_11 | AC | 43 ms
37,184 KB |
testcase_12 | AC | 46 ms
37,160 KB |
testcase_13 | AC | 43 ms
36,952 KB |
testcase_14 | AC | 45 ms
37,256 KB |
testcase_15 | AC | 42 ms
37,256 KB |
testcase_16 | AC | 43 ms
37,324 KB |
testcase_17 | AC | 44 ms
37,040 KB |
testcase_18 | AC | 42 ms
36,916 KB |
testcase_19 | AC | 43 ms
37,048 KB |
testcase_20 | AC | 46 ms
37,156 KB |
testcase_21 | AC | 44 ms
37,044 KB |
testcase_22 | AC | 42 ms
36,820 KB |
testcase_23 | AC | 86 ms
39,324 KB |
testcase_24 | AC | 44 ms
37,212 KB |
ソースコード
import java.io.*; import java.util.*; import java.util.stream.*; public class Main { static final int MOD = 1000000007; public static void main(String[] args) throws Exception { Scanner sc = new Scanner(); int n = sc.nextInt() - 1; long m = sc.nextLong(); HashMap<Long, Integer> counts = new HashMap<>(); for (long i = 2; i <= Math.sqrt(m); i++) { while (m % i == 0) { counts.put(i, counts.getOrDefault(i, 0) + 1); m /= i; } } if (m > 1) { counts.put(m, 1); } long result = 1; for (int x : counts.values()) { long[][][] matrix = new long[20][x + 1][x + 1]; for (int i = 0; i <= x; i++) { for (int j = 0; j + i <= x; j++) { matrix[0][i][j] = 1; } } for (int i = 1; i < 20; i++) { for (int a = 0; a <= x; a++) { for (int b = 0; b <= x; b++) { for (int c = 0; c <= x; c++) { matrix[i][a][c] += matrix[i - 1][a][b] * matrix[i - 1][b][c] % MOD; matrix[i][a][c] %= MOD; } } } } long[] ans = new long[x + 1]; int current = n; Arrays.fill(ans, 1); for (int i = 19; i >= 0; i--) { if (current < (1 << i)) { continue; } current -= (1 << i); long[] next = new long[x + 1]; for (int a = 0; a <= x; a++) { for (int b = 0; b <= x; b++) { next[a] += matrix[i][a][b] * ans[b] % MOD; next[a] %= MOD; } } ans = next; } long tmp = 0; for (long y : ans) { tmp += y; tmp %= MOD; } result *= tmp; result %= MOD; } System.out.println(result); } } class Utilities { static String arrayToLineString(Object[] arr) { return Arrays.stream(arr).map(x -> x.toString()).collect(Collectors.joining("\n")); } static String arrayToLineString(int[] arr) { return String.join("\n", Arrays.stream(arr).mapToObj(String::valueOf).toArray(String[]::new)); } } class Scanner { BufferedReader br = new BufferedReader(new InputStreamReader(System.in)); StringTokenizer st = new StringTokenizer(""); StringBuilder sb = new StringBuilder(); public Scanner() throws Exception { } public int nextInt() throws Exception { return Integer.parseInt(next()); } public long nextLong() throws Exception { return Long.parseLong(next()); } public double nextDouble() throws Exception { return Double.parseDouble(next()); } public int[] nextIntArray() throws Exception { return Stream.of(br.readLine().split(" ")).mapToInt(Integer::parseInt).toArray(); } public String next() throws Exception { while (!st.hasMoreTokens()) { st = new StringTokenizer(br.readLine()); } return st.nextToken(); } }