直接暴力所有可能的情况
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<iostream>
#include<cmath>
#include<map>
using namespace std;
const int Max=10;
map<char,int>mp;
map<int,int>mp1;
char a[Max],b[Max];
int main()
{
mp['a']=1;
mp['b']=2;
mp['c']=3;
mp['d']=4;
mp['e']=5;
mp['f']=6;
int m,n;
scanf("%d%d",&m,&n);
for(int i=0;i<n;i++)
{
scanf("%s%s",a,b);
mp1[mp[a[0]]+mp[a[1]]*10]=mp[b[0]];
}
int ans=0;
int start=pow(10,m-1);
int ends=pow(10,m)-1;
for(int i=start;i<=ends;i++)
{
int x=i;
while(x>10)
{
int s=x%100;
if(mp1[s])
x=x/100*10+mp1[s];
else break;
}
if(x==1)
ans++;
}
printf("%d\n",ans);
return 0;
}