Pagini recente » Diferente pentru fmi-no-stress-7/solutii intre reviziile 15 si 14 | Cod sursa (job #1599056)
#include<fstream>
#define mod 104659
using namespace std;
int n, m, D[1002][27], sol, i, j, k;
char x, y;
bool u[27][27];
ifstream in("nrcuv.in");
ofstream out("nrcuv.out");
int main()
{
in>>n>>m;
for(i=1; i<=m; i++)
{
in>>x>>y;
u[x-'a'][y-'a']=1;
u[y-'a'][x-'a']=1;
}
for(i=0; i<=25; i++)
D[1][i]=1;
for(i=2; i<=n; i++)
{
for(j=0; j<=25; j++)
{
for(k=0; k<=25; k++)
if(u[j][k]==0)
D[i][k]=(D[i][k]+D[i-1][j])%mod;
}
}
for(i=0; i<=25; i++)
sol+=D[n][i];
out<<sol%mod;
return 0;
}