Pagini recente » Cod sursa (job #2941935) | Cod sursa (job #2008260) | Cod sursa (job #3175188) | Cod sursa (job #816553) | Cod sursa (job #2397282)
#include <cstdio>
using namespace std;
long long int c[30][30];
long long int v[1005][30];
int main()
{
freopen("nrcuv.in","r",stdin);
freopen("nrcuv.out","w",stdout);
int n,m,i,j,k;
char a,b,ch;
long long int sum=0;
scanf("%d%d",&n,&m);
//scanf("%c",&ch);
for(i=1; i<=m; i++)
{
scanf("%c%c%c%c",&a,&ch,&b,&ch);
//printf("%c %c\n",a,b);
c[a-'a'+1][b-'a'+1]=1;
c[b-'a'+1][a-'a'+1]=1;
}
for(i=1; i<=26; i++)
v[1][i]=1;
for(i=1; i<n; i++)
{
for(j=1; j<=26; j++)
{
for(k=1; k<=26; k++)
{
if(c[j][k]==0)
{
v[i+1][k]=(v[i][j]+v[i+1][k])%104659;
//printf("%d %d\n",v[i][j],v[i+1][k]);
}
}
}
}
for(i=1; i<=26; i++)
sum=(v[n][i]+sum)%104659;
printf("%lld",sum);
return 0;
}