[POJ3090]Visible Lattice Points

原题链接

线性筛欧拉函数

#include<iostream>
#include<cstring>
#include<algorithm>
#include<cstdio>
#include<cmath>
#include<queue>
#include<vector>
#include<climits>
#include<string>
#include<cstdlib>
#include<ctime>
#define MAX 1000000007
#define LL long long
using namespace std;

int phi[1005],prime[1005],prime_num[1005],tot;

int ola(int n)
{
    int ans,i;

    ans=0;

    for(i=1;i<=n;i++)
        ans+=phi[i];

    ans=(ans-1)*2+3; 

    return ans;
}

int main()
{
    int i,c,n,ans,j;

    phi[1]=1;

    for(i=2;i<=1000;i++)
    {
        if(!prime[i])
        {
            tot++;
            prime_num[tot]=i;
            phi[i]=i-1;
        }

        for(j=1;(j<=tot)&&(i*prime_num[j]<=1000);j++)
        {
            prime[i*prime_num[j]]=1;

            if(i%prime_num[j]==0)
            {
                phi[i*prime_num[j]]=phi[i]*prime_num[j];
                break;  
            }
            else phi[i*prime_num[j]]=phi[i]*(prime_num[j]-1);           
        }
    }

    scanf("%d",&c);     

    for(i=1;i<=c;i++)
    {
        scanf("%d",&n);
        ans=ola(n);
        printf("%d %d %d\n",i,n,ans);
    }

    return 0;
}