Pagini recente » Cod sursa (job #2196595) | Cod sursa (job #1619296) | Cod sursa (job #3036399) | Cod sursa (job #808972) | Cod sursa (job #1015609)
#include<fstream>
using namespace std;
const int MOD=104659;
int a[1005][30],i,j,n,k,g[30][30],m;
char c1,c2;
int main(void) {
ifstream fin("nrcuv.in");
ofstream fout("nrcuv.out");
fin>>n>>m;
for (i=1; i<=m; ++i) {
fin>>c1>>c2;
g[c1-96][c2-96]=g[c2-96][c1-96]=1;
}
for (i=1; i<=26; ++i) a[1][i]=1;
for (i=2; i<=n; ++i)
for (j=1; j<=26; ++j)
for (k=1; k<=26; ++k)
if (g[j][k]==0) a[i][j]=(a[i][j]+a[i-1][k])%MOD;
int rez=0;
for (i=1; i<=26; ++i) rez=(rez+a[n][i])%MOD;
fout<<rez;
return(0);
}