Pagini recente » Cod sursa (job #1239675) | Cod sursa (job #89075) | Cod sursa (job #42914) | Statistici Moga Razvan Dan (Razvan_Moga) | Cod sursa (job #1858174)
#include <bits/stdc++.h>
using namespace std;
ifstream fin("nrcuv.in");
ofstream fout("nrcuv.out");
int n,m;
char c,r;
const int NMAX = 1005;
const int MOD = 104659;
bool isNotPossib[100][100];
int dp[30][NMAX];
inline int getInt(char t) {return t-'a'+1;}
int main()
{
fin>>n>>m;
for(int i=1;i<=m;i+=1)
{
fin>>c>>r;
isNotPossib[getInt(c)][getInt(r)]=1;
isNotPossib[getInt(r)][getInt(c)]=1;
}
for(int i=getInt('a');i<=getInt('z');i++) dp[i][1]=1;
for(int i=2;i<=n;i+=1)
{
for(int j=getInt('a');j<=getInt('z');j+=1)
for(int k=getInt('a');k<=getInt('z');k+=1)
{
if(!isNotPossib[j][k])
{
dp[j][i] += dp[k][i-1];
dp[j][i] %= MOD;
}
}
}
int answer=0;
for(int i=getInt('a');i<=getInt('z');i++)
{
answer+=dp[i][n];
answer %= MOD;
}
fout<<answer;
return 0;
}