SPOJ-VLATTICE

最新推荐文章于 2024-09-22 11:42:19 发布

T_TQAQTAT

最新推荐文章于 2024-09-22 11:42:19 发布

阅读量342

点赞数 1

分类专栏：莫比乌斯反演算法 SPOJ 文章标签：莫比乌斯反演算法 SPOJ

本文链接：https://blog.csdn.net/T_TQAQTAT/article/details/51697610

版权

莫比乌斯反演同时被 3 个专栏收录

2 篇文章 0 订阅

订阅专栏

算法

2 篇文章 0 订阅

订阅专栏

SPOJ

1 篇文章 0 订阅

订阅专栏

Description
Consider a N*N*N lattice. One corner is at (0,0,0) and the opposite one is at (N,N,N). How many lattice points are visible from corner at (0,0,0) ? A point X is visible from point Y iff no other lattice point lies on the segment joining X and Y.

Input :
The first line contains the number of test cases T. The next T lines contain an interger N

Output :
Output T lines, one corresponding to each test case.

Sample Input :
3
1
2
5

Sample Output :
7
19
175

Constraints :
T <= 50
1 <= N <= 1000000

题解:莫比乌斯反演

代码:

/*
* @Author: apple
* @Date:   2016-06-17 08:50:34
* @Last Modified by:   Heristor
* @Last Modified time: 2016-06-17 09:24:19
*/

#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <string>
#include <cmath>
#include <algorithm>
#include <queue>
#include <map>
#include <set>
#include <ctime>
#include <vector>

using namespace std;

#define rep(i,l,r) for(i=l;i<=r;i++)
#define ser(i,r,l) for(i=r;i>=l;i--)
#define INF 1000005
#define inf 1000000007

typedef long long ll;
priority_queue<int >QwQ;

int T,n,tot=0;
int mu[INF],in[INF],Prime[INF];
ll tmp=0,Ans=0;
int read()
{
    int k=0,f=1;
    char ch;
    while(ch<'0' || ch>'9'){
        if(ch=='-')f=-1;
        ch=getchar();
    }
    while(ch>='0' && ch<='9')k=(k<<1)+(k<<3)+ch-'0',ch=getchar();
    return k*f;
}
void init()
{
    int i,j,k;
    T=read();
    mu[1]=1;
    rep(i,2,1000000){
        if(!in[i]){
            mu[i]=-1;
            Prime[++tot]=i;
        }
        for(j=1;j<=tot && i*Prime[j]<=1000000;j++){
            in[i*Prime[j]]=1;
            if(!(i%Prime[j])){
                mu[i*Prime[j]]=0;
                break;
            }
            else mu[i*Prime[j]]=-mu[i];
        }
    }
    while(T--){
        Ans=3;
        n=read();
        rep(i,1,n){
            tmp=mu[i]*(n/i);
            tmp*=(ll)n/i;
            tmp*=(ll)n/i;
            Ans+=tmp;
            tmp=mu[i]*(n/i);
            tmp*=(ll)n/i;
            tmp*=3;
            Ans+=tmp;
        }
        printf("%lld\n", Ans);
    }
}
void work()
{
    int i,j,k;
}
int main()
{
    freopen("SpojVLATTICE.in","r",stdin);
    freopen("SpojVLATTICE.out","w",stdout);
    init();
    work();
    return 0;
}