Pairwise different distances
Medium
Execution time limit is 4 seconds
Runtime memory usage limit is 64 megabytes
For a given natural number N it is required to construct the set of N points of the Cartesian plane with integer coordinates such that all pairwise distances between points would be different.
Input
The only line of the input file contains a natural number N ≤ 200, defining the number of points in a set.
Ooutput
In the output file you should write coordinates of points of a constructed set (each points should be in single line, its coordinates should be separated by space). Coordinates of points can not exceed 800 by absolute value. It is provided that there exists such set. If there are many sets satisfying conditions, you can output any of them.
Examples
Input #1
Answer #1
Submissions 83
Acceptance rate 19%