cf#525 div2 C. Ehab and a 2-operation task

You’re given an array a of length n. You can perform the following operations on it:

choose an index i (1≤i≤n), an integer x (0≤x≤106), and replace aj with aj+x for all (1≤j≤i), which means add x to all the elements in the prefix ending at i.
choose an index i (1≤i≤n), an integer x (1≤x≤106), and replace aj with aj%x for all (1≤j≤i), which means replace every element in the prefix ending at i with the remainder after dividing it by x.
Can you make the array strictly increasing in no more than n+1 operations?
in:
3
1 2 3
out:
0
in:
3
7 6 3
out:
2
1 1 1
2 2 4

给出一个序列让我们可以（1，i）加上一个值或者求模一个值使序列变成严格上升的，其中区间i和值都是自己指定的
我们可以考虑通过操作把序列变成0,1,2,3…这样最简的上升序列
我们先把每个值都加上一个数，超过给的ai范围，在一直求模操作使选定区间的最右边元素变成我们想要的值

#include<bits/stdc++.h>
using namespace std;

const int maxn = 1e5 + 10;
int a[maxn];
int main()
{
//    ios::sync_with_stdio(false);
//    cin.tie(0);
    int n;  scanf("%d", &n);
    for(int i = 0; i < n; ++i)  scanf("%d", &a[i]);
    printf("%d\n1 %d 500000\n", n+1, n);
    for(int i = 0; i < n; ++i)  a[i] += 500000;
    for(int i = 0; i < n; ++i)  printf("2 %d %d\n", i+1, a[i]-i);
    return 0;
}