uva 129 krypton factors ——yhx

 Krypton Factor 

You have been employed by the organisers of a Super Krypton Factor Contest in which contestants have very high mental and physical abilities. In one section of the contest the contestants are tested on their ability to recall a sequence of characters which has been read to them by the Quiz Master. Many of the contestants are very good at recognising patterns. Therefore, in order to add some difficulty to this test, the organisers have decided that sequences containing certain types of repeated subsequences should not be used. However, they do not wish to remove all subsequences that are repeated, since in that case no single character could be repeated. This in itself would make the problem too easy for the contestants. Instead it is decided to eliminate all sequences containing an occurrence of two adjoining identical subsequences. Sequences containing such an occurrence will be called ``easy''. Other sequences will be called ``hard''.

For example, the sequence ABACBCBAD is easy, since it contains an adjoining repetition of the subsequence CB. Other examples of easy sequences are:

• BB
• ABCDACABCAB
• ABCDABCD

Some examples of hard sequences are:

• D
• DC
• ABDAB
• CBABCBA

Input and Output

In order to provide the Quiz Master with a potentially unlimited source of questions you are asked to write a program that will read input lines that contain integers n and L (in that order), where n > 0 and L is in the range , and for each input line prints out the nth hard sequence (composed of letters drawn from the first L letters in the alphabet), in increasing alphabetical order (alphabetical ordering here corresponds to the normal ordering encountered in a dictionary), followed (on the next line) by the length of that sequence. The first sequence in this ordering is A. You may assume that for given n and L there do exist at least n hard sequences.

For example, with L = 3, the first 7 hard sequences are:

A

AB

ABA

ABAC

ABACA

ABACAB

ABACABA

As each sequence is potentially very long, split it into groups of four (4)
characters separated by a space. If there are more than 16 such groups,
please start a new line for the 17th group.

Therefore, if the integers 7 and 3 appear on an input line, the output lines
produced should be

ABAC ABA
7

Input is terminated by a line containing two zeroes. Your program may assume a maximum sequence length of 80.

 #include<cstdio>
 int a[],n,l,t;
 void prt(int p)
 {
     int i;
     for (i=;i<=p;i++)
     {
         printf("%c",a[i]-+'A');
         if (i%==||i==p) printf("\n");
         else if (i%==) printf(" ");
     }
     printf("%d\n",p);
 }
 void dfs(int cur)
 {
     if (t==n)
     {
         prt(cur-);
         return;
     }
     int i,j,k,p,q,x,y,z;
     bool b,bb;
     for (i=;i<=l;i++)
     {
         a[cur]=i;
         bb=;
         for (j=;j*<=cur;j++)
         {
             b=;
             for (k=cur-j+;k<=cur;k++)
               if (a[k-j]!=a[k])
               {
                   b=;
                   break;
               }
             if (!b)
             {
                 bb=;
                 break;
             }
         }
         if (bb)
         {
             t++;
             dfs(cur+);
             if (t>=n) return;
         }
     }
 }
 int main()
 {
     while (scanf("%d%d",&n,&l)&&n&&l)
     {
         t=;
         dfs();
     }
 }

在每填一位时，检查以他为终点的所有连续的两个长度相同的子串，如果都不相同则满足。因为以他之前的字符结尾的所有相邻且长度相等的子串对都已经在之前验证过合法了。

用一个计数器统计目前得到的解的个数，注意退出条件（一旦达到个数要退出所有子函数）。

dfs时不需回溯，甚至每组数据都不用清零，因为之后填的会覆盖之前填的。