Pagini recente » Cod sursa (job #2637247) | Cod sursa (job #2194512) | Cod sursa (job #519968) | Cod sursa (job #2925843) | Cod sursa (job #1164579)
#include<fstream>
#define MOD 104659
using namespace std;
ifstream f("nrcuv.in");
ofstream g("nrcuv.out");
int s,n,m,a[30][30],dp[1009][30];
int main()
{
char x,y;
f >> n >> m;
for(int i=1;i<=m;i++)
{
f >> x >> y;
a[x-'a'+1][y-'a'+1] = a[y-'a'+1][x-'a'+1] = 1;
}
for(int i=1; i<=26; i++) dp[1][i]=1;
for(int i=2; i<=n; i++)
{
for(int j=1; j<=26; j++)
{
for(int k=1; k<=26; k++)
{
if(a[k][j]==0)
dp[i][j] = (dp[i][j]+dp[i-1][k]) % MOD;
}
}
}
for(int i=1; i<=26; i++)
s=(s+dp[n][i])%MOD;
g << s << '\n';
g.close();
return 0;
}