Disc District
시간 제한: 3000ms메모리 제한: 1024MB출처: NCPC 2022BOJ 26027
문제
You live in the Disc District of Flatland and work for the Nearest Convenient Plot Company (NCPC). Your job is to find the nearest convenient plot of land outside of the Disc District to build on.
The Disc District can be described as a disc on a plane with center and some radius . So a point is outside of the Disc District if the (Euclidean) distance from it to the origin is strictly larger than . A point on the plane is a convenient plot if and are integers.
입력
The only line of the input contains a single integer ().
출력
The output should contain a single line with two integers, the and coordinates of a convenient building location that is closest to the Disc District. If there are more than one answer, output any of them.
예제
예제 1
입력
1
출력
1 1
예제 2
입력
8
출력
4 7
예제 3
입력
90210
출력
69551 57450
이 문제는 채점 준비 중입니다. 테스트 데이터가 확보되면 제출이 가능합니다.