結果

問題 No.1809 Divide NCK
ユーザー tenten
提出日時 2023-07-20 09:49:02
言語 Java
(openjdk 23)
結果
AC  
実行時間 75 ms / 2,000 ms
コード長 2,730 bytes
コンパイル時間 5,176 ms
コンパイル使用メモリ 87,628 KB
実行使用メモリ 51,744 KB
最終ジャッジ日時 2024-09-20 06:36:59
合計ジャッジ時間 6,837 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge2
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 3
other AC * 39
権限があれば一括ダウンロードができます

ソースコード

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

import java.io.*;
import java.util.*;
import java.util.stream.*;
public class Main {
    public static void main(String[] args) throws Exception {
        Scanner sc = new Scanner();
        long n = sc.nextLong();
        long k = sc.nextLong();
        long m = sc.nextLong();
        HashMap<Long, Integer> contents = new HashMap<>();
        for (long i = 2; i <= Math.sqrt(m); i++) {
            while (m % i == 0) {
                contents.put(i, contents.getOrDefault(i, 0) + 1);
                m /= i;
            }
        }
        if (m > 1) {
            contents.put(m, 1);
        }
        HashMap<Long, Long> child = getMap(n, contents);
        HashMap<Long, Long> mother = getMap(k, contents);
        HashMap<Long, Long> father = getMap(n - k, contents);
        long ans = Long.MAX_VALUE;
        for (long x : contents.keySet()) {
            ans = Math.min(ans, (child.get(x) - mother.get(x) - father.get(x)) / contents.get(x));
        }
        System.out.println(ans);
    }
    
    static HashMap<Long, Long> getMap(long value, HashMap<Long, Integer> base)  {
        HashMap<Long, Long> ans = new HashMap<>();
        for (long x : base.keySet()) {
            long current = x;
            long count = 0;
            while (true) {
                count += value / current;
                if (value / x < current) {
                    break;
                }
                current *= x;
            }
            ans.put(x, count);
        }
        return ans;
    }
}
class Utilities {
    static String arrayToLineString(Object[] arr) {
        return Arrays.stream(arr).map(x -> x.toString()).collect(Collectors.joining("\n"));
    }
    
    static String arrayToLineString(int[] arr) {
        return String.join("\n", Arrays.stream(arr).mapToObj(String::valueOf).toArray(String[]::new));
    }
}
class Scanner {
    BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
    StringTokenizer st = new StringTokenizer("");
    StringBuilder sb = new StringBuilder();
    
    public Scanner() throws Exception {
        
    }
    
    public int nextInt() throws Exception {
        return Integer.parseInt(next());
    }
    
    public long nextLong() throws Exception {
        return Long.parseLong(next());
    }
    
    public double nextDouble() throws Exception {
        return Double.parseDouble(next());
    }
    
    public int[] nextIntArray() throws Exception {
        return Stream.of(br.readLine().split(" ")).mapToInt(Integer::parseInt).toArray();
    }
    
    public String next() throws Exception {
        while (!st.hasMoreTokens()) {
            st = new StringTokenizer(br.readLine());
        }
        return st.nextToken();
    }
    
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0