結果

問題 No.1973 Divisor Sequence
ユーザー 37zigen37zigen
提出日時 2022-06-10 23:04:39
言語 Java
(openjdk 23)
結果
AC  
実行時間 900 ms / 2,000 ms
コード長 2,784 bytes
コンパイル時間 2,435 ms
コンパイル使用メモリ 78,968 KB
実行使用メモリ 232,152 KB
最終ジャッジ日時 2024-09-21 07:31:32
合計ジャッジ時間 12,238 ms
ジャッジサーバーID
(参考情報)
judge5 / judge1
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
sample AC * 3
other AC * 22
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

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();
}
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0