結果

問題 No.811 約数の個数の最大化
ユーザー k_6101k_6101
提出日時 2019-12-08 20:43:59
言語 Java
(openjdk 23)
結果
AC  
実行時間 1,013 ms / 2,000 ms
コード長 3,000 bytes
コンパイル時間 2,790 ms
コンパイル使用メモリ 82,464 KB
実行使用メモリ 108,788 KB
最終ジャッジ日時 2024-12-31 13:20:38
合計ジャッジ時間 10,676 ms
ジャッジサーバーID
(参考情報)
judge2 / judge3
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
sample AC * 3
other AC * 12
権限があれば一括ダウンロードができます

ソースコード

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

import java.io.InputStream;
import java.io.PrintWriter;
import java.lang.reflect.Array;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.Collections;
import java.util.HashMap;
import java.util.HashSet;
import java.util.List;
import java.util.Map;
import java.util.Map.Entry;
import java.util.PriorityQueue;
import java.util.Scanner;
import java.util.Set;
import java.util.Stack;
import java.util.TreeMap;
import java.util.TreeSet;
import static java.util.Comparator.*;
public class Main {
public static void main(String[] args) {
PrintWriter out = new PrintWriter(System.out);
Solver solver = new Solver(System.in, out);
solver.solve();
out.close();
}
}
class Solver {
Scanner sc;
PrintWriter out;
public Solver(InputStream in, PrintWriter out) {
sc = new Scanner(in);
this.out = out;
}
// ==================================================================
//
Map<Long, Long> dec(long n){
//  ans.get(3) == 2 
Map<Long, Long> ans = new HashMap<Long, Long>();
long num = n;
Long wk = 0L;
//    
for(long i = 2; i * i <= n && num != 1; ++i){
// i
while(num % i == 0){
num /= i;
wk = ans.get(i);
if(wk == null) {
ans.put(i, 1L);
} else {
ans.replace(i, (wk+1L));
}
}
}
if(num != 1) {
wk = ans.get(num);//
if(wk == null) {
ans.put(num, 1L);
} else {
ans.replace(num, (wk+1L));
}
}
return ans;
}
Map<Long, Map<Long, Long>> DEC = new HashMap<>();
public void solve() {
long N = Integer.parseInt(sc.next());
int K = Integer.parseInt(sc.next());
for (long i = 1; i <= N; i++) {
DEC.put(i, dec(i));
}
long cnt, max = -1, ans = -1, wk;
for (long i = 1; i < N; i++) {
if(DEC.get(i) == null) continue;
cnt = 0;
for (long key : DEC.get(N).keySet()) {
if(DEC.get(i).get(key) == null) continue;
// out.println(" i = " + i + " key = " + key + " min("
// + DEC.get(i).get(key) + ", " + DEC.get(N).get(key) + ")");
cnt += Math.min(DEC.get(i).get(key), DEC.get(N).get(key));
}
// out.println("[" + i + "] = " + cnt);
if(cnt < K) continue;
wk = 1;
for (long key : DEC.get(i).keySet()) {
wk *= (DEC.get(i).get(key) + 1);
}
// out.println("[" + i + "] = " + wk);
if(max < wk) { max = wk; ans = i; }
}
out.println(ans);
}
// ==================================================================
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0