結果
問題 | No.1973 Divisor Sequence |
ユーザー | 37zigen |
提出日時 | 2022-06-10 23:04:39 |
言語 | Java21 (openjdk 21) |
結果 |
AC
|
実行時間 | 886 ms / 2,000 ms |
コード長 | 2,784 bytes |
コンパイル時間 | 3,694 ms |
コンパイル使用メモリ | 79,496 KB |
実行使用メモリ | 237,012 KB |
最終ジャッジ日時 | 2023-10-21 06:22:22 |
合計ジャッジ時間 | 13,293 ms |
ジャッジサーバーID (参考情報) |
judge12 / judge9 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 139 ms
56,932 KB |
testcase_01 | AC | 137 ms
57,108 KB |
testcase_02 | AC | 494 ms
118,368 KB |
testcase_03 | AC | 177 ms
59,896 KB |
testcase_04 | AC | 355 ms
87,340 KB |
testcase_05 | AC | 211 ms
70,836 KB |
testcase_06 | AC | 363 ms
87,652 KB |
testcase_07 | AC | 192 ms
62,100 KB |
testcase_08 | AC | 256 ms
70,412 KB |
testcase_09 | AC | 342 ms
88,500 KB |
testcase_10 | AC | 388 ms
90,048 KB |
testcase_11 | AC | 177 ms
64,208 KB |
testcase_12 | AC | 325 ms
90,048 KB |
testcase_13 | AC | 201 ms
68,240 KB |
testcase_14 | AC | 286 ms
85,564 KB |
testcase_15 | AC | 448 ms
99,488 KB |
testcase_16 | AC | 424 ms
89,940 KB |
testcase_17 | AC | 329 ms
90,096 KB |
testcase_18 | AC | 177 ms
61,712 KB |
testcase_19 | AC | 427 ms
90,884 KB |
testcase_20 | AC | 185 ms
62,220 KB |
testcase_21 | AC | 398 ms
103,140 KB |
testcase_22 | AC | 392 ms
92,724 KB |
testcase_23 | AC | 835 ms
237,012 KB |
testcase_24 | AC | 886 ms
133,588 KB |
ソースコード
import java.io.IOException; import java.io.InputStream; import java.io.PrintWriter; import java.util.ArrayList; import java.util.Arrays; import java.util.NoSuchElementException; import java.util.Scanner; public class Main implements Runnable { public static void main(String[] args) throws IOException { new Thread(null, new Main(), "", Runtime.getRuntime().maxMemory()).start(); } long mod=(long)1e9+7; long solve(int N, int E) { long[][] dp=new long[N+1][E+2]; dp[0][0]=1; for (int i=0;i<N;++i) { int ni=i+1; for (int ne=E;ne>=0;--ne) { dp[ni][ne]=dp[ni][ne+1]+dp[i][E-ne]; dp[ni][ne]%=mod; } } long ans=0; for (int e=0;e<=E;++e) ans=(ans+dp[N][e])%mod; return ans; } public void run() { Scanner sc = new Scanner(System.in); PrintWriter pw = new PrintWriter(System.out); int N=sc.nextInt(); long M=sc.nextLong(); long ans=1; for (long p=2;p*p<=M;++p) { int e=0; while (M%p==0) { M/=p; ++e; } if (e>0) { ans=ans*solve(N, e)%mod; } } if (M>1) ans=ans*solve(N, 1)%mod; System.out.println(ans); } static void tr(Object... objects) { System.out.println(Arrays.deepToString(objects)); } } class FastScanner { 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 static boolean isPrintableChar(int c) { return 33 <= c && c <= 126; } private void skipUnprintable() { while (hasNextByte() && !isPrintableChar(buffer[ptr])) ptr++; } 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(); } }