CSP-JS 复赛复习习题记录——字符串（东方博宜OJ）

news2024/10/2 18:18:48

网址：东方博宜OJ - 字符串题单

1093. 打印小写字母表

#include <iostream>
#include <cmath>
#include <algorithm>
#include <vector>
using namespace std;
typedef long long ll;

int main() {
	ios::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);
	for (char c = 'a'; c <= 'm'; c++) {
		cout << c;
	}
	cout << endl;
	for (char c = 'n'; c <= 'z'; c++) {
		cout << c;
	}
	cout << endl;
	for (char c = 'z'; c >= 'n'; c--) {
		cout << c;
	}
	cout << endl;
	for (char c = 'm'; c >= 'a'; c--) {
		cout << c;
	}
	cout << endl;
	return 0;
}

1101. 时间的差

#include <iostream>
#include <vector>
#include <algorithm>
#include <string>
#include <cmath>
typedef long long ll;
using namespace std;

static ll num(string s) {
	ll r = 0;
	//01:10:10
	ll h = (s[0] - '0') * 10 + (s[1] - '0');
	ll m = (s[3] - '0') * 10 + (s[4] - '0');
	ll e = (s[6] - '0') * 10 + (s[7] - '0');
	r = h * 60 * 60 + m * 60 + e;
	return r;
}

int main() {
	ios::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);
	string s1, s2;
	cin >> s1 >> s2;
	cout << num(s1) - num(s2) << endl;
	return 0;
}

1115. 数字和

#include <iostream>
#include <cmath>
#include <algorithm>
#include <vector>
#include <string>
using namespace std;
typedef long long ll;

int main() {
	ios::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);
	string s;
	getline(cin, s);
	ll l = s.size(), sum = 0;
	for (ll i = 0; i < l; i++) {
		sum += s[i] - '0';
	}
	cout << sum << endl;
	return 0;
}