【Codeforces】Codeforces Round 863 (Div. 3) (补赛)

 A Insert Digit

题目大意：

解题思路：

参考代码：

#include<bits/stdc++.h>
using namespace std;
#define ll long long
const int N = 1e5 + 5;
int n, m, d;
string s;
int main() {
	cin >> n;
	while (n--) {
		cin >> m >> d >> s;
		int t = -1;
		for (int i = 0; i < m; i++) {
			if (d > s[i] - '0') {
				t = i;
				break;
			}
		}

		for (int i = 0; i < m; i++) {
			if (i == t) cout << d;
			cout << s[i];
		}
		if (t == -1) cout << d;
		cout << endl;
	}
	return 0;
}

B Conveyor Belts

题目大意：

解题思路：

参考代码：

#include<bits/stdc++.h>
using namespace std;
#define ll long long
const int N = 1e5 + 5;
int t, n;
int sx, sy, fx, fy;
inline int f(int x) {
	if (x > n / 2) x = n + 1 - x ;
	return x;
}
int main() {
	cin >> t;
	while (t--) {
		cin >> n >> sx >> sy >> fx >> fy;
		sx = f(sx), sy = f(sy), fx = f(fx), fy = f(fy);
		cout << abs(min(sx, sy) - min(fx, fy)) << endl;
	}
	return 0;
}

C Restore the Array

题目大意：

解题思路：

参考代码：

#include<bits/stdc++.h>
using namespace std;
#define ll long long
const int N = 1e5 + 5;
int t, n;
int main() {
	cin >> t;
	while (t--) {
		cin >> n;
		int a[n + 1] = {};
		int b[n + 1] = {};
		for (int i = 1; i < n; i++) cin >> b[i];
		a[1] = b[1];
		for (int i = 2; i <= n - 1; i++) {
			a[i] = min(b[i - 1], b[i]);
		}
		a[n] = b[n - 1];
		for (int i = 1; i <= n; i++) cout << a[i] << ' ';
		cout << endl;
	}
	return 0;
}

D Umka and a Long Flight

题目大意：

解题思路：

参考代码：

E Living Sequence

题目大意：

解题思路：

参考代码：

#include<bits/stdc++.h>
using namespace std;
#define ll long long
ll t, k;
stack<int>s;
int main() {
	cin >> t;
	while (t--) {
		cin >> k;
		while (k) s.push(k % 9), k /= 9;
		while (!s.empty()) cout << (s.top() < 4 ? s.top() : s.top() + 1), s.pop();
		cout << endl;
	}
	return 0;
}

F

G1

G2