Pagini recente » Cod sursa (job #2734509) | Cod sursa (job #614195) | Cod sursa (job #1467811) | Cod sursa (job #3145034) | Cod sursa (job #1019141)
#include <fstream>
using namespace std;
ifstream eu ("nrcuv.in");
ofstream tu("nrcuv.out");
#define MOD 104659
int DP[30][1005],N,M,K;
bool T[30][30];
void Read()
{
char C1,C2;
eu>>N>>M;
for(int i=1;i<=M;i++)
{
eu>>C1>>C2;
T[C1-'a'+1][C2-'a'+1]=T[C2-'a'+1][C1-'a'+1]=1;
}
}
void Solve()
{
for(int i=1;i<=26;i++)
DP[i][1]=1;
for(int j=1;j<=N;j++)
{
for(int i=1;i<=26;i++)
{
for(int k=1;k<=26;k++)
{
if(T[i][k]==0)
DP[i][j]+=DP[k][j-1];
DP[i][j]%=MOD;
}
}
}
for(int i=1;i<=26;i++)
K+=DP[i][N];
K%=MOD;
}
void Print()
{
tu<<K<<"\n";
}
int main()
{
Read();
Solve();
Print();
return 0;
}