zoukankan      html  css  js  c++  java
  • 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 tex2html_wrap_inline39 , 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.

     1 #include<cstdio>
     2 int a[100],n,l,t;
     3 void prt(int p)
     4 {
     5     int i;
     6     for (i=1;i<=p;i++)
     7     {
     8         printf("%c",a[i]-1+'A');
     9         if (i%64==0||i==p) printf("
    ");
    10         else if (i%4==0) printf(" ");
    11     }
    12     printf("%d
    ",p);
    13 }
    14 void dfs(int cur)
    15 {
    16     if (t==n)
    17     {
    18         prt(cur-1);
    19         return;
    20     }
    21     int i,j,k,p,q,x,y,z;
    22     bool b,bb;
    23     for (i=1;i<=l;i++)
    24     {
    25         a[cur]=i;
    26         bb=1;
    27         for (j=1;j*2<=cur;j++)
    28         {
    29             b=0;
    30             for (k=cur-j+1;k<=cur;k++)
    31               if (a[k-j]!=a[k])
    32               {
    33                   b=1;
    34                   break;
    35               }
    36             if (!b)
    37             {
    38                 bb=0;
    39                 break;
    40             }
    41         }
    42         if (bb)
    43         {
    44             t++;
    45             dfs(cur+1);
    46             if (t>=n) return; 
    47         }
    48     }
    49 }
    50 int main()
    51 {
    52     while (scanf("%d%d",&n,&l)&&n&&l)
    53     {
    54         t=0;
    55         dfs(1);
    56     }
    57 }

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

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

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

  • 相关阅读:
    JAVA:连接池技术说明以及MVC设计模式理解
    SoftLayer®凭借Flex Images™消融物理与虚拟服务器之间的界线
    InternetExplorer 表单及用户名密码提交
    devStack
    windows平台vhd磁盘文件挂载
    xen vhd操作工具source code研读
    windows 基于命令行制作vhd虚拟磁盘
    vhd镜像格式及vhd-util工具应用
    mongoDB windows reinstall add auth
    MongoDb Windows linux平台环境及主流编程语言驱动安装同时配置mongoDb的远程连接
  • 原文地址:https://www.cnblogs.com/SBSOI/p/5575027.html
Copyright © 2011-2022 走看看