POJ 3090 Visible Lattice Points 欧拉函数的应用

最新推荐文章于 2020-08-31 19:07:08 发布

ACBOY、

最新推荐文章于 2020-08-31 19:07:08 发布

阅读量1.1k

点赞数

CC 4.0 BY-SA版权

分类专栏：数学

本文链接：https://blog.youkuaiyun.com/crescent__moon/article/details/19485511

数学专栏收录该内容

153 篇文章

订阅专栏

本文介绍了一种计算在指定范围内可见格点数量的方法。通过理解可见格点的概念，即从原点出发到该点的直线不经过其他整数点，文章提供了一个高效的算法实现方案。该方案利用了欧拉函数来预处理数据，从而快速得出答案。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

点击打开链接

Visible Lattice Points

Time Limit: 1000MS		Memory Limit: 65536K
Total Submissions: 5136		Accepted: 2985

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

Sample Output

1 2 5
2 4 13
3 5 21
4 231 32549

Source

Greater New York 2006

在第一象限，从点（0,0)到点(x,y)画一条线段，如果这条线段不经过其它整数点坐标，那么称作点（x，y）是可见的。给你n，让你计算在0<=x<=n和0<=y<=n的范围内有多少可见点。

当你写出几组点之后，就会发现这些点的横坐标合纵坐标是互素的，因此通过求欧拉函数打表就可以求出。

//392K	0MS
#include<stdio.h>
#include<string.h>
#define N 1007
int sum[N],phi[N];
void getphi()
{
    memset(phi, 0, sizeof (phi));//phi存的就是欧拉函数
    sum[1]=1;
    phi[1] = 1;
    for (int i = 2; i < N; ++i)
    {
        if (!phi[i])
        {
            for (int j = i; j < N; j += i)
            {
                if (!phi[j])
                    phi[j] = j;
                phi[j] = phi[j] / i * (i - 1);
            }
        }
        sum[i]=sum[i-1]+phi[i];
    }
}
int main()
{
    int cas=1,n,t;
    getphi();
    scanf("%d",&t);
    while(t--)
    {
        scanf("%d",&n);
        printf("%d %d %d\n",cas++,n,sum[n]*2+1);
    }
    return 0;
}