Pagini recente » Cod sursa (job #195985) | Cod sursa (job #1505377) | Cod sursa (job #882758) | Cod sursa (job #2978608) | Cod sursa (job #3344390)
#include <iostream>
#include <fstream>
#include <bits/stdc++.h>
#include <vector>
using namespace std;
#define mod 104659
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
cout.tie(nullptr);
ifstream fin("nrcuv.in");
ofstream fout("nrcuv.out");
int n, m;
fin>>n>> m;
int cor[26][26]={0};
char a, b;
for(int i=1; i<=m;i++){
fin>>a>>b;
//cout<<a<<" "<<b;
cor[a-'a'][b-'a']=1;
cor[b-'a'][a-'a']=1;
}
int dp[n+1][26];
for(int c=0; c<=26; c++){
dp[1][c]=1;
}
for(int i=2; i<=n; i++){
for(int j=1; j<=26; j++){
dp[i][j]=0;
for(int lit=0; lit<26; lit++){
if(cor[lit][j]==0){
dp[i][j] = (dp[i][j] + dp[i-1][lit]) % mod;
}
}
}
}
int s=0;
for(int i=1; i<=26; i++){
s=(s+dp[n][i])%mod;
}
fout<<s;
fin.close();
fout.close();
return 0;
}