Pagini recente » Cod sursa (job #2290427) | Cod sursa (job #1113176) | Cod sursa (job #3220352) | Cod sursa (job #2688111) | Cod sursa (job #652821)
Cod sursa(job #652821)
#include<cstdio>
const int MOD = 104659 ;
const int MAX_L = 26 ;
const int MAX_N = 1001 ;
int n,m,solutie;
int ok[MAX_L][MAX_L];
int sol[MAX_N][MAX_L];
char c,d;
int main()
{
freopen("nrcuv.in","r",stdin);
freopen("nrcuv.out","w",stdout);
scanf("%d%d\n",&n,&m);
for(int i=0;i<m;++i)
{
scanf("%c ",&c);
scanf("%c\n",&d);
ok[c-'a'][d-'a'] = 1 ;
ok[d-'a'][c-'a'] = 1 ;
}
for(int i=0;i<MAX_L;++i)
sol[1][i] = 1 ;
for(int i=1;i<=n;++i)
{
for(int j=0;j<MAX_L;++j)
for(int k=0;k<MAX_L;++k)
if(ok[j][k]==0)
sol[i][k] = ( sol[i-1][j] + sol[i][k] ) % MOD ;
}
for(int i=0;i<MAX_L;++i)
solutie = ( solutie % MOD + sol[n][i] % MOD ) % MOD ;
printf("%d\n",solutie);
return 0;
}