Pagini recente » Cod sursa (job #2367631) | Cod sursa (job #859646) | Cod sursa (job #1339595) | Cod sursa (job #23931) | Cod sursa (job #1828763)
#include <fstream>
using namespace std;
const int M = 104659;
ifstream cin ("nrcuv.in");
ofstream cout ("nrcuv.out");
bool a[26][26];
int d[1003][27];
int main()
{
int n,m,s=0;
char l1, l2;
cin>>n>>m>>ws;
for(int i=0; i<26; i++)
d[1][i]=1;
for(int i=1; i<=m; i++) {
cin>>l1>>ws>>l2>>ws;
a[l1-'a'][l2-'a']=true;
a[l2-'a'][l1-'a']=true;
}
for(int i=2; i<=n; i++)
for(int j=0; j<26; j++)
for(int k=0; k<26; k++)
if(!a[k][j]){
d[i][j]+=d[i-1][k];
d[i][j] %= M;
}
for(int j=0; j<26; j++) {
s+=d[n][j];
s %= M;
}
cout<<s;
return 0;
}