Submission

Status:

PPPPPPPPPP

Score: 100

User: MiyaZaki1072

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

Language: cpp

Time: 0.182 second

Submitted On: 2025-04-28 17:15:30

#pragma GCC optimization ("03")
#pragma GCC optimization ("unroll-loops")
#include <bits/stdc++.h>
using namespace std;
#define int long long
int x,y,ret;
char c;
signed main(){
    cin.tie(0)->sync_with_stdio(0);
    int n;cin>>n;
    cin>>c;x = c-'A'+1;
    cin>>c;y = c-'A'+1;
    int m = 1<<(n*2);
    for(int i=1;i<m;i++){
        int ans = 0,ch=0,cntx=0,cnty=0;
        if(__builtin_popcount(i) > n)continue;
        for(int j=0;j<n*2;j++){
            if(i&(1<<j))ans+=x*(j+1),cntx++;
            else        ans+=y*(j+1),cnty++;
            if(cntx < cnty)ch=1;
        }
        if(!ch)ret+=ans;
    }
    cout<<ret;
}