zoukankan      html  css  js  c++  java
  • 1.5.4 Checker Challenge

    Checker Challenge

    Examine the 6x6 checkerboard below and note that the six checkers are arranged on the board so that one and only one is placed in each row and each column, and there is never more than one in any diagonal. (Diagonals run from southeast to northwest and southwest to northeast and include all diagonals, not just the major two.)

              Column
        1   2   3   4   5   6
      -------------------------
    1 |   | O |   |   |   |   |
      -------------------------
    2 |   |   |   | O |   |   |
      -------------------------
    3 |   |   |   |   |   | O |
      -------------------------
    4 | O |   |   |   |   |   |
      -------------------------
    5 |   |   | O |   |   |   |
      -------------------------
    6 |   |   |   |   | O |   |
      -------------------------
    

    The solution shown above is described by the sequence 2 4 6 1 3 5, which gives the column positions of the checkers for each row from 1 to 6:

    ROW 1 2 3 4 5 6
    COLUMN 2 4 6 1 3 5

    This is one solution to the checker challenge. Write a program that finds all unique solution sequences to the Checker Challenge (with ever growing values of N). Print the solutions using the column notation described above. Print the the first three solutions in numerical order, as if the checker positions form the digits of a large number, and then a line with the total number of solutions.

    Special note: the larger values of N require your program to be especially efficient. Do not precalculate the value and print it (or even find a formula for it); that's cheating. Work on your program until it can solve the problem properly. If you insist on cheating, your login to the USACO training pages will be removed and you will be disqualified from all USACO competitions. YOU HAVE BEEN WARNED.

    TIME LIMIT: 1 CPU second

    PROGRAM NAME: checker

    INPUT FORMAT

    A single line that contains a single integer N (6 <= N <= 13) that is the dimension of the N x N checkerboard.

    SAMPLE INPUT (file checker.in)

    6
    

    OUTPUT FORMAT

    The first three lines show the first three solutions found, presented as N numbers with a single space between them. The fourth line shows the total number of solutions found.

    SAMPLE OUTPUT (file checker.out)

    2 4 6 1 3 5
    3 6 2 5 1 4
    4 1 5 2 6 3
    4
    

    {
    ID: makeeca1
    PROG: checker
    LANG: PASCAL
    }
    program checker;
    var a:array[0..20]of longint;
        n,upperlim,sum:longint;
    procedure test(row,ld,rd,t:longint);
    var pos,p,i:longint;
    begin
      if row<>upperlim then
      begin
        pos:=upperlim and not (row or ld or rd);
        while pos<>0 do
        begin
          p:=pos and -pos;
          a[t]:=p;
          pos:=pos-p;
          test(row+p,(ld+p)shl 1,(rd+p)shr 1,t+1);
        end;
      end else
      begin
        inc(sum);
        if sum<=3 then
        begin
          for i:=0 to n-2 do write(round((ln(a[i])/ln(2)))+1,' ');//use round,not trunc!!!
          writeln(round(ln(a[n-1])/ln(2))+1);
        end;
      end;
    end;
    begin
      assign(input,'checker.in');reset(input);
      assign(output,'checker.out');rewrite(output);
      readln(n);
      upperlim:=(1 shl n)-1;
      test(0,0,0,0);
      writeln(sum);
      close(input);close(output);
    end.
  • 相关阅读:
    Oracle中快速查找锁与锁等待
    Oracle查看、修改连接数
    内置数据类型
    代码片段一
    设计模式学习四:依赖倒置原则
    队列
    设计模式学习六:代理模式
    linux 自学系列:一直kill掉多个进程
    设计模式学习五:装饰器模式
    通过__metaclass__为类动态增加方法实例
  • 原文地址:https://www.cnblogs.com/makeecat/p/3274533.html
Copyright © 2011-2022 走看看