結果

問題 No.1835 Generalized Monty Hall Problem
ユーザー shojin_proshojin_pro
提出日時 2022-02-11 21:56:36
言語 Java21
(openjdk 21)
結果
AC  
実行時間 92 ms / 1,000 ms
コード長 3,710 bytes
コンパイル時間 3,299 ms
コンパイル使用メモリ 89,188 KB
実行使用メモリ 40,160 KB
最終ジャッジ日時 2024-06-27 18:24:04
合計ジャッジ時間 5,229 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge2
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 79 ms
38,152 KB
testcase_01 AC 81 ms
38,856 KB
testcase_02 AC 80 ms
39,908 KB
testcase_03 AC 79 ms
38,824 KB
testcase_04 AC 91 ms
39,008 KB
testcase_05 AC 92 ms
38,824 KB
testcase_06 AC 79 ms
38,728 KB
testcase_07 AC 79 ms
39,676 KB
testcase_08 AC 82 ms
38,732 KB
testcase_09 AC 80 ms
39,804 KB
testcase_10 AC 91 ms
39,804 KB
testcase_11 AC 90 ms
38,676 KB
testcase_12 AC 80 ms
40,060 KB
testcase_13 AC 81 ms
38,268 KB
testcase_14 AC 81 ms
40,160 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

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

public class Main {
    static FastScanner sc = new FastScanner(System.in);
    static PrintWriter pw = new PrintWriter(System.out);
    static StringBuilder sb = new StringBuilder();
    static long mod = (long) 1e9 + 7;

    public static void main(String[] args) throws Exception {
        solve();
        pw.flush();
    }

    public static void solve() {
        long N = sc.nextInt();
        long M = sc.nextInt();
        long K = sc.nextInt();
        long numer = M*(N-M) + (M-1)*M;
        long denom = (N-K-1)*N;
        long gcd = gcd(numer,denom);
        numer /= gcd;
        denom /= gcd;
        pw.println(numer + " " + denom);
    }
    
    private static long gcd(long a, long b)
    {
        while (b > 0)
        {
            long temp = b;
            b = a % b; // % is remainder
            a = temp;
        }
        return a;
    }
    static class GeekInteger {
        public static void save_sort(int[] array) {
            shuffle(array);
            Arrays.sort(array);
        }

        public static int[] shuffle(int[] array) {
            int n = array.length;
            Random random = new Random();
            for (int i = 0, j; i < n; i++) {
                j = i + random.nextInt(n - i);
                int randomElement = array[j];
                array[j] = array[i];
                array[i] = randomElement;
            }
            return array;
        }

        public static void save_sort(long[] array) {
            shuffle(array);
            Arrays.sort(array);
        }

        public static long[] shuffle(long[] array) {
            int n = array.length;
            Random random = new Random();
            for (int i = 0, j; i < n; i++) {
                j = i + random.nextInt(n - i);
                long randomElement = array[j];
                array[j] = array[i];
                array[i] = randomElement;
            }
            return array;
        }

    }
}

class FastScanner {
    private BufferedReader reader = null;
    private StringTokenizer tokenizer = null;

    public FastScanner(InputStream in) {
        reader = new BufferedReader(new InputStreamReader(in));
        tokenizer = null;
    }

    public FastScanner(FileReader in) {
        reader = new BufferedReader(in);
        tokenizer = null;
    }

    public String next() {
        if (tokenizer == null || !tokenizer.hasMoreTokens()) {
            try {
                tokenizer = new StringTokenizer(reader.readLine());
            } catch (IOException e) {
                throw new RuntimeException(e);
            }
        }
        return tokenizer.nextToken();
    }

    public String nextLine() {
        if (tokenizer == null || !tokenizer.hasMoreTokens()) {
            try {
                return reader.readLine();
            } catch (IOException e) {
                throw new RuntimeException(e);
            }
        }
        return tokenizer.nextToken("\n");
    }

    public long nextLong() {
        return Long.parseLong(next());
    }

    public int nextInt() {
        return Integer.parseInt(next());
    }

    public double nextDouble() {
        return Double.parseDouble(next());
    }

    public String[] nextArray(int n) {
        String[] a = new String[n];
        for (int i = 0; i < n; i++)
            a[i] = next();
        return a;
    }

    public int[] nextIntArray(int n) {
        int[] a = new int[n];
        for (int i = 0; i < n; i++)
            a[i] = nextInt();
        return a;
    }

    public long[] nextLongArray(int n) {
        long[] a = new long[n];
        for (int i = 0; i < n; i++)
            a[i] = nextLong();
        return a;
    }
}
0