POJ1166 The Clocks （爆搜 || 高斯消元）

总时间限制: 1000ms，内存限制: 65536kB

描述

|-------|    |-------|    |-------|
|       |    |       |    |   |   |
|---O   |    |---O   |    |   O   |
|       |    |       |    |       |
|-------|    |-------|    |-------|
    A            B            C    

|-------|    |-------|    |-------|
|       |    |       |    |       |
|   O   |    |   O   |    |   O   |
|   |   |    |   |   |    |   |   |
|-------|    |-------|    |-------|
    D            E            F    

|-------|    |-------|    |-------|
|       |    |       |    |       |
|   O   |    |   O---|    |   O   |
|   |   |    |       |    |   |   |
|-------|    |-------|    |-------|
    G            H            I
(Figure )

There are nine clocks in a 3*3 array (figure 1). The goal is to return all the dials to 12 o'clock with as few moves as possible. There are nine different allowed ways to turn the dials on the clocks. Each such way is called a move. Select for each move a number 1 to 9. That number will turn the dials 90' (degrees) clockwise on those clocks which are affected according to figure 2 below.

Move   Affected clocks

          ABDE
          ABC
          BCEF
          ADG
          BDEFH
          CFI
          DEGH
          GHI
          EFHI
   (Figure )

输入

Your program is to read from standard input. Nine numbers give the start positions of the dials. 0=12 o'clock, 1=3 o'clock, 2=6 o'clock, 3=9 o'clock.

输出

Your program is to write to standard output. Output a shortest sorted sequence of moves (numbers), which returns all the dials to 12 o'clock. You are convinced that the answer is unique.

样例输入

样例输出

学枚举时候的课程作业，第一次接触到爆搜的魅力，实在是香。不过这题还可以用高斯消元，也是学到了。

爆搜代码

#include <string.h>
#include <stdio.h>
int main()
{
    int i, a[], b[], c[]; //多开一位空间，安全，b[i]就是第i种Move，c[i]就是Move之后第i个时钟的状态
    for (i = ; i <= ; i++)
        scanf("%d", &a[i]); //读入初始状态
    //枚举每一种移动方法，每一种可实施0,1,2,3次
    for (b[] = ; b[] <= ; b[]++)
        for (b[] = ; b[] <= ; b[]++)
            for (b[] = ; b[] <= ; b[]++)
                for (b[] = ; b[] <= ; b[]++)
                    for (b[] = ; b[] <= ; b[]++)
                        for (b[] = ; b[] <= ; b[]++)
                            for (b[] = ; b[] <= ; b[]++)
                                for (b[] = ; b[] <= ; b[]++)
                                    for (b[] = ; b[] <= ; b[]++)
                                    {
                                        c[] = (a[] + b[] + b[] + b[]) % ;
                                        c[] = (a[] + b[] + b[] + b[] + b[]) % ;
                                        c[] = (a[] + b[] + b[] + b[]) % ;
                                        c[] = (a[] + b[] + b[] + b[] + b[]) % ;
                                        c[] = (a[] + b[] + b[] + b[] + b[] + b[]) % ;
                                        c[] = (a[] + b[] + b[] + b[] + b[]) % ;
                                        c[] = (a[] + b[] + b[] + b[]) % ;
                                        c[] = (a[] + b[] + b[] + b[] + b[]) % ;
                                        c[] = (a[] + b[] + b[] + b[]) % ;
                                        if (c[] + c[] + c[] + c[] + c[] + c[] + c[] + c[] + c[] == )
                                        {
                                            for (i = ; i < b[]; i++) printf("1 ");
                                            for (i = ; i < b[]; i++) printf("2 ");
                                            for (i = ; i < b[]; i++) printf("3 ");
                                            for (i = ; i < b[]; i++) printf("4 ");
                                            for (i = ; i < b[]; i++) printf("5 ");
                                            for (i = ; i < b[]; i++) printf("6 ");
                                            for (i = ; i < b[]; i++) printf("7 ");
                                            for (i = ; i < b[]; i++) printf("8 ");
                                            for (i = ; i < b[]; i++) printf("9 ");
                                            printf("\n");
                                            return();
                                        }
                                    }
}

高斯消元做法链接：

https://blog.csdn.net/sf____/article/details/9863927