资 源 简 介
递归枚举模板
问题描述：生成长度为n的字串，其字符从26个英文字母的前p(p≤26)个字母中选取，使得没有相邻的子序列相等。例如p=3，n=5时：
// abcba 满足条件
// abcbc 不满足条件
//输入：n p
//输出：所有满足条件的字串及总数-recursive template Problem description : n generation length of the string and its 26 characters from the English alphabet before p (p 26) 000 1984 letter, makes no adjacent sequences equivalent. For example, p = 3, n = 5 :// abcba meet the conditions// abcbc not satisfied conditions// input : n p// output : to satisfy all the conditions and the total number of strings
