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
这个题的意思是给你一个点,这个点相当于坐标上的点,问你小于等于这个点的所有点中,有多少个点与原点连接起来不会经过其他的点,即不会经过整数点。这个题其实就是求一下两个数的gcd,只要gcd等于1,就说明这个点不会经过其他的点,那么这样的的话就跑两个for循环打出表来直接计算就行了。
代码如下:
#include<stdio.h>
#include<string.h>
#include<math.h>
#include<stdlib.h>
#include<algorithm>
using namespace std;
int a[1100][1100];
int x,y;
int exgcd(int a,int &x,int b,int &y)
{
if(b==0)
{
x=1;y=0;return a;
}
int gcd=exgcd(b,y,a%b,x);
y-=(a/b)*x;
return gcd;
}
int main()
{
int m,t;
memset(a,0,sizeof(a));
for(int i=0;i<=1000;i++)
{
for(int j=0;j<=1000;j++)
{
if(i==0&&j==1)
a[i][j]=1;
if(i==1&&j==0)
a[i][j]==1;
if(exgcd(i,x,j,y)==1)
a[i][j]=1;
}
}
scanf("%d",&t);
for(int k=1;k<=t;k++)
{
int n;
scanf("%d",&n);
int sum=0;
for(int i=0;i<=n;i++)
{
for(int j=0;j<=n;j++)
sum+=a[i][j];
}
printf("%d %d %d\n",k,n,sum);
}
return 0;
}
加油呐!