Pagini recente » Cod sursa (job #258607) | Cod sursa (job #523274) | Cod sursa (job #1044180) | Cod sursa (job #2690551) | Cod sursa (job #2383157)
#include <bits/stdc++.h>
#define NUM 1005
#define LIT 26
#define MOD 104659
int mat[LIT][LIT];
int dp[NUM][LIT];
int n, m;
long long sol;
char a, b;
using namespace std;
int main()
{
ifstream f("nrcuv.in");
ofstream g("nrcuv.out");
f >> n >> m;
for(int i = 0; i < m; ++i)
{
f >> a >> b;
mat[a - 'a'][b - 'a'] = 1;
mat[b - 'a'][a - 'a'] = 1;
}
for(int i = 0; i < LIT; ++i)
dp[1][i] = 1;
for(int i = 2; i <= n; ++i)
{
for(int j = 0; j < LIT; ++j)
{
dp[i][j] = 0;
for(int k = 0; k < LIT; ++k)
if(!mat[k][j])
{
dp[i][j] += dp[i - 1][k];
dp[i][j] %= MOD;
}
}
}
for(int i = 0; i < LIT; ++i)
sol = (sol + dp[n][i]) % MOD;
g << sol;
f.close();
g.close();
}