Pagini recente » Cod sursa (job #2669460) | Cod sursa (job #1848426) | Cod sursa (job #1329181) | Cod sursa (job #502167) | Cod sursa (job #2704054)
#include <fstream>
using namespace std;
ifstream in("nrcuv.in");
ofstream out("nrcuv.out");
int tab[30][30];
long long dp[1005][30] , s;
int main(){
int n, p;
in >> n >> p;
for(int i = 0; i < p; i++)
{
char x, y;
in >> x >> y;
tab[x - 'a'][y - 'a'] = tab[y - 'a'][x - 'a'] = 1;
}
for(int j = 0; j < 26; j++)
{
dp[1][j] = 1;
}
for(int i = 2; i <= n; i++)
{
for(int j = 0; j < 26; j++)
{
for(int k = 0; k < 26; k++)
{
if( !tab[j][k] )
{
dp[i][j] += dp[i - 1][k];
dp[i][j] %= 104659;
}
}
}
}
for(int i = 0; i < 26; i++)
{
s += dp[n][i];
s %= 104659;
}
out << s;
}