Submission #110905

---

Source Code Expand

import java.util.HashMap;
import java.util.Map;
import java.util.Scanner;
import java.util.ArrayList;
import java.util.Arrays;

public class Main {
	
	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		
		int[] pos_x = new int[3];
		int[] pos_y = new int[3];
		
		for(int i = 0; i < 3; i++){
			final int x = sc.nextInt();
			final int y = sc.nextInt();
			
			pos_x[i] = x;
			pos_y[i] = y;
		}
		
		double[] dists = new double[3];
		for(int i = 0; i < 3; i++){
			final int cur = i;
			final int next = (i + 1) % 3;
			
			final int x_diff = (pos_x[cur] - pos_x[next]) * (pos_x[cur] - pos_x[next]);
			final int y_diff = (pos_y[cur] - pos_y[next]) * (pos_y[cur] - pos_y[next]);
			
			final double dist = Math.sqrt(x_diff + y_diff);
			
			dists[i] = dist;
		}
		
		final double s = (dists[0] + dists[1] + dists[2]) / 2;
		
		System.out.printf("%.2f\n", Math.sqrt(s * (s - dists[0]) * (s - dists[1]) * (s - dists[2])));
		
		sc.close();
	}

}

Submission Info

Judge Result