Cod sursa(job #1371615)

Utilizator fluture.godlikeGafton Mihnea Alexandru fluture.godlike Data 3 martie 2015 22:55:30
Problema Lista lui Andrei Scor 0
Compilator cpp Status done
Runda Arhiva de probleme Marime 0.78 kb
#include <cstdio>
#define NRCUV 26
#define NMAX 1023
using namespace std;
FILE *fin, *fout;
int n, m, d[NMAX][NRCUV+3], sum;
bool check[NRCUV + 3][NRCUV + 3];
char x[3], y[3];
int main()
{
	fin = freopen("nrcuv.in", "r", stdin);
	fout = freopen("nrcuv.out", "w", stdout);
	scanf("%d%d", &n, &m);
	printf("%d %d\n", n, m);
	for(int i = 0; i< m; i++)
	{
		scanf("%s%s", x, y);
		printf("%c %c\n", x[0], y[0]);
		check[x[0]-'a'][y[0]-'a'] = 1;
		check[y[0]-'a'][x[0]-'a'] = 1;
	}
	for(int i = 0; i< NRCUV; i++) d[1][i] = 1;
	for(int i = 1; i<= n; i++)
	{
		for(int j = 0; j< NRCUV; j++)
		{
			for(int k = 0; k< NRCUV; k++)
			{
				if(check[j][k]) continue;
				d[i+1][k] += d[i][j];
			}
		}
	}
	for(int i = 0; i< NRCUV; i++) sum+=d[n][i];
	printf("%d\n", sum);
	fclose(fin);
	fclose(fout);
	return 0;
}