Pagini recente » Cod sursa (job #2829389) | Cod sursa (job #496348) | Cod sursa (job #1899190) | Cod sursa (job #1626459) | Cod sursa (job #2350881)
#include <fstream>
#include <iostream>
using namespace std;
ifstream in("nrcuv.in");
ofstream out("nrcuv.out");
const int LIT=28, M=2001, MOD=104659;
bool ok[LIT][LIT];
int d[M][27];
int n,m;
void read()
{
in>>n>>m;
char c1,c2;
for(int i=0;i<m;++i)
{
in>>c1>>c2;
ok[c1-'a'][c2-'a']=ok[c2-'a'][c1-'a']=true;
}
}
int main()
{
read();
for(int i=0;i<26;++i)
{
d[1][i]=1;
}
for(int i=2;i<=n;++i)
{
for(int j=0;j<26;++j)
{
d[i][j]=0;
for(int k=0;k<26;++k)
{
if(ok[j][k]==false)
{
d[i][j]+=d[i-1][k];
d[i][j] %= MOD;//d[i][j] = d[i][j] + d[i-1][k]%MOD
}
}
}
}
int ans=0;
for(int i=0;i<26;++i)
{
ans+=d[n][i]%MOD;
ans%=MOD;
}
out<<ans;
return 0;
}