Visible Lattice Points（欧拉函数）

题目：
A lattice point (x, y) in the first quadrant (x and y are integers greater than or equal to 0), other than the origin, is visible from the origin if the line from (0, 0) to (x, y) does not pass through any other lattice point. For example, the point (4, 2) is not visible since the line from the origin passes through (2, 1). The figure below shows the points (x, y) with 0 ≤ x, y ≤ 5 with lines from the origin to the visible points.

Write a program which, given a value for the size, N, computes the number of visible points (x, y) with 0 ≤ x, y ≤ N.

Input：

The first line of input contains a single integer C (1 ≤ C ≤ 1000) which is the number of datasets that follow.

Each dataset consists of a single line of input containing a single integer N (1 ≤ N ≤ 1000), which is the size.

Output：
For each dataset, there is to be one line of output consisting of: the dataset number starting at 1, a single space, the size, a single space and the number of visible points for that size.

Sample Input：
4
2
4
5
231
Sample Output：
1 2 5
2 4 13
3 5 21
4 231 32549

题意：
在一个左下角坐标为（0，0）的N*N的方格里，连接（0，0）和（x，y）并且不经过其他点的线段有多少条。
题目输入：
第一行一个整数c，表示测试用例数。
接下来c行输入一个整数N。

题目输出：
一行三个整数，用空格隔开，末尾无空格，
第一个为第几个测试用例（从1开始），
第二个为该测试用例的N，
第三个为符合条