[ACM-ICPC][Asia - Daejeon] 5844 - Leet
字串處理題, 窮舉映射對象, 然後 dfs 即可#include <stdio.h>#include <string.h>#include <map>#include <iostream>using namespace std;map<char, string> r;int k, sL, letL, flag;string s, let;void dfs(int i, int j) { if(i == sL && ...
