Pagini recente » Cod sursa (job #1077031) | Cod sursa (job #1702534) | Cod sursa (job #2201411) | Cod sursa (job #2461318) | Cod sursa (job #2674519)
#include <fstream>
using namespace std;
const int mod=104659;
ifstream cin("nrcuv.in");
ofstream cout("nrcuv.out");
int dp[1001][26],a[26][26];
int main()
{
int n, m;
cin>>n>>m;
for (int i=1; i<=m;i++)
{
char c1, c2;
cin>>c1>>c2;
a[c1-'a'][c2-'a']=a[c2-'a'][c1-'a']=true;
}
for (int j=0;j<26;j++)
{
dp[1][j]=1;
}
for (int i=2;i<=n;i++)
{
for (int j=0;j<26;j++)
{
for (int k=0;k<26;k++)
{
if (!a[j][k])
{
dp[i][j]+=dp[i-1][k];
dp[i][j]=dp[i][j]%mod;
}
}
}
}
int rez=0;
for (int j=0;j<26;j++)
{
rez+=dp[n][j];
rez=rez%mod;
}
cout<<rez;
return 0;
}