Sample Input
2
3
mississippi
nni55i55ippi
2
foobar
|=o08ar
Sample Output
1
0
/** 题意:给出一个normal串,一个leet串,看能否符合关系的映射 做法:dfs 将两个串进行匹配注意初始化 **/ #include <iostream> #include <string.h> #include <stdio.h> #include <cmath> #include <algorithm> #define maxn 110 using namespace std; char ch[maxn]; char ch1[maxn]; char alp[30][10]; char c[10]; int dfs(int k,int a,int b,int len,int len1) { if(a == len && b == len1) return 1; if(a == len || b == len1) return 0; for(int i=0; i<k; i++) { if(b+i<len1) { memset(c,'