hdu 5734(水)

#include <iostream>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <vector>
#include <queue>
#include <map>
#include <set>
#include <algorithm>
#include <ctime>
#include <functional>
#pragma comment(linker,"/STACK:102400000,102400000")
using namespace std;


#define eps 1e-10
#define N 1000020
#define B 234
#define M 200030
#define mod 1000000007
#define inf 0x3f3f3f3f
#define LL long long
#define pii pair<int, int>
#define MP make_pair
#define fi first
#define se second

#define md (ll + rr >> 1)



int n, a[N];

LL gcd(LL a, LL b) {
    while(a && b && (a >= b? a %= b: b %= a));
    return a + b;
}
int main() {
    int cas;
    scanf("%d", &cas);
    while(cas--) {
        scanf("%d", &n);
        LL x = 0, y = 0;
        for(int i = 1; i <= n; ++i) {
            scanf("%d", &a[i]);
            if(a[i] < 0) a[i] = -a[i];
            x += 1LL * a[i] * a[i];
            y += a[i];
        }
        y = 1LL * y * y;
        LL p = n * x - y;
        LL q = n;
        LL g = gcd(p, q);
        p /= g, q /= g;
        cout << p << '/' << q << endl;
    }
    return 0;
}