题目
思路
先把所有的东西都转移到位置1( i = 1 i=1 i=1)上,再由1分发给每一位
代码
#include<cstdio>
#include<cstring>
#include<cmath>
#include<cstdlib>
#include<cctype>
#include<ctime>
#include<iostream>
#include<string>
#include<map>
#include<queue>
#include<stack>
#include<set>
#include<vector>
#include<iomanip>
#include<list>
#include<bitset>
#include<sstream>
#include<fstream>
#include<complex>
#include<algorithm>
#if __cplusplus >= 201103L
#include <unordered_map>
#include <unordered_set>
#endif
#define ll long long
using namespace std;
const int INF = 0x3f3f3f3f;
int a[10010];
int main(){
ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
int t;
cin>>t;
while(t--){
int n;
cin>>n;
int sum=0;
for(int i=1;i<=n;i++){
cin>>a[i];
sum+=a[i];
}
if(sum%n!=0){
cout<<"-1"<<endl;
}
else{
int aim=sum/n;
cout<<3*(n-1)<<endl;
for(int i=2;i<=n;i++){
cout<<1<<" "<<i<<" "<<(a[i]%i==0?0:i-a[i]%i)<<endl;
a[i]+=(a[i]%i==0?0:i-a[i]%i);
a[1]-=(a[i]%i==0?0:i-a[i]%i);
cout<<i<<" "<<1<<" "<<a[i]/i<<endl;
a[1]+=a[i];
a[i]=0;
}
for(int i=2;i<=n;i++){
cout<<1<<" "<<i<<" "<<aim<<endl;
}
}
}
return 0;
}