Submission

Score: 100

User: C12

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

Language: cpp

Time: 0.002 second

Submitted On: 2026-01-07 22:55:45

#include <bits/stdc++.h>
using namespace std;

#define f first
#define s second
#define pii pair<ll,ll>
#define puii pair<ull,ull>
#define piii pair<ll,pii>
#define tiiii tuple<ll,ll,ll,ll>
#define ll long long
#define ull unsigned long long
#define mp make_pair
#define mt make_tuple
 
#define mpiiii(a,b,c) make_pair(a,make_pair(b,c));
// ll mod = 1000000007;

ll ca,cb;
ll n;
ll sum = 0;

void recursive(int i,int na,int nb,ll cnt){
    if(i == n*2) {
        sum += cnt;
        return;
    }
    if(na < n){
        recursive(i+1,na+1,nb,cnt + (i+1)*ca);
    }
    if(nb < n && na > nb){
        recursive(i+1,na,nb+1,cnt + (i+1)*cb);
    }
}

void solve(){
    cin >> n;

    char t;

    cin >> t;
    ca = t - 'A' + 1;

    cin >> t;
    cb = t - 'A' + 1;

    recursive(0,0,0,0);

    cout << sum;

    return;
}
int main() {
    ios::sync_with_stdio(0);
    cin.tie(0);

    ll q;
 
    // cin >> q;

    // while(q--)
        solve(); 

    return 0;
}
/*
4 
2
13
97
12
91

10
3
013
113
302
312
313
013
113
302
312
313

*/