#include <iostream>#include <stdio.h>#include <string.h>#include <stack>#include <queue>#include <map>#include <set>#include <vector>#include <math.h>#include <algorithm>using namespace std;#define ls 2*i#define rs 2*i+1#define up(i,x,y) for(i=x;i<=y;i++)#define down(i,x,y) for(i=x;i>=y;i--)#define mem(a,x) memset(a,x,sizeof(a))#define w(a) while(a)#define LL long longconst double pi = acos(-1.0);#define Len 1000005#define mod 786433#define exp 1e-5const int INF = 0x3f3f3f3f;LL dp[Len];int hsh[Len];int main(){ int t,n,a; scanf("%d",&t); w(t--) { memset(hsh,0,sizeof(hsh)); scanf("%d",&n); dp[0]=0; for(int i=1;i<=n;i++) { scanf("%d",&a); dp[i]=dp[i-1]+a+(i-1-hsh[a])*a; hsh[a]=i; } LL ans=0; for(int i=1;i<=n;i++) ans+=dp[i]; printf("%lldn",ans); }}
