Pagini recente » Cod sursa (job #1215932) | Cod sursa (job #2104271) | Cod sursa (job #324701) | Rating cionn ion (cionn) | Cod sursa (job #2617506)
#include <fstream>
using namespace std;
ifstream fin("nrcuv.in");
ofstream fout("nrcuv.out");
int dp[1001][26];
bool b[26][26];
const int r = 104659;
int main()
{
int n, m, i, j, k;
char x, y;
fin >> n >> m;
for (i = 1; i<=m; i++)
{
fin >> x >> y;
b[x-'a'][y-'a'] = b[y-'a'][x-'a'] = 1;
}
for (i = 0; i<26; i++)
dp[1][i] = 1;
for (i = 2; i<=n; i++)
for (j = 0; j<26; j++)
for (k = 0; k<26; k++)
if (b[j][k] == 0)
dp[i][j] = (dp[i][j] + dp[i-1][k])%r;
int rasp = 0;
for (i = 0; i<26; i++)
rasp = rasp + dp[n][i];
fout << rasp%r;
return 0;
}