求条 WA #10

#include <bits/stdc++.h>

using namespace std;

int n;
string s[20];

int main () {
	
	while (1) {
		
		bool f1 = false;
		int ans[10],idd = 0,iddd = 0,idddd = 0;
		memset (ans,0,sizeof(ans));
		
		for (int i = 1;i <= 4;i ++) {
			int cnt = 0;
			cin >> n;
			if (n != 0) f1 = true;
			for (int j = 1;j <= n;j ++) {
				cin >> s[j];
				if (s[j][0] == 'H') cnt ++;	 
				if (n == 1 && s[j] == "C10") ans[i] = 50;
				else if (s[j] == "C10") idd = i;
				if (s[j] == "S12") iddd = i,ans[i] -= 100;
				if (s[j] == "D11") idddd = i,ans[i] += 100;
				if (s[j] == "H1")  ans[i] -= 50;
				if (s[j] == "H2")  ans[i] -= 2;
				if (s[j] == "H3")  ans[i] -= 3;
				if (s[j] == "H4")  ans[i] -= 4;
				if (s[j] == "H5")  ans[i] -= 5;
				if (s[j] == "H6")  ans[i] -= 6;
				if (s[j] == "H7")  ans[i] -= 7;
				if (s[j] == "H8")  ans[i] -= 8;
				if (s[j] == "H9")  ans[i] -= 9;
				if (s[j] == "H10")  ans[i] -= 10;
				if (s[j] == "H11")  ans[i] -= 20;
				if (s[j] == "H12")  ans[i] -= 30;
				if (s[j] == "H13")  ans[i] -= 40;
			}
			if (cnt == 13) ans[i] = 0,ans[i] = 200;
			if (cnt == 13 && iddd == i && idddd == i) ans[i] = 500; 
		} 
		if (f1 == false) return 0;
		for (int i = 1;i <= 4;i ++) {
			if (ans[i] > 0) cout << '+';
			if (idd == i) ans[i] *= 2;
			cout << ans[i] << ' ';
		}
		cout << '\n';
	}
	return 0;
}