Pagini recente » Cod sursa (job #3328404) | Borderou de evaluare (job #639875) | Monitorul de evaluare | Cod sursa (job #3301689) | Cod sursa (job #3353595)
#include <bits/stdc++.h>
#define SIGMA 26
#define MOD 104659
#define N 1000
using namespace std;
char v[SIGMA + 1][SIGMA + 1];
int dp[SIGMA + 1][N + 1];
int main()
{
FILE *in, *out;
in = fopen("nrcuv.in", "r");
out = fopen("nrcuv.out", "w");
int m, i, r = 0, n, j, k;
char ch, ch2;
fscanf(in, "%d%d ",&n,&m);
for(i = 1;i <= m;i++){
ch = fgetc(in);
ch2 = fgetc(in);
ch2 = fgetc(in);
v[ch - 'a'][ch2 - 'a'] = v[ch2 - 'a'][ch - 'a'] = 1;
ch2 = fgetc(in);
}
for(i = 1; i <= 26; i++){
dp[i][1] = 1;
}
for(j = 2; j <= n; j++){
for(i = 1; i <= 26; i++){
for(k = 1; k <= 26; k++){
if(v[i][k] == 0){
dp[i][j] = (dp[i][j] + dp[k][j - 1]) % MOD;
}
}
}
}
for(i = 1; i <= 26; i++){
r = (r + dp[i][n]) % MOD;
}
fprintf(out, "%d",r);
return 0;
}