Pagini recente » Cod sursa (job #2069097) | Cod sursa (job #3207757) | Cod sursa (job #1384628) | Cod sursa (job #1138137) | Cod sursa (job #1471364)
#include<bits/stdc++.h>
using namespace std;
ifstream fin("nrcuv.in");
ofstream fout("nrcuv.out");
const int MODULO=104659;
const int NMAX=1005;
int n,m,dp[2][26];
bool a[30][30];
int main()
{
int i,j,l,aux;
char C,D;
bool ok;
fin>>n>>m;
for (i=1;i<=m;i++)
{
fin>>C>>D;
a[C-'a'+1][D-'a'+1]=a[D-'a'+1][C-'a'+1]=1;
}
for (i=1;i<=26;i++) dp[0][i]=1;
ok=1;
for (i=2;i<=n;i++,ok=1-ok)
{
for (j=1;j<=26;j++)
{
aux=0;
for (l=1;l<=26;l++)
if (a[j][l]==0)
{
aux+=dp[1-ok][l];
if (aux>=MODULO) aux-=MODULO;
}
dp[ok][j]=aux;
}
}
aux=0;
for (j=1;j<=26;j++) aux+=dp[1-ok][j];
aux%=MODULO;
fout<<aux<<"\n";
return 0;
}