Pagini recente » Cod sursa (job #1069729) | Cod sursa (job #1623562) | Cod sursa (job #1826265) | Cod sursa (job #154175) | Cod sursa (job #1852044)
#include <iostream>
#include <fstream>
using namespace std;
const int MOD = 104659;
int d[1010][30];
bool v[30][30];
int main()
{
ifstream fin ("nrcuv.in");
ofstream fout ("nrcuv.out");
int n,m,i,j,k;
char a,b;
long long suma=0;
fin>>n>>m;
for(i=1; i<=m; i++)
{
fin>>a>>b;
v[a-'a'+1][b-'a'+1]=1;
v[b-'a'+1][a-'a'+1]=1;
}
for(i=1; i<=26; i++)
d[1][i]=1;
for(i=2; i<=n; i++)
{
for(j=1; j<=26; j++)
{
suma=0;
for(k=1; k<=26; k++)
{
if(v[j][k]==0)
suma+=d[i-1][k];
}
d[i][j]=suma%MOD;
}
}
suma=0;
for(i=1; i<=26; i++)
{
suma+=d[n][i];
suma%=MOD;
}
fout<<suma;
return 0;
}