题目:https://www.luogu.org/problemnew/show/P3383#sub
素数筛
void prime1()
{
int i,j;
for (i=2;i<=n;i++)
if (su[i]==0)
for (j=i+i;j<=n;j+=i)
su[j]=1;
}
最大公约数---欧几里得:
int gcd(int a,int b)
{
int t;
if(a<b)
{
t=a;
a=b;
b=t;
}
while(b!=0)
{
t=b;
b=a%b;
a=t;
}
return a;
}