POJ 3090

Visible Lattice Points

Time Limit: 1000MS		Memory Limit: 65536K
Total Submissions: 5356		Accepted: 3136

Description

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

 

先画个图发现那些可见得点关于y=x对称

下三角中

并且除去x=0

每一行的可见点x，y互质

个数为euler_phi(x);

#include <iostream>
#include <cmath>
using namespace std;

int euler_phi(int n)
{
    int m=(int)sqrt(n+0.5);
    int ans=n;
    for(int i=2;i<=m;i++)
        if(n%i==0)
        {
            ans=ans/i*(i-1);
            while(n%i==0)n/=i;
        }
    if(n>1)ans=ans/n*(n-1);
    return ans;
}

int main()
{
    int C;
    cin>>C;
    for(int c =1;c<=C;c++)
    {
        int N;
        cin>>N;
        int ans = 0;
       for(int i =2;i<=N;i++)
       {
           ans+=euler_phi(i);
       }
        ans = ans*2 +3;
        cout<<c<<" "<<N<<" "<<ans<<endl;

    }
}