|시간 제한||메모리 제한||제출||정답||맞은 사람||정답 비율|
|3 초 (추가 시간 없음)||512 MB||6||4||3||60.000%|
We say a set of points are concyclic if they all lie on the circumference of a circle. The task is: given an integer n, find a circle centered at (0, 0) such that there are at least n distinct concyclic integral points lying on it.
Note: Integral points are points with integral coordinates.
The input is a line containing a positive integer n.
Output n + 1 lines. The first line contains an integer r indicating the radius of the circle. Each of the following lines contains two integers x and y such that point (x, y) lies on the circle.
100 100 0
5 5 0 0 5 -5 0 3 4 3 -4 -3 -4 -3 4