C) Ehab and a 2-operatio

whitewall_9

于 2022-03-05 22:31:50 发布

阅读量63

点赞数

分类专栏：练习题目文章标签：构造

本文链接：https://blog.csdn.net/qq_28409093/article/details/123302699

版权

Codeforces 编程竞赛数学性质快速幂运算算法实现

关键词由CSDN通过智能技术生成

练习题目专栏收录该内容

340 篇文章 1 订阅

订阅专栏

// Problem: C. Ehab and a 2-operation task
// Contest: Codeforces - Codeforces Round #525 (Div. 2)
// URL: https://codeforces.com/problemset/problem/1088/C
// Memory Limit: 256 MB
// Time Limit: 1000 ms
// 2022-03-05 18:00:15
// 
// Powered by CP Editor (https://cpeditor.org)

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

#define rep(i,l,r) for(int i=(l);i<=(r);i++)
#define per(i,l,r) for(int i=(l);i>=(r);i--)
#define ll long long
#define pii pair<int, int>
#define mset(s,t) memset(s,t,sizeof(t))
#define mcpy(s,t) memcpy(s,t,sizeof(t))
#define fi first
#define se second
#define pb push_back
#define all(x) (x).begin(),(x).end()
#define SZ(x) ((int)(x).size())
#define mp make_pair

const ll mod = 1e9 + 7;

inline ll qmi (ll a, ll b) {
	ll ans = 1;
	while (b) {
		if (b & 1) ans = ans * a%mod;
		a = a * a %mod;
		b >>= 1;
	}
	return ans;
}
inline int read () {
	int x = 0, f = 0;
	char ch = getchar();
	while (!isdigit(ch)) f |= (ch=='-'),ch= getchar();
	while (isdigit(ch)) x = x * 10 + ch - '0', ch = getchar();
	return f?-x:x;
}
template<typename T> void print(T x) {
	if (x < 0) putchar('-'), x = -x;
	if (x >= 10) print(x/10);
	putchar(x % 10 + '0');
}
inline ll sub (ll a, ll b) {
	return ((a - b ) %mod + mod) %mod;
}
inline ll add (ll a, ll b) {
	return (a + b) %mod;
}
inline ll inv (ll a) {
	return qmi(a, mod - 2);
}
struct Node {
	int op, i, x;
};
void solve() {
	int n;
	cin >> n;
	vector<int> a(n);
	cout << n  + 1<< endl;
	cout << "1" << " " << n << ' ' << 50000 << endl;
	for (int i = 0; i < n; i ++) {
		cin >> a[i];
		a[i] += 50000;
		cout << "2" << " " << i + 1 << " " << a[i] - i << endl;
		a[i] %= a[i] - i;
	}
	
}
int main () {
	// ios::sync_with_stdio(0),cin.tie(0), cout.tie(0);
    int t;
    t =1;
    //cin >> t;
    while (t --) solve();
    return 0;
}

正解我们构造0~n - 1的排列需要用一个性质:a>= b >= [a / 2] a % b = a - b; 我想着构造一个上升的序列，想着和下标一样，但是没有构造成功，不知道这个性质。