1214练习-答案

最新推荐文章于 2023-02-01 16:09:48 发布

原创最新推荐文章于 2023-02-01 16:09:48 发布 · 435 阅读

0 ·

本内容遵循CC 4.0 BY-SA版权协议

中学生信竞专栏收录该内容

159 篇文章

订阅专栏

这篇博客详细解答了编程练习的四个部分：T1、T2、T3和T4，涵盖了各个主题的关键点和解决方案。

T1

#include <cstdio>
#include <iostream>
using namespace std;

int main() {
	freopen("sd.in", "r", stdin);
	freopen("sd.out", "w", stdout);
	
	string s;
	cin >> s;
	
	int cnt = 1;
	for (int i = 1; i < s.size(); i ++) {
		if (s[i] == s[i-1]) {
			cnt ++;
		}
		else {
			cout << s[i-1];
			if (cnt != 1) cout << cnt;
			cnt = 1;
		}
	}
	cout << s[s.size()-1];
	if (cnt != 1) cout << cnt;

	return 0;
}

T2

#include <cstdio>
#include <iostream>
using namespace std;

string s[210];
int cnt;

int main() {
	freopen("tjdc.in", "r", stdin);
	freopen("tjdc.out", "w", stdout);
	
	int i = 0;
	while (cin >> s[i]) {
		i ++;
	}

	for (int j = 0; j < i - 2; j ++) {
		if (s[j] == s[i-1]) cnt ++;
	}
	if (s[i-2] == s[i-1] + '.') cnt ++;
	
	cout << cnt;

	return 0;
}

T3

#include <cstdio>
#include <iostream>
using namespace std;

int mt[26];
string s;
bool flag = true;

int main() {
	freopen("cb.in", "r", stdin);
	freopen("cb.out", "w", stdout);
	
	cin >> s;
	for (int i = 0; i < s.size(); i ++)	 {
		char x = s[i] - 'A';
		
		if (mt[x] != 0) {
			cout << mt[x] << ' ' << i + 1<< endl;
			flag = false;
		}
		else mt[x] = i + 1;
	}

	if (flag) cout << "different";

	return 0;
}

T4

#include <cstdio>
#include <iostream>
#include <algorithm>
using namespace std;

int mt[105];
int m, n, x;

int main() {
	freopen("txdy.in", "r", stdin);
	freopen("txdy.out", "w", stdout);
	
	cin >> m;
	for (int i = 1; i <= m; i ++) {
		cin >> x;
		mt[x] ++;
	}
	cin >> n;
	
	for (int i = 100; i > 0; i --) {
		if (mt[i] >= n) {
			cout << mt[i];
			break;
		}
	}

	return 0;
}