結果

問題 No.473 和と積の和
ユーザー uwiuwi
提出日時 2016-12-26 17:19:44
言語 Java21
(openjdk 21)
結果
AC  
実行時間 112 ms / 3,000 ms
コード長 3,591 bytes
コンパイル時間 5,931 ms
コンパイル使用メモリ 80,624 KB
実行使用メモリ 39,424 KB
最終ジャッジ日時 2024-05-09 15:00:58
合計ジャッジ時間 8,821 ms
ジャッジサーバーID
(参考情報)
judge2 / judge1
このコードへのチャレンジ
(要ログイン)

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 53 ms
36,952 KB
testcase_01 AC 55 ms
37,196 KB
testcase_02 AC 53 ms
36,964 KB
testcase_03 AC 84 ms
38,696 KB
testcase_04 AC 54 ms
36,704 KB
testcase_05 AC 53 ms
37,016 KB
testcase_06 AC 53 ms
37,040 KB
testcase_07 AC 53 ms
37,024 KB
testcase_08 AC 53 ms
37,152 KB
testcase_09 AC 53 ms
37,304 KB
testcase_10 AC 52 ms
36,912 KB
testcase_11 AC 53 ms
37,324 KB
testcase_12 AC 54 ms
36,756 KB
testcase_13 AC 54 ms
37,224 KB
testcase_14 AC 53 ms
37,208 KB
testcase_15 AC 53 ms
36,892 KB
testcase_16 AC 54 ms
37,324 KB
testcase_17 AC 53 ms
37,228 KB
testcase_18 AC 54 ms
37,288 KB
testcase_19 AC 52 ms
37,024 KB
testcase_20 AC 54 ms
37,432 KB
testcase_21 AC 53 ms
37,244 KB
testcase_22 AC 52 ms
36,916 KB
testcase_23 AC 55 ms
37,048 KB
testcase_24 AC 55 ms
36,960 KB
testcase_25 AC 112 ms
39,068 KB
testcase_26 AC 79 ms
38,352 KB
testcase_27 AC 82 ms
38,600 KB
testcase_28 AC 56 ms
37,040 KB
testcase_29 AC 55 ms
37,372 KB
testcase_30 AC 53 ms
36,992 KB
testcase_31 AC 54 ms
37,296 KB
testcase_32 AC 52 ms
36,944 KB
testcase_33 AC 52 ms
36,936 KB
testcase_34 AC 102 ms
38,764 KB
testcase_35 AC 96 ms
38,496 KB
testcase_36 AC 55 ms
36,980 KB
testcase_37 AC 55 ms
37,040 KB
testcase_38 AC 96 ms
38,584 KB
testcase_39 AC 89 ms
38,272 KB
testcase_40 AC 91 ms
38,120 KB
testcase_41 AC 100 ms
39,424 KB
testcase_42 AC 92 ms
38,564 KB
testcase_43 AC 91 ms
38,460 KB
testcase_44 AC 105 ms
39,220 KB
testcase_45 AC 54 ms
36,916 KB
testcase_46 AC 54 ms
36,960 KB
権限があれば一括ダウンロードができます

ソースコード

diff #

package adv2016;
import java.io.ByteArrayInputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.InputMismatchException;

public class N473_3 {
	InputStream is;
	PrintWriter out;
	String INPUT = "";
	
	void solve()
	{
		int n = ni(), x = ni();
		x++;
		long[] ds = new long[2000];
		int p = 0;
		for(int d = 1;d*d <= x;d++){
			if(x % d == 0){
				ds[p++] = d;
				if(d*d < x){
					ds[p++] = x/d;
				}
			}
		}
		Arrays.sort(ds, 0, p);
		long[][] dp = new long[n+1][p];
		dp[0][0] = 1;
		for(int i = 1;i < p;i++){
			long d = ds[i];
			int q = 0;
			for(int k = 0;k < p;k++){
				long ne = ds[k] * d;
				while(q < p && ds[q] < ne)q++;
				if(q == p)break;
				if(ds[q] != ne)continue;
				for(int j = 0;j < n;j++){
					dp[j+1][q] += dp[j][k];
				}
			}
		}
		out.println(dp[n][p-1]);
	}

	
	void run() throws Exception
	{
		is = INPUT.isEmpty() ? System.in : new ByteArrayInputStream(INPUT.getBytes());
		out = new PrintWriter(System.out);
		
		long s = System.currentTimeMillis();
		solve();
		out.flush();
		if(!INPUT.isEmpty())tr(System.currentTimeMillis()-s+"ms");
//		Thread t = new Thread(null, null, "~", Runtime.getRuntime().maxMemory()){
//			@Override
//			public void run() {
//				long s = System.currentTimeMillis();
//				solve();
//				out.flush();
//				if(!INPUT.isEmpty())tr(System.currentTimeMillis()-s+"ms");
//			}
//		};
//		t.start();
//		t.join();
	}
	
	public static void main(String[] args) throws Exception { new N473_3().run(); }
	
	private byte[] inbuf = new byte[1024];
	public int lenbuf = 0, ptrbuf = 0;
	
	private int readByte()
	{
		if(lenbuf == -1)throw new InputMismatchException();
		if(ptrbuf >= lenbuf){
			ptrbuf = 0;
			try { lenbuf = is.read(inbuf); } catch (IOException e) { throw new InputMismatchException(); }
			if(lenbuf <= 0)return -1;
		}
		return inbuf[ptrbuf++];
	}
	
	private boolean isSpaceChar(int c) { return !(c >= 33 && c <= 126); }
	private int skip() { int b; while((b = readByte()) != -1 && isSpaceChar(b)); return b; }
	
	private double nd() { return Double.parseDouble(ns()); }
	private char nc() { return (char)skip(); }
	
	private String ns()
	{
		int b = skip();
		StringBuilder sb = new StringBuilder();
		while(!(isSpaceChar(b))){ // when nextLine, (isSpaceChar(b) && b != ' ')
			sb.appendCodePoint(b);
			b = readByte();
		}
		return sb.toString();
	}
	
	private char[] ns(int n)
	{
		char[] buf = new char[n];
		int b = skip(), p = 0;
		while(p < n && !(isSpaceChar(b))){
			buf[p++] = (char)b;
			b = readByte();
		}
		return n == p ? buf : Arrays.copyOf(buf, p);
	}
	
	private int[] na(int n)
	{
		int[] a = new int[n];
		for(int i = 0;i < n;i++)a[i] = ni();
		return a;
	}
	
	private long[] nal(int n)
	{
		long[] a = new long[n];
		for(int i = 0;i < n;i++)a[i] = nl();
		return a;
	}
	
	private char[][] nm(int n, int m) {
		char[][] map = new char[n][];
		for(int i = 0;i < n;i++)map[i] = ns(m);
		return map;
	}
	
	private int[][] nmi(int n, int m) {
		int[][] map = new int[n][];
		for(int i = 0;i < n;i++)map[i] = na(m);
		return map;
	}
	
	private int ni() { return (int)nl(); }
	
	private long nl()
	{
		long num = 0;
		int b;
		boolean minus = false;
		while((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'));
		if(b == '-'){
			minus = true;
			b = readByte();
		}
		
		while(true){
			if(b >= '0' && b <= '9'){
				num = num * 10 + (b - '0');
			}else{
				return minus ? -num : num;
			}
			b = readByte();
		}
	}
	
	private static void tr(Object... o) { System.out.println(Arrays.deepToString(o)); }
}
0