Pagini recente » Cod sursa (job #2183776) | Cod sursa (job #1806885) | Cod sursa (job #1337449) | Cod sursa (job #2071855) | Cod sursa (job #1846396)
#include <bits/stdc++.h>
#define MOD 104659
using namespace std;
const int NMAX = 1000 + 5;
int n,m,dp[NMAX][30];
bool ok[30][30];
int main()
{
freopen("nrcuv.in","r",stdin);
freopen("nrcuv.out","w",stdout);
scanf("%d %d\n", &n, &m);
for (int i = 1; i<=m ; ++i)
{
char a , b;
scanf("%c %c\n", &a,&b);
ok[a-'a'+1][b-'a'+1] = true;
}
for (int i = 1; i<=26; ++i)
dp[1][i] = 1;
for (int i = 2; i<=n; ++i)
for (int nou = 1; nou <= 26; ++nou)
for (int vechi = 1; vechi<=26; ++vechi)
if (ok[vechi][nou]==false&&ok[nou][vechi]==false)
dp[i][nou] += dp[i-1][vechi],dp[i][nou]%=MOD;
int ret = 0;
for (int i = 1; i<=26; ++i)
ret += dp[n][i],ret%=MOD;
printf("%d\n", ret);
return 0;
}