codeforces（D. Make Them Equal） 构造

原题链接

将所有数都加到1上，再从1平分到所有数中

//#pragma GCC optimize("Ofast")
//#pragma GCC target("avx,avx2,fma")
//#pragma GCC optimization ("unroll-loops")
#include <bits/stdc++.h>
#define pb push_back
#define ll long long
#define IOS std::ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
inline int read() {
    char c = getchar(); int x = 0, f = 1;
    while (c < '0' || c > '9') {if (c == '-')f = -1; c = getchar();}
    while (c >= '0' && c <= '9') {x = x * 10 + c - '0'; c = getchar();}
    return x * f;
}
using namespace std;

int t,n;
int a[100005];
struct node
{
    int x,y,z;
}ans[100005];
int main()
{
    IOS;
    cin>>t;
    while(t--)
    {
        cin>>n;
        int aver=0,tot=0;
        for(int i=1;i<=n;i++){cin>>a[i];aver+=a[i];}
        if(aver%n!=0){cout<<"-1"<<'\n';continue;}
        aver/=n;
        for(int i=2;i<=n;i++)
        {
            int g=a[i]/i+((a[i]%i==0)?0:1);
            int st=g*i;
            int cc=st-a[i];
            ans[++tot].x=1;
            ans[tot].y=i;
            ans[tot].z=cc;
            a[i]+=cc;
            a[1]-=cc;
            cc=a[i]/i;
            ans[++tot].x=i;
            ans[tot].y=1;
            ans[tot].z=cc;
            a[i]=0;
            a[1]+=cc*i;
        }
        for(int i=2;i<=n;i++)
        {
            int cc=aver;
            ans[++tot].x=1;
            ans[tot].y=i;
            ans[tot].z=cc;
            a[i]+=cc;
            a[1]-=cc;
        }
        cout<<tot<<'\n';
        for(int i=1;i<=tot;i++)
        {
            cout<<ans[i].x<<" "<<ans[i].y<<" "<<ans[i].z<<'\n';
        }
    }
    return 0;
}