Pagini recente » Cod sursa (job #2520031) | Cod sursa (job #1410369) | Cod sursa (job #690478) | Cod sursa (job #2082054) | Cod sursa (job #2700892)
#include <fstream>
using namespace std;
int dp[1001][26];
bool incomp[26][26];
ifstream cin("nrcuv.in");
ofstream cout("nrcuv.out");
int main()
{
int N, M, i, j, k;
cin>>N>>M;
for(i=0; i<M; i++)
{
char c1, c2;
cin>>c1>>c2;
incomp[c1-'a'][c2-'a'] = incomp[c2-'a'][c1-'a'] = 1;
}
for(j=0; j<26; j++){
dp[1][j]=1;
}
for(i=2; i<=N; i++)
{
for(j=0; j<26; j++)
{
for(k=0; k<26; k++)
{
if(incomp[j][k] == 0)
{
dp[i][j] = dp[i][j] + dp[i-1][k];
dp[i][j] %= 104659;
}
}
}
}
int s=0;
for(i=0; i<26; i++)
{
s = s + dp[N][i];
}
cout<<s%104659;
return 0;
}