Codeforces Round #199 (Div. 2) A. Xenia and Divisors

A. Xenia and Divisors

time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

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  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  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.

Sample test(s)

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

解题报告

此题题意不难理解，就是寻找满足条件的方式，很显然只有（1,2,4），（1,2,6），（1,3,6）能满足条件，然后采取贪心的思想，设置三个变量分别存3,4的个数和n/3-（3和4的个数）。然后判断是否有足够的1,2,6，并且不能有5或7，第三个变量是否大于等于0。如果都满足就逐个输出，不然就输出-1。代码如下：

#include <iostream>
#include<cstring>
#include<cstdio>
using namespace std;
int l[8];
int main()
{
    int n,h;
    int i,j,k;
    int t1,t2,t3,ans;
    memset(l,0,sizeof(l));
    scanf("%d",&n);
    for(i=1;i<=n;i++)
    {
        scanf("%d",&h);
        l[h]++;
    }
    ans=n/3;
	t1=l[3];t2=l[4];t3=ans-t1-t2 ;

	if(l[1]==t1+t2+t3&&t3>=0&&l[6]==t1+t3&&l[2]==t2+t3&&l[5]==0&&l[7]==0)
	{
		for(i=0;i<t2;i++)
		printf("1 2 4\n");
		for(i=0;i<t3;i++)
		printf("1 2 6\n");
		for(i=0;i<t1;i++)
		printf("1 3 6\n");
	}
	else printf("-1\n");
	return 0;
}