Pagini recente » Cod sursa (job #921153) | Cod sursa (job #461981) | Cod sursa (job #1435582) | Cod sursa (job #3282570) | Cod sursa (job #2086176)
#include <fstream>
using namespace std;
ifstream cin ("nrcuv.in");
ofstream cout("nrcuv.out");
char v[2002], w[2002];
int a[30][30], d[1005][30];
int main()
{
char c, l;
int n, m, i, j, mod=104659, k;
long long yup=0;
cin>>n>>m;
for(i=1; i<=m; i++)
{
cin>>c>>l;
v[i]=c-'a';
w[i]=l-'a';
a[v[i]][w[i]] = a[w[i]][v[i]] = 1;
}
for(i=0; i<26; i++)
{
d[1][i]=1;
}
for(i=2; i<=n; i++)
{
for(j=0; j<26; j++)
{
for(k=0; k<26; k++)
if(!a[k][j])
{
d[i][j]+=d[i-1][k];
d[i][j]%=mod;
}
}
}
for(i=0; i<26; i++)
{
yup+=d[n][i];
yup%=mod;
}
cout<<yup;
return 0;
}