Pagini recente » Cod sursa (job #900857) | Cod sursa (job #2193150) | Cod sursa (job #1202489) | Cod sursa (job #141333) | Cod sursa (job #1736219)
#include<iostream>
#include<fstream>
#include<vector>
#define MOD 104659
using namespace std;
int d[1001][30],p[30][30];
vector<int> v[30];
int n,m,i,j,k,sol,sum;
char a,b;
int main()
{
ifstream cin("nrcuv.in");
ofstream cout("nrcuv.out");
cin>>n>>m;
for(i=1;i<=m;i++)
{
cin>>a>>b;
if(p[a-'a'][b-'a']==0){
p[a-'a'][b-'a']=1;
p[b-'a'][a-'a']=1;
v[a-'a'].push_back(b-'a');
if(a!=b)
v[b-'a'].push_back(a-'a');
}
}
for(i=0;i<=25;i++)
d[1][i]=1;
for(i=2;i<=n;i++)
{
sum=0;
for(int j=0;j<=25;j++)
sum=(sum+d[i-1][j])%MOD;
for(j=0;j<=25;j++)
{
int s=0;
for(k=0;k<v[j].size();k++)
s=(s+d[i-1][v[j][k]])%MOD;
d[i][j]=sum-s;
if(d[i][j]<0)
d[i][j]+=MOD;
}
}
for(j=0;j<=25;j++)
sol=(sol+d[n][j])%MOD;
cout<<sol;
return 0;
}