【bzoj2190】仪仗队 欧拉函数

AC通道：http://www.lydsy.com/JudgeOnline/problem.php?id=2190

【题解】

显然，能看见的点坐标应满足gcd(x,y)=1

用欧拉函数解之即可。最后别忘了加上(0,0)这个点

/*************
  bzoj 2190
  by chty
  2016.11.3
*************/
#include<iostream>
#include<cstdio>
#include<cstring>
#include<cstdlib>
#include<ctime>
#include<cmath>
#include<algorithm>
using namespace std;
#define MAXN 40010
int n,ans,phi[MAXN],check[MAXN],prime[MAXN];
inline int read()
{
    int x=0,f=1;  char ch=getchar();
    while(!isdigit(ch))  {if(ch=='-')  f=-1;  ch=getchar();}
    while(isdigit(ch))  {x=x*10+ch-'0';  ch=getchar();}
    return x*f;
}
void get()
{
    phi[1]=1;  int cnt=0;
    for(int i=2;i<=n;i++)
    {
        if(!check[i])  {prime[++cnt]=i; phi[i]=i-1;}
        for(int j=1;j<=cnt&&prime[j]*i<=n;j++)
        {
            check[prime[j]*i]=1;
            if(i%prime[j])  phi[i*prime[j]]=phi[i]*(prime[j]-1);
            else {phi[i*prime[j]]=phi[i]*prime[j];  break;}
        }
    }
}
int main()
{
    freopen("cin.in","r",stdin);
    freopen("cout.out","w",stdout);
    n=read();  get();
    for(int i=1;i<n;i++)  ans+=phi[i];
    printf("%d\n",ans*2+1);
    return 0;
}