結果
問題 | No.1973 Divisor Sequence |
ユーザー | 37zigen |
提出日時 | 2022-06-10 23:01:29 |
言語 | Java21 (openjdk 21) |
結果 |
TLE
|
実行時間 | - |
コード長 | 2,808 bytes |
コンパイル時間 | 3,026 ms |
コンパイル使用メモリ | 79,268 KB |
実行使用メモリ | 242,128 KB |
最終ジャッジ日時 | 2023-10-21 05:38:50 |
合計ジャッジ時間 | 13,687 ms |
ジャッジサーバーID (参考情報) |
judge15 / judge12 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 140 ms
59,056 KB |
testcase_01 | AC | 136 ms
59,060 KB |
testcase_02 | AC | 505 ms
87,576 KB |
testcase_03 | AC | 199 ms
61,492 KB |
testcase_04 | AC | 375 ms
81,180 KB |
testcase_05 | AC | 197 ms
66,356 KB |
testcase_06 | AC | 375 ms
90,104 KB |
testcase_07 | AC | 231 ms
62,320 KB |
testcase_08 | AC | 291 ms
69,776 KB |
testcase_09 | AC | 334 ms
70,544 KB |
testcase_10 | AC | 378 ms
89,124 KB |
testcase_11 | AC | 202 ms
59,892 KB |
testcase_12 | AC | 351 ms
88,356 KB |
testcase_13 | AC | 228 ms
64,308 KB |
testcase_14 | AC | 342 ms
83,668 KB |
testcase_15 | AC | 441 ms
90,464 KB |
testcase_16 | AC | 469 ms
93,184 KB |
testcase_17 | AC | 358 ms
90,528 KB |
testcase_18 | AC | 179 ms
59,552 KB |
testcase_19 | AC | 434 ms
101,056 KB |
testcase_20 | AC | 213 ms
60,272 KB |
testcase_21 | AC | 432 ms
89,736 KB |
testcase_22 | AC | 390 ms
90,476 KB |
testcase_23 | TLE | - |
testcase_24 | -- | - |
ソースコード
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+1]; dp[0][0]=1; for (int i=0;i<N;++i) { int ni=i+1; for (int e=0;e<=E;++e) { for (int ne=0;e+ne<=E;++ne) { dp[ni][ne]+=dp[i][e]; 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(); } }