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