求捞

#include<iostream>
#include<cmath>
#include<string>
#include<iomanip>
#include<algorithm>
#include<vector>
#define N 2600
#define M 26
double a[N], b[N];
using namespace std;
int dbtn(int a, int b) {
	return abs(a - b);
}
struct grade {
	int g;
	int bg;
}; 
grade H[N], h[N];
int main() {
	string s;
	
	int i = 0, j = 0,n=0;
	int anc = 0, ans = 0;
	while (s[i] != 'E') {
		i = 0;	
		cin >> s;
		n = s.length();
		while(s[i]!='E'&&i<n) {
			if (s[i] == 'W') {
				H[anc].g += 1;
				H[ans].bg += 1;
			}
			else {
				h[anc].g += 1;
				h[ans].bg += 1;
			}
			if ((H[anc].g >= 11 || h[anc].g >= 11)&&(dbtn(H[anc].g,h[anc].g)>=2) ){
				anc++;
			}
			if ((H[ans].bg >= 21 || h[ans].bg >= 21) && (dbtn(H[ans].bg, h[ans].bg) >= 2)) {
				ans++;
			}
			i++;
		}
		
	}
	for (int i = 0; i <= anc; i++) {
		cout << H[i].g << ":" << h[i].g << endl;
	}
	cout << endl;
	for (int i = 0; i <= ans; i++) {
		cout << H[i].bg << ":" << h[i].bg << endl;
	}
	return 0;
}