結果

問題 No.1659 Product of Divisors
ユーザー nishi5451nishi5451
提出日時 2021-09-07 18:10:21
言語 Java21
(openjdk 21)
結果
WA  
実行時間 -
コード長 4,421 bytes
コンパイル時間 3,121 ms
コンパイル使用メモリ 75,500 KB
実行使用メモリ 50,540 KB
最終ジャッジ日時 2023-08-25 04:00:32
合計ジャッジ時間 5,714 ms
ジャッジサーバーID
（参考情報） 		judge15 / judge14
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 43 ms
49,340 KB
testcase_01 AC 45 ms
49,412 KB
testcase_02 AC 44 ms
49,448 KB
testcase_03 AC 44 ms
49,400 KB
testcase_04 AC 44 ms
49,472 KB
testcase_05 AC 44 ms
49,304 KB
testcase_06 AC 44 ms
49,304 KB
testcase_07 AC 45 ms
47,652 KB
testcase_08 AC 45 ms
49,492 KB
testcase_09 WA -
testcase_10 WA -
testcase_11 AC 44 ms
49,316 KB
testcase_12 WA -
testcase_13 AC 43 ms
49,400 KB
testcase_14 WA -
testcase_15 AC 45 ms
49,192 KB
testcase_16 AC 45 ms
49,200 KB
testcase_17 AC 44 ms
49,704 KB
testcase_18 AC 43 ms
49,380 KB
testcase_19 AC 44 ms
49,216 KB
testcase_20 WA -
testcase_21 WA -
testcase_22 AC 62 ms
50,540 KB
testcase_23 WA -
testcase_24 WA -
権限があれば一括ダウンロードができます

ソースコード

diff # 

import java.util.*;
import java.io.*;

class Mod {
	private static int MOD = 1000000007;
	private static long[] fac, finv, inv;
	private static int combSize;

	static void setMod(int mod){
		MOD = mod;
	}
	static int mod(){
		return MOD;
	}
	static long pow(long p, long n){
		long ret = 1;
		while(n > 0){
			if((n & 1) == 1) ret = ret * p % MOD;
			p = p * p % MOD;
			n >>= 1;
		}
		return ret;
	}
	static long factorial(int n){
		long ret = 1;
		for(int i = 2; i <= n; i++) ret = ret * i % MOD;
		return ret;
	}
	static long inverse(long a){
		long b = MOD, u = 1, v = 0;
		while(b > 0){
			long t = a / b;
			a -= t * b;
			long tmp1 = a; a = b; b = tmp1;
			u -= t * v;
			long tmp2 = u; u = v; v = tmp2;
		}
		u %= MOD;
		if(u < 0) u += MOD;
		return u;
	}
	static void initTable(int n){
		combSize = n+1;
		fac = new long[combSize];
		finv = new long[combSize];
		inv = new long[combSize];
		fac[0] = fac[1] = 1;
		finv[0] = finv[1] = 1;
		inv[1] = 1;
		for(int i = 2; i < combSize; i++){
			fac[i] = fac[i-1] * i % MOD;
			inv[i] = MOD - inv[MOD%i] * (MOD / i) % MOD;
			finv[i] = finv[i-1] * inv[i] % MOD;
		}
	}
	static long comb(int n, int k){
		if(n < k) return 0;
		if(n < 0 || k < 0) return 0;
		return fac[n] * (finv[k] * finv[n-k] % MOD) % MOD;
	}
	static long perm(int n, int k){
		if(n < k) return 0;
		if(n < 0 || k < 0) return 0;
		return fac[n] * finv[n-k] % MOD;
	}
	static long homo(int n, int r){
		if(n < 0 || r < 0) return 0;
		return comb(n+r-1, r);
	}
}

public class Main {
	static final int INF = 1<<30;
	static final long INFL = 1L<<60;
	static final int MOD = 1000000007;
	static final int MOD2 = 998244353;
	static List<List<Integer>> g;
	
	public static void main(String[] args) {
		FastScanner fs = new FastScanner();
		PrintWriter pw = new PrintWriter(System.out);
		// 9 2
		// 12 = 2^2 * 3^1
		// {1,1}
		// oo||
		// o||
		long n = fs.nextLong();
		long k = fs.nextLong();
		Map<Long,Integer> map = new HashMap<>();
		for(long i = 2; i*i <= n; i++){
			while(n%i == 0){
				if(map.containsKey(i)){
					map.put(i,map.get(i)+1);
				} else {
					map.put(i,1);
				}
				n /= i;
			}
		}
		if(n != 1) map.put(n,1);

		long ans = 1;
		for(int el : map.values()){
			// k+el C el = (k+el)*(k+el-1)*...*(k+1) / el!
			for(int i = 0; i < el; i++){
				ans *= (k+el-i);
				ans %= MOD;
			}
			for(int i = 1; i <= el; i++){
				ans *= Mod.inverse(i);
				ans %= MOD;
			}
		}
		pw.println(ans);
		pw.close();
	}
}

class FastScanner {
	private InputStream in = System.in;
	private byte[] buffer = new byte[1024];
	private int length = 0, p = 0;
	private boolean hasNextByte() {
		if (p < length) return true;
		else{
			p = 0;
			try{
				length = in.read(buffer);
			}catch(Exception e){
				e.printStackTrace();
			}
			if(length == 0) return false;
		}
		return true;
	}
	private int readByte() {
		if (hasNextByte() == true) return buffer[p++];
		return -1;
	}
	private static boolean isPrintable(int n) {
		return 33 <= n && n <= 126;
	}
	private void skip() {
		while (hasNextByte() && !isPrintable(buffer[p])) p++;
	}
	public boolean hasNext() {
		skip();
		return hasNextByte();
	}
	public String next() {
		if(!hasNext()) throw new NoSuchElementException();
		StringBuilder sb = new StringBuilder();
		int temp = readByte();
		while (isPrintable(temp)) {
			sb.appendCodePoint(temp);
			temp = readByte();
		}
		return sb.toString();
	}
	public int nextInt() {
		return Math.toIntExact(nextLong());
	}
	public int[] nextInts(int n) {
		int[] ar = new int[n];
		for (int i = 0; i < n; i++) ar[i] = nextInt();
		return ar;
	}
	public long[] nextLongs(int n) {
		long[] ar = new long[n];
		for (int i = 0; i < n; i++) ar[i] = nextLong();
		return ar;
	}
	public long nextLong() {
		if(!hasNext()) throw new NoSuchElementException();
		boolean minus = false;
		int temp = readByte();
		if (temp == '-') {
			minus = true;
			temp = readByte();
		}
		if (temp < '0' || '9' < temp) throw new NumberFormatException();
		long n = 0;
		while (isPrintable(temp)) {
			if ('0' <= temp && temp <= '9') {
				n *= 10;
				n += temp - '0';
			}
			temp = readByte();
		}
		return minus ? -n : n;
	}
	public char[] nextChars() {
		String s = next();
		return s.toCharArray();
	}
	public char[][] nextCharMat(int h, int w) {
		char[][] ar = new char[h][w];
		for(int i = 0; i < h; i++){
			String s = next();
			for(int j = 0; j < w; j++){
				ar[i][j] = s.charAt(j);
			}
		}
		return ar;
	}
}
0