Pagini recente » Cod sursa (job #1098427) | Cod sursa (job #347070) | Cod sursa (job #2566442) | Cod sursa (job #837887) | Cod sursa (job #1512295)
#include<fstream>
#define DM 1004
#define MOD 104659
using namespace std;
ifstream fin("nrcuv.in");
ofstream fout("nrcuv.out");
int LA[26][26];
int T[DM][26];
int Sol,N,M;
int main()
{
int i,j,k;
fin>>N>>M;
for(i=1;i<=M;++i)
{
char a,b;
fin>>a>>b;
T[a-'a'+1][b-'a'+1]=1;
T[b-'a'+1][a-'a'+1]=1;
}
for(i=1;i<=26;++i) T[1][i]=1;
for(i = 2; i <= N; i++)
for(j = 1; j <= 26; j++)
for(k = 1; k <= 26; k++)
if(!LA[j][k] && !LA[k][j])
T[i][j] = (T[i][j] + T[i - 1][k]) % MOD;
for(i = 1; i <= 26; i++)
Sol = (Sol + T[N][i]) % MOD;
fout<<Sol<<"\n";
fin.close();
fout.close();
return 0;
}