Pagini recente » Cod sursa (job #777830) | Cod sursa (job #2627327) | Cod sursa (job #2590666) | Cod sursa (job #278821) | Cod sursa (job #1613779)
#include<fstream>
#define ALFABET 26
#define LMAX 1001
#define LIM 104659
//#define a 97
using namespace std;
FILE*in;
ofstream out("nrcuv.out");
int lungime;
int nr_perechi;
bool perechi[ALFABET][ALFABET];
long int cuvinte[LMAX][ALFABET];
long int solution;
char a, b;
void read()
{
in=fopen("nrcuv.in", "r");
fscanf(in, "%d%d ", &lungime, &nr_perechi);
for (int i=1; i<=nr_perechi; i++)
{
fscanf(in,"%c %c " ,&a,&b);
perechi[a-'a'][b-'a']=1;
perechi[b-'a'][a-'a']=1;
}
}
void build_cuvinte()
{
for (int i=0; i<ALFABET; i++)
cuvinte[1][i]=1;
for (int i=2; i<=lungime; i++)
for (int j=0; j<ALFABET; j++)
for (int k=0; k<ALFABET; k++)
if (!perechi[j][k])
cuvinte[i][j]=(cuvinte[i][j]+cuvinte[i-1][k])%LIM;
}
void build_solution()
{
for (int i=0; i<ALFABET; i++)
solution=(solution+cuvinte[lungime][i])%LIM;
}
void solve()
{
build_cuvinte();
build_solution();
}
void show()
{
out<<solution;
}
int main()
{
read();
solve();
show();
return 0;
}