Pagini recente » Cod sursa (job #717062) | Cod sursa (job #906535) | Cod sursa (job #1885510) | Cod sursa (job #2987439) | Cod sursa (job #2395103)
#include <iostream>
#include <fstream>
using namespace std;
ifstream in("nrcuv.in");
ofstream out("nrcuv.out");
int d[1001][26];
bool a[26][26];
long long sum(int n, int j){
if(j==25){
return d[n][25];
}
return d[n][j]+sum(n, j+1)%104659;
}
int main()
{
int n, m;
in>>n>>m;
for(int j=0; j<26; j++){
d[1][j]=1;
}
for(int k=0; k<m; k++){
char x, y;
in>>x>>y;
a[x-'a'][y-'a'] = a[y-'a'][x-'a'] = 1;
}
for(int i=2; i<=n; i++){
for(int j=0; j<26; j++){
for(int k=0; k<26; k++){
if (!a[j][k])
{
d[i][j]+=d[i-1][k];
d[i][j] %= 104659;
}
}
}
}
out<<sum(n, 0)%104659;
return 0;
}