【题解】poj3090 Visible Lattice Points（同洛谷P2158 [SDOI2008]仪仗队）欧拉函数

最新推荐文章于 2021-04-09 20:07:23 发布

wwt9b15bs

最新推荐文章于 2021-04-09 20:07:23 发布

阅读量325

点赞数

分类专栏：算法竞赛进阶指南 poj 欧拉函数省选洛谷文章标签：欧拉函数

本文链接：https://blog.csdn.net/qq_41958841/article/details/82498985

版权

该博客介绍了一道编程题（poj3090/SDOI2008仪仗队），讨论了在第一象限中从原点可视的格点问题。题目要求计算在0到N范围内，与原点连线不经过其他格点的点的数量。解题关键在于理解可见点的条件（x, y > 0, gcd(x, y) = 1）并使用欧拉函数在O(N)时间内求解。给出的样例展示了不同N值下的可视点数。" 102958376,7814940,"C++ STL 容器详解：string, vector, deque, stack, queue, list, set, multiset, map, multimap

摘要由CSDN通过智能技术生成

题目链接

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.