Pagini recente » Cod sursa (job #1113386) | Cod sursa (job #1148538) | Cod sursa (job #90601) | Cod sursa (job #28144) | Cod sursa (job #1691947)
#include<fstream>
using namespace std;
ifstream f("nrcuv.in");
ofstream g("nrcuv.out");
const int mod=104659;
int n,m,s[30][30],bst[1005][30];
char a,b;
int main()
{
f>>n>>m;
while(m--)
{
f>>a>>b;
s[a-'a'+1][b-'a'+1] = 1;
s[b-'a'+1][a-'a'+1] = 1;
}
for(int i=1;i<=26;i++)
bst[1][i]=1;
for(int i=2;i<=n;i++)
for(int j=1;j<=26;j++)
for(int l=1;l<=26;l++)
if(s[j][l]==0)
bst[i][l]=(bst[i][l]+bst[i-1][j])%mod;
int rez=0;
for(int i=1;i<=26;i++)
rez=(rez+bst[n][i])%mod;
g<<rez;
return 0;
}