2022年睿抗省赛高职组 题解

RC-v2 爷爷奶奶您好呀 - 2022 RoboCom 世界机器人开发者大赛-高职组（省赛） (pintia.cn)

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

int main() {
	string s;
	getline(cin, s);


	int idx = 2;

	while (s[idx] != ' ') {
		temp += s[idx];
		idx++;
	}




	if (s[0] == 'F') {
		cout << temp << " NaiNai Nin Hao Ya ~" << endl;
	} else {
		cout << temp << " YeYe Nin Hao Ya ~" << endl;
	}

	return 0;
}

RC-v3 智能监测 - 2022 RoboCom 世界机器人开发者大赛-高职组（省赛） (pintia.cn)

#include <bits/stdc++.h>
using namespace std;
int n, t;

int main() {
	cin >> n >> t;

	int tol1 = 80 - t, tol2 = 80 + t;

	for (int i = 0; i < n; i++) {
		string s;
		int x;
		cin >> s >> x;
		if (x < tol1 || x > tol2) {
			cout << s << " " << x << endl;
		}
	}


	return 0;
}

RC-v4 生成字母串 - 2022 RoboCom 世界机器人开发者大赛-高职组（省赛） (pintia.cn)

#include <bits/stdc++.h>
using namespace std;
int n;
char m;

int main() {
	cin >> n >> m;

	string str;
	getchar();
	cin >> str;

	string str2(1, m);
	for (int i = 0; i < str.size(); i++) {
		if (str[i] == '0') {
			if (islower(m)) {
				str2 += toupper(m);
			} else {
				str2 += tolower(m);
			}
		} else {
			if (islower(m) && m != 'a') {
				str2 += char(m - 1);
			} else if (isupper(m) && m != 'Z') {
				str2 += char(m + 1);
			}
		}
		m = str2.back();
	}

	cout << str2 << endl;
}

RC-v5 数字宝宝 - 2022 RoboCom 世界机器人开发者大赛-高职组（省赛） (pintia.cn)

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

int main() {
	int a, b;
	cin >> a >> b;

	int sum1 = 0;
	while (a) {
		sum1 += a % 10;
		a /= 10;
	}

	int sum2 = 1;
	while (b) {
		sum2 *= b % 10;
		b /= 10;
	}


	if (sum1 < sum2)
		cout << sum2 << sum1 << endl;
	else
		cout << sum1 << sum2 << endl;


	return 0;
}

写文章 - 20222022睿抗省赛专科组 RC-v6 拼瓷砖 - 掘金 (juejin.cn)

RC-v7 燕归来 - 2022 RoboCom 世界机器人开发者大赛-高职组（省赛） (pintia.cn)

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

set<string> s, s2;
vector<string> v1, v2;
map<string, int>flag;

int main() {
	int n, m;
	cin >> n ;

	for (int i = 0; i < n; i++) {
		string id;
		cin >> id;
		s.insert(id);
	}

	cin >> m;
	for (int i = 0; i < m; i++) {
		string id;
		cin >> id;
		s2.insert(id);
	}

	for (auto it = s2.begin(); it != s2.end(); it++) {
		if (!s.count(*it)) {
			v2.push_back(*it);
			flag[*it] = 1;
		}
	}

	for (auto it = s.begin(); it != s.end(); it++) {
		if (!s2.count(*it) && flag[*it] != 1) {
			v1.push_back(*it);
		}
	}

	int G1 = 0, G2 = 0;
	if (v1.size() == 0) {
		cout << "All Back" << endl;
		G1 = 1;
	}
	if (v2.size() == 0) {
		cout << "All Know" << endl;
		G2 = 1;
	}


	if (G1 == 0) {
		cout << "Missing: " << v1.size() << endl;
		for (auto &it : v1) {
			cout << it << endl;
		}
	}

	if (G2 == 0) {
		cout << "New: " << v2.size() << endl;
		for (auto it : v2) {
			cout << it << endl;
		}
	}

	return 0;
}