B. Lord of the Values

https://codeforces.com/contest/1523/problem/B

input
2
4
1 1 1 1
4
4 3 1 2
output
8
2 1 2
2 1 2
2 1 3
2 1 3
2 1 4
2 1 4
1 1 2
1 1 2
8
2 1 4
1 2 4
1 2 4
1 2 4
1 3 4
1 1 2
1 1 2
1 1 4
Note
For the first sample test case one possible sequence of operations is as follows:

“2 1 2”. Values of variables after performing the operation: [1, 0, 1, 1]
“2 1 2”. Values of variables after performing the operation: [1, -1, 1, 1]
“2 1 3”. Values of variables after performing the operation: [1, -1, 0, 1]
“2 1 3”. Values of variables after performing the operation: [1, -1, -1, 1]
“2 1 4”. Values of variables after performing the operation: [1, -1, -1, 0]
“2 1 4”. Values of variables after performing the operation: [1, -1, -1, -1]
“1 1 2”. Values of variables after performing the operation: [0, -1, -1, -1]
“1 1 2”. Values of variables after performing the operation: [-1, -1, -1, -1]
For the second sample test case one possible sequence of operations is as follows:

“2 1 4”. Values of variables after performing the operation: [4, 3, 1, -2]
“1 2 4”. Values of variables after performing the operation: [4, 1, 1, -2]
“1 2 4”. Values of variables after performing the operation: [4, -1, 1, -2]
“1 2 4”. Values of variables after performing the operation: [4, -3, 1, -2]
“1 3 4”. Values of variables after performing the operation: [4, -3, -1, -2]
“1 1 2”. Values of variables after performing the operation: [1, -3, -1, -2]
“1 1 2”. Values of variables after performing the operation: [-2, -3, -1, -2]
“1 1 4”. Values of variables after performing the operation: [-4, -3, -1, -2]

大意：一串数组，求在两种操作下，
在i<j的情况

使得让原数组变相反数。
值得注意不用保证步数最小。

#include<bits/stdc++.h>
using namespace std;
void solve()
{
    int n,a;
    cin >> n;
    for(int i=0;i<n;++i)
        cin >> a;
    cout << 3*(n) << "\n";
    for(int i=1;i<=n;i+=2)
    {
        cout << 2 << " " << i << " " << i+1 << "\n";
        cout << 1 << " " << i << " " << i+1 << "\n";
        cout << 2 << " " << i << " " << i+1 << "\n";
        cout << 1 << " " << i << " " << i+1 << "\n";
        cout << 2 << " " << i << " " << i+1 << "\n";
        cout << 1 << " " << i << " " << i+1 << "\n";
    }
}
int main()
{
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    int t;
    cin >> t;
	while(t--)
	{
		solve();
	}

    return 0;
}

/*
4 3
4 -1
3 -1
3 -4
-1 -4
-1 -3
-4 -3

dalao的代码
*/

打表可以发现，针对两个数，反复执行2，1操作三遍就能让这两个数实现。
（水题涨阅历吧）
有问题敬请指正，本人虚心听讲