Pagini recente » Cod sursa (job #1045268) | Cod sursa (job #2627032) | Cod sursa (job #1502273) | Cod sursa (job #1156340) | Cod sursa (job #2209825)
#include <fstream>
using namespace std;
int n, m, i, j, k, s;
char l1, l2;
int a[28][28], D[2100][28];
int main () {
ifstream fin ("nrcuv.in");
ofstream fout ("nrcuv.out");
fin>>n>>m;
for (i=1;i<=m;i++) {
fin>>l1>>l2;
a[l1-'a'][l2-'a']=1;
}
for (i=0;i<=25;i++) {
D[1][i]=1;
}
for (i=2;i<=n;i++) {
for (j=0;j<=25;j++)
for (k=0;k<=25;k++)
if (a[k][j]==0 && a[j][k]==0)
D[i][j] = (D[i-1][k] + D[i][j]) % 104659;
}
for (i=0;i<=25;i++) {
s = (s+D[n][i])%104659;
}
fout<<s%104659;
return 0;
}