Pagini recente » Diferente pentru preoni-2007/runda-3/solutii intre reviziile 53 si 27 | Istoria paginii runda/ag | Istoria paginii runda/mda_plng | Istoria paginii runda/ioi2013trainingcamp | Cod sursa (job #3275087)
/******************************************************************************
Online C++ Compiler.
Code, Compile, Run and Debug C++ program online.
Write your code in this editor and press "Run" button to compile and execute it.
*******************************************************************************/
#include <bits/stdc++.h>
#define mod 104659
using namespace std;
ifstream f("nrcuv.in");
ofstream g("nrcuv.out");
int n, m, fr[30][30], a[1005][30];
int main()
{
f >> n >> m;
for (int i = 0; i < m; i++) {
char l1, l2;
f >> l1 >> l2;
fr[l1 - 'a'][l2 - 'a'] = 1;
fr[l2 - 'a'][l1 - 'a'] = 1;
}
for (int i = 0; i < 26; i++) {
a[0][i] = 1;
}
for (int i = 1; i <= n; i++) {
for (int j = 0; j < 26; j++) {
for (int k = 0; k < 26; k++) {
if (fr[j][k] != 1 && fr[k][j] != 1)
a[i][j] = (a[i][j] + a[i - 1][k]) % mod;
}
}
}
long long int sum = 0;
for (int i = 0; i < 26; i++) {
sum = (a[n-1][i] + sum) % mod;
}
g << sum;
return 0;
}