Codeforces Round #744 (Div. 3)题解A-GCodeforces Round #744 (Div. 3)
Codeforces Round #744 (Div. 3)A. Casimir’s String Solitaire分析：不难发现，当且仅当B的个数等于A和C的个数的和时，可行。代码：#include <algorithm>#include <iostream>using namespace std;const int N = 500;char s[N];void solve(){ scanf("%s",s);
