Submission #1382319

---

Source Code Expand

import java.util.Scanner;

class Point{
    int x, y;

    public double distance(Point q){
        return Math.sqrt(Math.pow(this.x-q.x, 2) + Math.pow(this.y-q.y, 2));
    }
}

public class Main {
    public static void main(String args[]) {
        Scanner sc = new Scanner(System.in);
        int N = sc.nextInt();
        Point points[] = new Point[N];
        for (int i = 0; i < N; i++){
            points[i] = new Point();
            points[i].x = sc.nextInt();
            points[i].y = sc.nextInt();
        }
        double max = 0;
        for (int i = 0; i < N; i++){
            for (int j = i + 1; j < N; j++){
                double tmp = points[i].distance(points[j]);
                if (tmp > max) max = tmp;
            }
        }
        System.out.printf("%.6f\n", max);
    }
}

Submission Info

Judge Result