Pagini recente » Cod sursa (job #267468) | Cod sursa (job #154300) | Cod sursa (job #2622012) | Cod sursa (job #354789) | Cod sursa (job #3165764)
#include <fstream>
using namespace std;
ifstream cin("nrcuv.in");
ofstream cout("nrcuv.out");
const int mod=104659;
int n,m,a[28][28],d[28][1001],s;
char x,y;
int main()
{
cin>>n>>m;
for(int i=1;i<=m;i++)
{
cin>>x>>y;
a[x-'a'+1][y-'a'+1]=1;
a[y-'a'+1][x-'a'+1]=1;
}
for(int i=1;i<=26;i++)
d[1][i]=1;
for(int i=2;i<=n;i++)
for(int j=1;j<=26;j++)
for(int c=1;c<=26;c++)
if(a[j][c]==0)
{
d[i][j]+=d[i-1][c];
d[i][j]%=mod;
}
s=0;
for(int i=1;i<=26;i++)
{
s+=d[n][i];
s%=mod;
}
cout<<s;
return 0;
}