Pagini recente » Cod sursa (job #1584212) | Cod sursa (job #1035777) | Statistici Lentoiu Andrei (Recordbraker69) | Cod sursa (job #2821917) | Cod sursa (job #1809799)
#include <fstream>
#define mmax 2001
#define al 27
#define modal 104659
using namespace std;
ifstream fin("nrcuv.in");
ofstream fout("nrcuv.out");
int n,m,a[al][al],d[mmax][al],rez;
char x,y;
inline void read()
{
fin>>n>>m;
for(int i=1;i<=m;i++)
{
fin>>x>>y;
a[x-'a'+1][y-'a'+1]=1;
a[y-'a'+1][x-'a'+1]=1;
}
}
inline void solve()
{
int i,j,h;
for(i=1;i<=26;i++)
{
d[1][i]=1;
}
for(int i=2;i<=n;i++)
{
for(j=1;j<27;j++)
{
for(h=1;h<27;h++)
{
if(!a[j][h])
{
d[i][h]+=d[i-1][h];
d[i][h]%=modal;
}
}
}
}
for(i=1;i<=26;i++)
{
rez+=d[n][i];
rez%=modal;
}
fout<<rez;
}
int main()
{
read();
solve();
return 0;
}