結果

問題 No.1487 ぺんぎんさんかっけー
ユーザー shojin_proshojin_pro
提出日時 2021-04-23 21:58:41
言語 Java21
(openjdk 21)
結果
AC  
実行時間 45 ms / 1,000 ms
コード長 4,120 bytes
コンパイル時間 2,223 ms
コンパイル使用メモリ 75,204 KB
実行使用メモリ 50,056 KB
最終ジャッジ日時 2023-09-17 12:10:55
合計ジャッジ時間 5,289 ms
ジャッジサーバーID
（参考情報） 		judge11 / judge14
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 45 ms
49,476 KB
testcase_01 AC 45 ms
49,576 KB
testcase_02 AC 44 ms
49,588 KB
testcase_03 AC 44 ms
49,464 KB
testcase_04 AC 44 ms
49,612 KB
testcase_05 AC 44 ms
49,472 KB
testcase_06 AC 45 ms
49,468 KB
testcase_07 AC 44 ms
49,596 KB
testcase_08 AC 44 ms
49,600 KB
testcase_09 AC 43 ms
47,820 KB
testcase_10 AC 44 ms
49,868 KB
testcase_11 AC 45 ms
49,488 KB
testcase_12 AC 44 ms
49,508 KB
testcase_13 AC 45 ms
49,812 KB
testcase_14 AC 45 ms
49,612 KB
testcase_15 AC 44 ms
47,448 KB
testcase_16 AC 45 ms
49,648 KB
testcase_17 AC 43 ms
49,488 KB
testcase_18 AC 44 ms
49,528 KB
testcase_19 AC 45 ms
49,652 KB
testcase_20 AC 44 ms
50,056 KB
testcase_21 AC 44 ms
49,512 KB
testcase_22 AC 45 ms
49,548 KB
testcase_23 AC 44 ms
49,708 KB
testcase_24 AC 45 ms
49,612 KB
testcase_25 AC 44 ms
49,616 KB
testcase_26 AC 44 ms
49,452 KB
testcase_27 AC 45 ms
49,980 KB
testcase_28 AC 45 ms
49,576 KB
testcase_29 AC 43 ms
49,680 KB
testcase_30 AC 45 ms
49,492 KB
testcase_31 AC 44 ms
49,592 KB
testcase_32 AC 45 ms
49,496 KB
testcase_33 AC 45 ms
47,520 KB
testcase_34 AC 45 ms
49,584 KB
testcase_35 AC 45 ms
49,576 KB
testcase_36 AC 45 ms
49,584 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() {
        int a = sc.nextInt(),b = sc.nextInt(), c = sc.nextInt();
        double s = (a+b+c)/2d;
        pw.println(Math.sqrt(s*(s-a)*(s-b)*(s-c))/4d);
    }

    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;
        }

    }
    
    private static long gcd(long a, long b)
    {
        while (b > 0)
        {
            long temp = b;
            b = a % b; // % is remainder
            a = temp;
        }
        return a;
    }
    
    private static long gcd(long[] input)
    {
        long result = input[0];
        for(int i = 1; i < input.length; i++)
        {
            result = gcd(result, input[i]);
        }
        return result;
    }
    
    private static long lcm(long a, long b)
    {
        return a * (b / gcd(a, b));
    }
    
    private static long lcm(long[] input)
    {
        long result = input[0];
        for(int i = 1; i < input.length; i++)
        {
            result = lcm(result, input[i]);
        }
        return result;
    }
}

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