1#include <iostream>2#include <string>3using namespace std;4int lefts[20], rights[20], father[20];5string s1, s2, s3;6int n, ans;7void calc(int x, int dep)8{9    ans = ans + dep*(s1[x] - 'A' + 1);10    if (lefts[x] >= 0) calc(lefts[x], dep+1);11    if (rights[x] >= 0) calc(rights[x], dep+1);12}13void check(int x)14{15    if (lefts[x] >= 0) check(lefts[x]);16    s3 = s3 + s1[x];17    if (rights[x] >= 0) check(rights[x]);18}19void dfs(int x, int th)20{21    if (th == n)22    {23        s3 = "";24        check(0);25        if (s3 == s2)26        {27            ans = 0;28            calc(0, 1);29            cout<<ans<<endl;30        }31        return;32    }33    if (lefts[x] == -1 && rights[x] == -1)34    {35        lefts[x] = th;36        father[th] = x;37        dfs(th, th+1);38        father[th] = -1;39        lefts[x] = -1;40    }41    if (rights[x] == -1)42    {43        rights[x] = th;44        father[th] = x;45        dfs(th, th+1);46        father[th] = -1;47        rights[x] = -1;48    }49    if (father[x] >= 0)50        dfs(father[x], th);51}52int main()53{54    cin>>s1;55    cin>>s2;56    n = s1.size();57    memset(lefts, -1, sizeof(lefts));58    memset(rights, -1, sizeof(rights));59    memset(father, -1, sizeof(father));60    dfs(0, 1);61}

输入： ABCDEF BCAEDF 输出：__________