Triple
Time Limit: 5000/3000 MS (Java/Others) Memory Limit: 125536/65536 K (Java/Others)Total Submission(s): 205 Accepted Submission(s): 84
In each case, the first line contains one integer n (3 <= n <= 800), second line contains n different integers d (2 <= d < 105) separated with space.
#include <iostream>
using namespace std;
int a[805];
int n,ans;
int gcd(int x,int y)
{
if(y==0)
return x;
return gcd(y,x%y);
}
int main()
{
int i,j,T,x,y,s;
scanf("%d",&T);
while(T--)
{
scanf("%d",&n);
for(i=1;i<=n;i++)
scanf("%d",&a[i]);
ans=n*(n-1)*(n-2)/6;
s=0;
for(i=1;i<=n;i++)
{
x=y=0;
for(j=1;j<=n;j++)
{
if(i==j)
continue;
if(gcd(a[i],a[j])==1)
x++;
else
y++;
}
s+=x*y;
}
printf("%d\n",ans-s/2);
}
return 0;
}