hdu Acm steps Section 2

1. a+b

题目

#include <iostream>
#include <string>
using namespace std;
int main() {
	string str;
	getline(cin, str);
	while (str[0] != 0) {
		//TODO
		int a = 0, b = 0, j = 0;
		while (str[j] != ' ') {
			//TODO
			if (str[j] >= '0' && str[j] <= '9')a = a * 16 + str[j] - '0';
			else if (str[j] >= 'a' && str[j] <= 'z')a = a * 16 + str[j] - 'a' + 10;
			else if (str[j] >= 'A' && str[j] <= 'Z')a = a * 16 + str[j] - 'A' + 10;
			j++;
		}
		j++;
		while (str[j] != 0) {
			//TODO
			if (str[j] >= '0' && str[j] <= '9')b = b * 16 + str[j] - '0';
			else if (str[j] >= 'a' && str[j] <= 'z')b = b * 16 + str[j] - 'a' + 10;
			else if (str[j] >= 'A' && str[j] <= 'Z')b = b * 16 + str[j] - 'A' + 10;
			j++;
		}
		cout << a + b << endl;
		getline(cin, str);
	}
	return 0;
}

又是一道a+b,但是16进制

2.Box of Bricks

题目

#include <iostream>
using namespace std;
int main() {
	int n, j = 1;
	cin >> n;
	while (n != 0) {
		int a[n], sum0 = 0, sum1 = 0;
		for (int i = 0; i < n; i++) {
			cin >> a[i];
			sum0 += a[i];
		}
		sum0 /= n;
		for (int i = 0; i < n; i++) if (a[i] > sum0)sum1 += (a[i] - sum0);
		cout << "Set #" << j << endl;
		j++;
		cout << "The minimum number of moves is " << sum1 << "." << endl << endl;
		cin >> n;
	}
	return 0;
}

题很简单，格式要求有点多

3.Buildings

题目

#include <iostream>
using namespace std;
int main() {
	int t;
	cin >> t;
	for (int i = 0; i < t; i++) {
		//TODO
		int n, m, sum = 0, temp;
		cin >> n >> m;
		for (int j = 0; j < m * n; j++) {
			//TODO
			cin >> temp;
			if (temp == 1)sum++;
		}
		cout << sum << endl;
	}
	return 0;
}

so easy,too