Educational Codeforces Round 113 (Rated for Div. 2) ABCD 解题思路A - Balanced Substring代码B - Chess TournamentC - Jury MeetingD - Inconvenient Pairs
Educational Codeforces Round 113 (Rated for Div. 2)经典卡CCC秒DDD，可惜了怪自己特判写错了吧，对式子找了半天问题结果根本不是式子的问题A - Balanced Substring思路找到任意一个位置iii，满足s[i]≠s[i+1]s[i]\neq s[i+1]s[i]=s[i+1]，那么直接输出[i,i+1][i,i+1][i,i+1]这个区间作为答案即可代码// URL: https://codeforces.com/cont
