Pagini recente » Cod sursa (job #981102) | Cod sursa (job #763616) | Cod sursa (job #2909347) | Cod sursa (job #364782) | Cod sursa (job #3281986)
#include <bits/stdc++.h>
using namespace std;
ifstream fin("nrcuv.in");
ofstream fout("nrcuv.out");
int n, m, dp[1002][1002]; /// dp[i][j] = nr de cuvinte de i litere care se termina cu j
bool mat[30][30];
int fr[30];
const int mod = 104659;
int main()
{
int i, j;
char a, b;
fin >> n >> m;
for(i = 1; i <= m; i++)
{
fin >> a >> b;
fr[a - 'a']++;
fr[b - 'b']++;
mat[a - 'a'][b - 'a'] = mat[b - 'a'][a - 'a'] = 1;
}
for(i = 0; i < 26; i++)
dp[1][i] = 1;
for(i = 1; i <= n; i++)
for(j = 0; j < 26; j++)
for(int k = 0; k < 26; k++)
if(mat[j][k] == 0)
dp[i][j] = (dp[i][j] + dp[i-1][k]) % mod;
int ans = 0;
for(i = 0; i < 26; i++)
ans = (ans + dp[n][i]) % mod;
fout << ans;
return 0;
}