Submission #32694818

---

Source Code Expand

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

int main() {
	ios::sync_with_stdio(false);
	cin.tie(0);
	vector<int> H(3), W(3);
	cin >> H[0] >> H[1] >> H[2] >> W[0] >> W[1] >> W[2];
	int ans = 0;
	for(int a = 1; a <= 30; ++a) {
		for(int b = 1; b <= 30; ++b) {
			for(int d = 1; d <= 30; ++d) {
				for(int e = 1; e <= 30; ++e) {
					int c = H[0] - a - b;
					int f = H[1] - d - e;
					int g = W[0] - a - d;
					int h = W[1] - b - e;
					int i = W[2] - c - f;
					if(min({c, f, g, h, i}) > 0 && g + h + i == H[2]) {
						ans += 1;
					}
				}
			}
		}
	}
	cout << ans << "\n";
	return 0;
}

Submission Info

Judge Result