Submission

Score: 100

User: anak

Problemset: ดีกค์เวิร์ด

Language: cpp

Time: 0.003 second

Submitted On: 2026-04-01 15:13:19

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define all(x) (x).begin(), (x).end()


ll n;
ll ans = 0;
char first,second;
void recur(ll curr,ll sum,ll len) {
    if(len == 2*n) {
        if(sum == 0) ans += curr;
        return;
    }
    len++;
    recur(curr+len*(first-'A'+1),sum+1,len);
    if(sum > 0) {
        recur(curr + len*(second-'A'+1),sum-1,len);
    }
    
} 
int main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cin >> n >> first >> second;
    recur(0,0,0);   
    cout << ans;
}