題目大意就是給你字元a和b字元a能翻譯成b然後給你兩個字元問是否能夠從字串一翻譯到字串二
題解思路：因為如果a能翻譯到b，b能翻譯到c，a也能翻譯到c所以要滿足傳遞性相當於求矩陣的傳遞閉包利用warshall演算法即可
用陣列模擬矩陣即可

#include<cstdio>
#include<algorithm>
#include<iostream>
#include<cstring>
using namespace std;
const int mx = 100;
int vis[30][30]; //陣列模擬矩陣
char str1[mx],str2[mx];
int
 
 idx(char c){
    return c-'a';
}
void warshall(int x,int y){ //warshall演算法實現過程
    for(int i = 0; i <= 25; i++)
        vis[x][i] += vis[y][i];
}
int main(){
    int n,m;
    while(scanf("%d%d",&n,&m)!=EOF){
        memset(vis,0,sizeof(vis));
        for(int i = 1; i <= n; i++){
            scanf
 
("%s%s",str1,str2);
            vis[idx(str1[0])][idx(str2[0])] = 1;
        }
        for(int j = 0; j <= 25; j++)
            for(int i = 0; i <= 25; i++)
                if(vis[i][j])
                    warshall(i,j);
        for(int i = 1; i <= m; i++){
            scanf("%s%s",str1,str2);
            int
 
 len = strlen(str1);
            if(len != strlen(str2)){
                puts("no");
                continue;
            }
            int ok = 1;
            for(int j = 0; j < len; j++)
                if(str1[j] != str2[j] && !vis[idx(str1[j])][idx(str2[j])]){
                    ok = 0;
                    break;
                }
            ok?puts("yes"):puts("no");
        }
    }
    return 0;
}