Pagini recente » Cod sursa (job #1541478) | Cod sursa (job #400670) | Cod sursa (job #1199177) | Cod sursa (job #198893) | Cod sursa (job #3264777)
#include <bits/stdc++.h>
using namespace std;
ifstream fin("nrcuv.in");
ofstream fout("nrcuv.out");
const int nmax1 = 27;
const int nmax2 = 1001;
const int MOD = 104659;
vector<vector<int>> dp(nmax2,vector<int> (nmax1,0)),mat(nmax1,vector<int> (nmax1,0));
int n,m;
void read_input(){
fin >> n >> m;
char first_letter,second_letter;
for(int i = 1; i <=m; i++){
fin >> first_letter >> second_letter;
mat[first_letter-'a'+1][second_letter-'a'+1]++;
mat[second_letter-'a'+1][first_letter-'a'+1]++;
}
}
void solve(){
for(int i = 1; i <= 26; i++){
dp[1][i] = 1;
}
for(int i = 2; i <=n; i++){
for(int j = 1; j <= 26; j++){
for(int k = 1; k <= 26; k++){
if(!mat[j][k]){
dp[i][j] = (dp[i][j] + dp[i-1][k])%MOD;
}
}
}
};
int ans = 0;
for(int i = 1; i <=26; i++){
ans = (ans + dp[n][i])%MOD;
};
fout << ans;
}
int main(){
read_input();
solve();
return 0;
}