포럼
문제 COCI00312

Klopka

설명

The city of Osijek has recently been plagued by a swarm of mosquitoes. The solution to this problem was proposed long ago by Mr. Perić, a brave inventor from Benkovci, in an episode of the TV-show Gitak called "Globalno sjelo". Among other inspiring inventions, he presented a mosquito trap. It is basically a box which you cover the mosquito after it falls for the piece of cheese or "kajmak" you placed there, depending on what your mosquitoes prefer. Simple, isn't it?

If you're lucky, the box can cover more than one mosquito. You have spotted \(N\) mosquitoes on the table and know their positions precisely. What is the area of the smallest square-shaped box that can, placed parallel to the sides of the table, cover all the mosquitoes? The box of course, can cover the mosquito with its edge.

제약
입력 형식

The first line of input contains the integer \(N\) \((2 \le N \le 20)\), the number of spotted mosquitoes.

Each of the following \(N\) lines contains the positions of mosquitoes as space-separated integer coordinates \(X\) and \(Y\) \((1 \le X, Y \le 100)\) in an imaginary coordinate system whose axes are the sides of the table. At least two mosquitoes will be in different positions.

출력 형식

The first and only line of output must contain the required area of the smallest square-shaped box (expressed, of course, in unit squares of the aforementioned coordinate system).

예제 1
입력
3
3 4
5 7
4 3
출력
16
예제 2
입력
4
1 5
5 1
10 5
5 10
출력
81
문제 정보

생성자가 기록되지 않았습니다.

출처 COCI 2014/2015 Contest 1

평가 및 의견

Klopka

개요
출제자 난이도 Unrated 레이팅 미적용 의견 0 / 1 공개 집계 (커뮤니티 난이도, 주요 주제, 품질)는 의견이 충분히 모이면 공개됩니다.

Log in to rate problems.

개별 의견

아직 의견이 없습니다. 자격이 된다면 위 양식에서 가장 먼저 평가해 보세요.

풀이 제출

Klopka

게스트로 둘러보고 있습니다. 로그인하면 풀이를 제출하고 진행 상황을 확인할 수 있습니다. 로그인하고 제출하기
공개
C++20 Tab 들여쓰기 · Ctrl+/ 주석 토글 · Enter 자동 들여쓰기
1 1 1 0 공백: 4 · UTF-8