Pagini recente » Cod sursa (job #329740) | Cod sursa (job #2924640) | Cod sursa (job #2415805) | Cod sursa (job #391108) | Cod sursa (job #2674530)
#include <iostream>
#include <fstream>
#include <cstring>
using namespace std;
ifstream in("nrcuv.in");
ofstream out("nrcuv.out");
const int N=1001;
const int modul=104659;
int DP[N][26];
bool a[26][26];
int n,m;
char l1,l2;
int main()
{
in>>n>>m;
for(int i=1; i<=m; i++)
{
in>>l1>>l2;
a[l1-'a'][l2-'a']=true;
a[l2-'a'][l1-'a']=true;
}
int l='z'-'a';
for(int i=0;i<=l;i++)
{
DP[1][i]=1;
}
int suma=0;
for(int i=2;i<=n;i++)
{
for(int j=0;j<=l;j++)
{
for(int k=0;k<=l;k++)
{
if(!a[j][k])
{
DP[i][j]+=DP[i-1][k];
}
DP[i][j]=DP[i][j]%modul;
}
}
}
for(int i=0;i<=l;i++)
{
suma+=DP[n][i];
suma=suma%modul;
}
out<<suma;
return 0;
}