Pagini recente » Cod sursa (job #3270786) | Cod sursa (job #198961) | Cod sursa (job #665236) | Cod sursa (job #198890) | Cod sursa (job #1268578)
#include <fstream>
using namespace std;
ifstream fin("nrcuv.in");
ofstream fout("nrcuv.out");
int i, j, j1, n, m, ok, s;
char c, k;
int a[26][1001], L[26][26];
int main(){
fin >> n >> m;
for(i = 1; i <= m; i ++){
fin >> c >> k;
L[c - 'a'][k - 'a'] = 1;
L[k - 'a'][c - 'a'] = 1;
}
for(i = 0; i <= 25; i ++)
a[1][i] = 1;
for(i = 1; i <= n; i ++){
for(j = 0; j <= 25; j ++)
for(j1 = 0; j1 <= 25; j1 ++){
if(L[j][j1] == 0){
a[j][i]+=a[j1][i-1]%104659;
a[j][i]%=104659;
}
}
}
for(i = 0; i <= 25; i ++)
s += a[i][n];
fout << s % 104659;
return 0;
}