Pagini recente » Cod sursa (job #1365749) | Cod sursa (job #291745) | Cod sursa (job #1104667) | Cod sursa (job #2922543) | Cod sursa (job #2932071)
#include <iostream>
#include <fstream>
using namespace std;
ifstream in("nrcuv.in");
ofstream out("nrcuv.out");
bool a[27][27];
int nr[1001][27];
const int mod=104659;
int main()
{
char x1,x2;
int n,m;
in>>n>>m;
for(int i=1; i<=m; i++)
{
in>>x1>>x2;
a[x1-'a'+1][x2-'a'+1]=1;
a[x2-'a'+1][x1-'a'+1]=1;
}
for(int i=1; i<=26; i++)
{
nr[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[j][k]==0)
{
nr[i][j]=(nr[i][j]%mod+nr[i-1][k]%mod)%mod;
}
}
int r=0;
for(int i=1; i<=26; i++)
r=(r%mod+nr[n][i]%mod)%mod;
out<<r;
return 0;
}