emmnnnn,这场赛时过了四题,都比较简单,赛后补一题,剩下三题有两题没学完,都放周报了,学完了写
Make Them Equal
题解:由于1号位可以将a[1]以内的所有数字转给其余任何位数,所以我们可以先将所有的数字全部放到1位上,再分给其他元素
代码:
#include<bits/stdc++.h>
using namespace std;
const int maxn = 1e5 + 5;//开小了之后案例一都过不了
typedef long long LL;
struct op
{
int ii, jj, xx;
};
int ss[maxn];
op ops[maxn*4];
int n, p;
signed main()
{
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int t;
cin>>t;
while (t--) {
LL sum = 0;
p = 0;
cin>>n;
for (int i = 1; i <= n; i++) {
cin>>ss[i];
sum += ss[i];
}
if (sum % n!=0) {
printf("-1\n");
continue;
}
else {
int a = sum / n;
for (int i = 2; i <= n; i++) {
if(ss[i]%i!=0){
int res=i-(ss[i]%i);
ops[++p]={1, i, res};
ss[1] -= res, ss[i] += res;
}
ops[++p]={i, 1, ss[i] / i};
}
for (int i = 2; i <= n; i++) {
ops[++p]={ 1, i, a };
}
printf("%d\n", p);
for (int i = 1; i <= p; i++)
printf("%d %d %d\n", ops[i].ii, ops[i].jj, ops[i].xx);
}
}
return 0;
}