結果

問題 No.847 Divisors of Power
ユーザー OlandOland
提出日時 2019-07-06 03:10:34
言語 Java21
(openjdk 21)
結果
AC  
実行時間 73 ms / 2,000 ms
コード長 4,490 bytes
コンパイル時間 2,526 ms
コンパイル使用メモリ 82,120 KB
実行使用メモリ 37,396 KB
最終ジャッジ日時 2024-10-06 23:36:33
合計ジャッジ時間 5,023 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge1
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 53 ms
37,200 KB
testcase_01 AC 54 ms
37,112 KB
testcase_02 AC 53 ms
37,084 KB
testcase_03 AC 53 ms
37,184 KB
testcase_04 AC 55 ms
37,240 KB
testcase_05 AC 52 ms
37,120 KB
testcase_06 AC 52 ms
37,220 KB
testcase_07 AC 53 ms
36,932 KB
testcase_08 AC 54 ms
37,200 KB
testcase_09 AC 54 ms
37,272 KB
testcase_10 AC 51 ms
36,792 KB
testcase_11 AC 53 ms
36,988 KB
testcase_12 AC 54 ms
37,200 KB
testcase_13 AC 52 ms
37,136 KB
testcase_14 AC 53 ms
37,164 KB
testcase_15 AC 62 ms
37,396 KB
testcase_16 AC 54 ms
37,196 KB
testcase_17 AC 54 ms
37,048 KB
testcase_18 AC 54 ms
37,256 KB
testcase_19 AC 53 ms
37,240 KB
testcase_20 AC 54 ms
37,072 KB
testcase_21 AC 60 ms
37,148 KB
testcase_22 AC 53 ms
37,064 KB
testcase_23 AC 53 ms
37,240 KB
testcase_24 AC 73 ms
37,344 KB
testcase_25 AC 53 ms
37,248 KB
testcase_26 AC 53 ms
37,220 KB
testcase_27 AC 54 ms
37,272 KB
testcase_28 AC 53 ms
37,200 KB
testcase_29 AC 53 ms
37,000 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

import java.io.*;
import java.lang.reflect.Array;
import java.util.*;
import java.util.Map.Entry;
import java.util.function.Function;
import java.util.stream.Collectors;

@SuppressWarnings("unused")
public class Main {
	FastScanner in = new FastScanner(System.in);
	PrintWriter out = new PrintWriter(System.out);
	final int MOD = (int)1e9+7;
	
	int ans = 0;
	int N, K, M;
	ArrayList<long[]> p;
	
	//System.out.println();はつかわない！！
	void solve() throws Exception{
		N = in.nextInt(); K = in.nextInt(); M = in.nextInt();
		p = primeFactor(N);
		bfs(p.size()-1, 1);
		out.println(ans);
	}
	
	void bfs(int index, long d){
		if(index == -1){
			ans++;
			return;
		}
		long f = 1, num = p.get(index)[0], cnt = p.get(index)[1];
		for(int i = 0; i <= cnt * K; i++){
			if(d * f > M) break;
			bfs(index - 1, d * f);
			f *= num;
		}
	}
	
	ArrayList<long[]> primeFactor(long n){
		ArrayList<long[]> p = new ArrayList<>();
		for(long i = 2; i * i <= n; i++){
			if(n % i == 0){
				int cnt = 0;
				while (n % i == 0) {
					n /= i;
					cnt++;
				}
				p.add(new long[]{i, cnt});
			}
		}
		if(n > 1) p.add(new long[]{n, 1});
		return p;
	}
	
	public static void main(String[] args) throws Exception {
		new Main().m();
	}
	
	void m() throws Exception {
		solve();
		out.flush();
	}
	
	class FastScanner {
		Reader input;

		FastScanner() {this(System.in);}
		FastScanner(InputStream stream) {this.input = new BufferedReader(new InputStreamReader(stream));}
		
		int nextInt() {return (int) nextLong();}

		long nextLong() {
			try {
				int sign = 1;
				int b = input.read();
				while ((b < '0' || '9' < b) && b != '-' && b != '+') {
					b = input.read();
				}
				if (b == '-') {
					sign = -1;
					b = input.read();
				} else if (b == '+') {
					b = input.read();
				}
				long ret = b - '0';
				while (true) {
					b = input.read();
					if (b < '0' || '9' < b) return ret * sign;
					ret *= 10;
					ret += b - '0';
				}
			} catch (IOException e) {
				e.printStackTrace();
				return -1;
			}
		}

		double nextDouble() {
			try {
				double sign = 1;
				int b = input.read();
				while ((b < '0' || '9' < b) && b != '-' && b != '+') {
					b = input.read();
				}
				if (b == '-') {
					sign = -1;
					b = input.read();
				} else if (b == '+') {
					b = input.read();
				}
				double ret = b - '0';
				while (true) {
					b = input.read();
					if (b < '0' || '9' < b) break;
					ret *= 10;
					ret += b - '0';
				}
				if (b != '.') return sign * ret;
				double div = 1;
				b = input.read();
				while ('0' <= b && b <= '9') {
					ret *= 10;
					ret += b - '0';
					div *= 10;
					b = input.read();
				}
				return sign * ret / div;
			} catch (IOException e) {
				e.printStackTrace();
				return Double.NaN;
			}
		}

		char nextChar() {
			try {
				int b = input.read();
				while (Character.isWhitespace(b)) {
					b = input.read();
				}
				return (char) b;
			} catch (IOException e) {
				e.printStackTrace();
				return 0;
			}
		}

		String nextStr() {
			try {
				StringBuilder sb = new StringBuilder();
				int b = input.read();
				while (Character.isWhitespace(b)) {
					b = input.read();
				}
				while (b != -1 && !Character.isWhitespace(b)) {
					sb.append((char) b);
					b = input.read();
				}
				return sb.toString();
			} catch (IOException e) {
				e.printStackTrace();
				return "";
			}
		}
		
		public int[] nextIntArray(int n) {
			int[] res = new int[n];
			for (int i = 0; i < n; i++) {
				res[i] = nextInt();
			}
			return res;
		}
 
		public int[] nextIntArrayDec(int n) {
			int[] res = new int[n];
			for (int i = 0; i < n; i++) {
				res[i] = nextInt() - 1;
			}
			return res;
		}
 
		public int[] nextIntArray1Index(int n) {
			int[] res = new int[n + 1];
			for (int i = 0; i < n; i++) {
				res[i + 1] = nextInt();
			}
			return res;
		}
 
		public long[] nextLongArray(int n) {
			long[] res = new long[n];
			for (int i = 0; i < n; i++) {
				res[i] = nextLong();
			}
			return res;
		}
 
		public long[] nextLongArrayDec(int n) {
			long[] res = new long[n];
			for (int i = 0; i < n; i++) {
				res[i] = nextLong() - 1;
			}
			return res;
		}
 
		public long[] nextLongArray1Index(int n) {
			long[] res = new long[n + 1];
			for (int i = 0; i < n; i++) {
				res[i + 1] = nextLong();
			}
			return res;
		}
 
		public double[] nextDoubleArray(int n) {
			double[] res = new double[n];
			for (int i = 0; i < n; i++) {
				res[i] = nextDouble();
			}
			return res;
		}
	}
}
/* end Main */
0