#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <cstring>
#include <algorithm>
#include <set>
#include <map>
#include <vector>
#include <cmath>
#define maxn 100005
using namespace std;
int save[maxn];
long long gcd(long long a,long long b){
return b==0?a:gcd(b,a%b);
}
int main(){
int t,i,k,n;
scanf("%d",&t);
while(t--){
scanf("%d",&n);
for(i=1;i<=n;i++){
scanf("%d",&k);
save[i]=abs(k);
}
long long ave=0;
for(i=1;i<=n;i++){
ave += save[i];
}
ave=ave*ave;
long long total=0;
for(i=1;i<=n;i++){
total+=save[i]*save[i];
}
total=n*total-ave;
long long son=gcd(total,n);
//cout<<total<<" "<<son<<endl;
printf("%lli/%lli\n",total/son,n/son);
}
return 0;
}
hdoj5734 Acperience
最新推荐文章于 2019-07-18 15:39:58 发布