poj3090 Visible Lattice Points(莫比乌斯反演)
来源:互联网 发布:延安广电网络商务宾馆 编辑:程序博客网 时间:2024/06/06 05:26
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
4245231
Sample Output
1 2 52 4 133 5 214 231 32549
Source
/*2014年最后一道题,莫比乌斯反演直接求的,发现结果总是少2,然后就加了2,就过了,为什么呢?后来想想,应该是缺了(1,0)和(0,1)这两个点了吧,因为莫比乌斯反演是从1开始的,,,加油!!!Time:2014-12-31 21:52*/#include<cstdio>#include<cstring>#include<algorithm>using namespace std;typedef long long LL;const int MAX=1010;int prime[MAX+10],mu[MAX+10];bool vis[MAX+10];void Mobius(){ memset(prime,0,sizeof(prime)); memset(vis,0,sizeof(vis)); mu[1]=1;vis[1]=true;int cnt=0; for(int i=2;i<=MAX;i++){ if(!vis[i]){ prime[cnt++]=i; mu[i]=-1; } for(int j=0;j<cnt;j++){ if(i*prime[j]>MAX)break; vis[i*prime[j]]=true; if(i%prime[j]==0){ mu[i*prime[j]]=0; break; } mu[i*prime[j]]=-mu[i]; } }}int main(){ int nCase,T,n; Mobius(); nCase=1; scanf("%d",&T); while(T--){ scanf("%d",&n); LL ans=0; for(int i=1;i<=n;i++){ ans+=(LL)(n/i)*(n/i)*mu[i]; } printf("%d %d %lld\n",nCase++,n,ans+2); }return 0;}
- poj3090 Visible Lattice Points(莫比乌斯反演)
- poj3090 Visible Lattice Points(欧拉函数 莫比乌斯反演)
- spoj 7001. Visible Lattice Points(莫比乌斯反演)
- SPOJ VLATTICE - Visible Lattice Points 莫比乌斯反演
- SPOJ 7001. Visible Lattice Points (莫比乌斯反演)
- SPOJ 7001 Visible Lattice Points (莫比乌斯反演)
- 【莫比乌斯反演】[SPOJ-VLATTICE]Visible Lattice Points
- 【莫比乌斯反演】[SPOJ VLATTICE]Visible Lattice Points
- SPOJ VLATTICE Visible Lattice Points - 莫比乌斯反演
- SPOJ 7001. Visible Lattice Points 莫比乌斯反演
- SPOJ 7001 Visible Lattice Points (莫比乌斯反演)
- POJ 3090 Visible Lattice Points(莫比乌斯反演)
- SPOJ 7001 Visible Lattice Points(莫比乌斯反演)
- 【SPOJ7001】Visible Lattice Points-莫比乌斯反演+分块
- SPOJ VLATTICE Visible Lattice Points[莫比乌斯反演]
- poj3090-Visible Lattice Points
- poj3090-Visible Lattice Points
- poj3090 Visible Lattice Points
- 2014年回顾总结与2015年学习规划
- 九度OJ 1062 分段函数
- ubuntu14 安装apache和php环境
- Struts2(一)Struts2配置详解
- 自我发现,找到适合自己的职位
- poj3090 Visible Lattice Points(莫比乌斯反演)
- HDOJ 1800 Flying to the Mars
- 兰顿蚂蚁
- iOS开发的一些技巧
- A-8SQL Server 触发器
- 我的博客
- A-9SQL Server 数据库安全
- Qt for Windows:Qt 5.4.0 MinGW 静态编译版本制作
- A-10SQL Server 开发指南