Pagini recente » Cod sursa (job #1650130) | Cod sursa (job #2479922) | Cod sursa (job #1394332) | Istoria paginii utilizator/wabbit | Cod sursa (job #3357584)
#include <fstream>
#include <iostream>
using namespace std;
ifstream fin("nrcuv.in");
ofstream fout("nrcuv.out");
int MOD = 104659;
int D[26][1005];
int C[26][26];
int main() {
int n, m;
fin>>n>>m;
for(int i = 0; i < m; i++){
char l1, l2;
fin >> l1 >> l2;
int nl1 = l1 - 'a';
int nl2 = l2 - 'a';
C[nl1][nl2] = 1;
}
for(int l = 0; l < 26; l++)
D[l][1] = 1;
for(int i = 2; i <= n; i++)
for(int l = 0; l < 26; l++){
D[l][i] = 0;
for(int lit = 0; lit < 26; lit++)
if (C[lit][l] == 0)
D[l][i] = (D[l][i] + D[lit][i-1]) % MOD;
}
int solutie = 0;
for(int l = 0; l < 26; l++)
solutie = (solutie + D[l][n]) % MOD;
fout << solutie;
return 0;
}