CodeForces - 342A

最新推荐文章于 2022-02-21 23:07:16 发布

原创最新推荐文章于 2022-02-21 23:07:16 发布 · 324 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#CodeForces #水

CodeForces 专栏收录该内容

7 篇文章

订阅专栏

本文介绍了一个关于数字分组的问题，要求将输入的数字序列（数字范围为1到7）分成若干组，每组三个数且满足特定条件。通过分析给出了解决方案，并附带了完整的代码实现。

Xenia the mathematician has a sequence consisting of n (n is divisible by 3) positive integers, each of them is at most 7. She wants to split the sequence into groups of three so that for each group of three a, b, c the following conditions held:

a < b < c;
a divides b, b divides c.

Naturally, Xenia wants each element of the sequence to belong to exactly one group of three. Thus, if the required partition exists, then it has $\text{[math]}$ groups of three.

Help Xenia, find the required partition or else say that it doesn't exist.

Input

The first line contains integer n (3 ≤ n ≤ 99999) — the number of elements in the sequence. The next line contains n positive integers, each of them is at most 7.

It is guaranteed that n is divisible by 3.

Output

If the required partition exists, print $\text{[math]}$ groups of three. Print each group as values of the elements it contains. You should print values in increasing order. Separate the groups and integers in groups by whitespaces. If there are multiple solutions, you can print any of them.

If there is no solution, print -1.

Examples

input
6
1 1 1 2 2 2

output
-1

input
6
2 2 1 1 4 6

output
1 2 4
1 2 6

题意：给定一些数字，最大是7，问能不能分成很多组数，每组3个数（输入里说了，n一定能整除3），每组数里的三个数满足a<b<c&&b%a == 0&&c%b == 0。有解就输出任意一组解，没有就输出-1

思路：从题意中可以推出，有5和7肯定不对，能组成的3个数的组合也是有限的，即（1 2 4,1 2 6,1 3 6）。首先3和4的个数是唯一的，然后为了和4组合需要用掉等数量的2，同理也需要等数量的6，然后如果剩余的2和6的数量相等，就说明可以组成。一开始wa了一发，因为忘了还有1的个数没判断。因为1的个数和6的个数加4的个数总和相等，所以，需要再加个判断。

#include<cstdio>
using namespace std;
int num[10];
int main()
{
    int n;
    scanf("%d",&n);
    for(int i = 0;i < n;i++)
    {
        int m;
        scanf("%d",&m);
        num[m]++;
    }
    int o = 0,p = 0,q = 0;
    if(num[5]>0||num[7]>0||num[1]!=num[6]+num[4])
        printf("-1\n");
    else{
        int n4 = num[4];
        int n6 = num[6];
        int n2 = num[2];
        int n3 = num[3];
        n2-=n4;
        if(n2<0)
            printf("-1\n");
        else
        {
            n6 -= n2;
            if(n3!=n6)
            {
                printf("-1\n");
            }
            else
            {
                for(int i = 0;i < n4;i++)
                    printf("1 2 4\n");
                for(int i = 0;i < n2;i++)
                    printf("1 2 6\n");
                for(int i = 0;i < n3;i++)
                    printf("1 3 6\n");

            }
        }
    }
    return 0;
}