Pagini recente » Cod sursa (job #2373788) | Cod sursa (job #1803865) | Cod sursa (job #2965213) | Cod sursa (job #3234603) | Cod sursa (job #1024152)
#include <fstream>
using namespace std;
ifstream in("nrcuv.in");
ofstream out("nrcuv.out");
const int N = 1001, ALFA = 27, PRIM = 104659;
bool incompatibil[ALFA][ALFA];
int comb[N][ALFA];
int main()
{
int n, k, rez = 0, i, j;
char a, b;
in >> n >> k;
for(i = 1; i <= k; i++){
in >> a >> b;
incompatibil[int(a)-'a'+1][int(b)-'a'+1] = true;
incompatibil[int(b)-'a'+1][int(a)-'a'+1] = true;
}
for(j = 1; j < ALFA; j++){
comb[1][j] = 1;
}
for(i = 2; i <= n; i++){
for(j = 1; j < ALFA; j++){
for(k = 1; k < ALFA; k++){
comb[i][j] += (comb[i-1][k]*!(incompatibil[k][j]))%PRIM;
}
}
}
for(j = 1; j < ALFA; j++){
rez += comb[n][j];
}
out << rez;
return 0;
}