Pagini recente » Cod sursa (job #1297703) | Cod sursa (job #1346921) | Cod sursa (job #974781) | Cod sursa (job #2694539) | Cod sursa (job #1206649)
using namespace std;
#include <fstream>
ifstream fin("nrcuv.in");
ofstream fout("nrcuv.out");
const int MOD = 104659;
int nu[26][26];
int nr[1001][26];
//nr[i][j] - cuvinte de lg i care se termina in 'a' + j
int main()
{
int i, j, k, m, n;
char a, b;
fin >> n >> m;
for(; m; --m)
{
fin >> a >> b;
nu[a - 'a'][b - 'a'] = 1;
nu[b - 'a'][a - 'a'] = 1;
}
for(i = 0; i < 26; ++i) nr[1][i] = 1;
for(i = 2; i <= n; ++i)
for(j = 0; j < 26; ++j)
for(k = 0; k < 26; ++k)
if(!nu[j][k]) nr[i][j] += nr[i-1][k], nr[i][j] %= MOD;
for(i = m = 0; i < 26; ++i) m = (m + nr[n][i]) % MOD;
fout << m << '\n';
return 0;
}