Codeforces 143A Help Vasilisa the Wise 2（暴力）

末蓝、 2022-06-05 12:24 90阅读 0赞

Vasilisa the Wise from the Kingdom of Far Far Away got a magic box with a secret as a present from her friend Hellawisa the Wise from the Kingdom of A Little Closer. However, Vasilisa the Wise does not know what the box's secret is, since she cannot open it again. She hopes that you will help her one more time with that.

The box's lock looks as follows: it contains 4 identical deepenings for gems as a 2 × 2 square, and some integer numbers are written at the lock's edge near the deepenings. The example of a lock is given on the picture below.

![3c76c028020a5f4446762132ba1ac3ee_v_1511770749][]

The box is accompanied with 9 gems. Their shapes match the deepenings' shapes and each gem contains one number from 1 to 9 (each number is written on exactly one gem). The box will only open after it is decorated with gems correctly: that is, each deepening in the lock should be filled with exactly one gem. Also, the sums of numbers in the square's rows, columns and two diagonals of the square should match the numbers written at the lock's edge. For example, the above lock will open if we fill the deepenings with gems with numbers as is shown on the picture below.

![1aa4457d5a14e0b6156f58aeca0fe9d7_v_1511770749][]

Now Vasilisa the Wise wants to define, given the numbers on the box's lock, which gems she should put in the deepenings to open the box. Help Vasilisa to solve this challenging task.

Input

The input contains numbers written on the edges of the lock of the box. The first line contains space-separated integers *r*1 and *r*2 that define the required sums of numbers in the rows of the square. The second line contains space-separated integers *c*1 and *c*2 that define the required sums of numbers in the columns of the square. The third line contains space-separated integers *d*1 and *d*2 that define the required sums of numbers on the main and on the side diagonals of the square (1 ≤ *r*1, *r*2, *c*1, *c*2, *d*1, *d*2 ≤ 20). Correspondence between the above 6 variables and places where they are written is shown on the picture below. For more clarifications please look at the second sample test that demonstrates the example given in the problem statement.

![fd07f5a064f49f9f811768cfae70e40b_v_1511770749][]

Output

Print the scheme of decorating the box with stones: two lines containing two space-separated integers from 1 to 9. The numbers should be pairwise different. If there is no solution for the given lock, then print the single number "\-1" (without the quotes).

If there are several solutions, output any.

Example

Input

3 7
    4 6
    5 5

Output

1 2
    3 4

Input

11 10
    13 8
    5 16

Output

4 7
    9 1

Input

1 2
    3 4
    5 6

Output

-1

Input

10 10
    10 10
    10 10

Output

-1

Note

Pay attention to the last test from the statement: it is impossible to open the box because for that Vasilisa the Wise would need 4 identical gems containing number "5". However, Vasilisa only has one gem with each number from 1 to 9.

题解：

很水的暴力题，四重循环，dfs都可以过

代码：

#include<stdio.h>
    #include<string.h>
    #include<stdlib.h>
    #include<queue>
    #include<stack>
    #include<math.h>
    #include<vector>
    #include<map>
    #include<set>
    #include<stdlib.h>
    #include<cmath>
    #include<string>
    #include<algorithm>
    #include<iostream>
    using namespace std;
    struct node
    {
        int a[5];
        int r1,r2,c1,c2,d1,d2;
        void done()
        {
            r2=a[3]+a[4];
            r1=a[1]+a[2];
            d1=a[1]+a[4];
            c1=a[1]+a[3];
            c2=a[2]+a[4];
            d2=a[2]+a[3];
        }
    }t[10005];
    int b[10];
    int ans;
    int vis[10];
    void dfs(int step)
    {
        if(step==4)
        {
            for(int i=0;i<4;i++)
            {
                t[ans].a[i+1]=b[i];
            }
            t[ans].done();
            ans++;
            return ;
        }
        for(int i=1;i<10;i++)
        {
            if(!vis[i])
            {
                b[step]=i;
                vis[i]=1;
                dfs(step+1);
                vis[i]=0;
            }
        }
    }
    int main()
    {
        memset(vis,0,sizeof(vis));
        ans=0;
        dfs(0);
        int r1,r2,c1,c2,d1,d2,tag=0;
        scanf("%d%d%d%d%d%d",&r1,&r2,&c1,&c2,&d1,&d2);
        for(int i=0;i<ans;i++)
        {
            if(t[i].r1==r1&&t[i].r2==r2&&t[i].c1==c1&&t[i].c2==c2&&t[i].d1==d1&&t[i].d2==d2)
            {
                printf("%d %d\n",t[i].a[1],t[i].a[2]);
                printf("%d %d\n",t[i].a[3],t[i].a[4]);
                tag=1;
                break;
            }
        }
        if(!tag)
            printf("-1\n");
        return 0;
    }

[3c76c028020a5f4446762132ba1ac3ee_v_1511770749]: https://odzkskevi.qnssl.com/3c76c028020a5f4446762132ba1ac3ee?v=1511770749
[1aa4457d5a14e0b6156f58aeca0fe9d7_v_1511770749]: https://odzkskevi.qnssl.com/1aa4457d5a14e0b6156f58aeca0fe9d7?v=1511770749
[fd07f5a064f49f9f811768cfae70e40b_v_1511770749]: https://odzkskevi.qnssl.com/fd07f5a064f49f9f811768cfae70e40b?v=1511770749