Pagini recente » Cod sursa (job #326386) | Cod sursa (job #1191169) | Cod sursa (job #1590307) | Cod sursa (job #1757490) | Cod sursa (job #1580694)
#include <cstdio>
using namespace std;
const int nmx = 1002;
const int crx = 30;
const int mod = 104659;
int n,m,dp[2][crx];
bool mat[crx][crx];
inline int toint(const char &c){
return (int)c - 96;
}
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 c1,c2;
scanf("%c %c\n", &c1, &c2);
mat[toint(c1)][toint(c2)] = true;
mat[toint(c2)][toint(c1)] = true;
}
for(int i = 1; i <= 26; ++i)
dp[0][i] = 1;
bool pos = 1;
for(int l = 2; l <= n; ++l){
for(int i = 1; i <= 26; ++i)
for(int j = 1; j <= 26; ++j)
if(not mat[i][j])
dp[pos][i] = (dp[pos][i] + dp[pos^1][j]) % mod ;
pos = pos ^ 1;
}
int sum = 0;
for(int i = 1; i <= 26; ++i)
sum = (sum + dp[pos^1][i]) % mod;
printf("%d\n", sum);
return 0;
}