CodeForces 342A Xenia and Divisors

A. Xenia and Divisors

time limit per test

1 second

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

这道题起初看起来很复杂，没有思路

但是注意题目给了一个很重要的限制条件：这些整数不能大于7

也就是只可能出现 1, 2, 3, 4, 5, 6, 7 这7个数字

观察发现只可能出现以下三种组合：

• 1      2      4
• 1      2      6
• 1      3      6

因此就相当于判断输入的数字是否满足 m*(1, 2, 4) + n*(1, 2, 6) + k*(1, 3, 6) = S （S为输入数据中各数字出现的次数）

再观察，可以发现2的个数一定比4多，即 cnt(2) > cnt(4)

                             6的个数一定比3多，即 cnt(6) > cnt(3)

                             1的个数等于2的个数加3的个数，即                   cnt(1) = cnt(2) + cnt(3)

                             6的个数加4的个数等于2的个数加3的个数，即   cnt(6) + cnt(4) = cnt(2) + cnt(3)

代码如下：

#include<iostream>
#include<string>
#include<cstring>
#include<cmath>
#include<algorithm>
using namespace std;

int main() {
  int n;
  cin >> n;
  int seq[n], cnt[8];
  memset(cnt, 0, sizeof(cnt));
  for (int i = 0; i < n; i++) {
    cin >> seq[n];
    if (seq[n] == 5 || seq[n] == 7) { cout << -1 << endl; return 0; }
    cnt[seq[n]]++;
  }
  if (cnt[1] != cnt[2]+cnt[3] || cnt[3] > cnt[6] || cnt[4] > cnt[2] || cnt[2]+cnt[3] != cnt[4]+cnt[6]) {
    cout << -1 << endl;
    return 0;
  }
  for (int j = 0; j < cnt[4]; j++) cout << "1 2 4" << endl;
  for (int j = 0; j < cnt[3]; j++) cout << "1 3 6" << endl;
  for (int j = 0; j < cnt[6]-cnt[3]; j++) cout << "1 2 6" << endl;
  return 0;
}