Pagini recente » Cod sursa (job #1040706) | Cod sursa (job #1492738) | Cod sursa (job #1559189) | Cod sursa (job #1242814) | Cod sursa (job #3229518)
#include <bits/stdc++.h>
#define MOD 104659
using namespace std;
int dp[26][1001];
// dp[i][l] = cate siruri de lung l se termina in i
char mat[26][26];
int main()
{
freopen("nrcuv.in", "r", stdin);
freopen("nrcuv.out", "w", stdout);
int n, m, i, l, j, s;
char ch1, ch2;
cin >> n >> m;
while(m--){
cin >> ch1 >> ch2;
ch1 -= 'a';
ch2 -= 'a';
mat[ch1][ch2] = mat[ch2][ch1] = 1;
}
for( i = 0; i < 26; i++ )
dp[i][1] = 1;
for( l = 2; l <= n; l++ ){
for( i = 0; i < 26; i++ ){
dp[i][l] = 0;
for( j = 0; j < 26; j++ ){
if(mat[i][j] == 0){
dp[i][l] = (dp[j][l - 1] + dp[i][l]) % MOD;
}
}
}
}
s = 0;
for( i = 0; i < 26; i++ ){
//cout << dp[i][n] << " ";
s += dp[i][n];
s %= MOD;
}
cout << s << endl;
return 0;
}