Pagini recente » Cod sursa (job #1040941) | Istoria paginii runda/prelungitoare | Cod sursa (job #784956) | Cod sursa (job #1273433) | Cod sursa (job #1123259)
#include<fstream>
#include<set>
#define NMAX 1005
#define MOD 104659
using namespace std;
ifstream fin("nrcuv.in");
ofstream fout("nrcuv.out");
int n,m,DP[NMAX][26],sol;
set<short> ban[26];
int main()
{
fin>>n>>m;
char c1,c2;
for(int i=1;i<=m;i++)
{
fin>>c1>>c2;
ban[c1-'a'].insert(c2-'a');
ban[c2-'a'].insert(c1-'a');
}
for(int i=0;i<26;i++)
DP[1][i]=1;
for(int i=2;i<=n;i++)
for(int j=0;j<26;j++)
{
for(int k=0;k<26;k++)
if(ban[j].find(k)==ban[j].end())
DP[i][j]+=DP[i-1][k];
DP[i][j]%=MOD;
}
for(int i=0;i<26;i++)
sol+=DP[n][i];
fout<<sol%MOD;
return 0;
}