-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy path892_contest.cpp
More file actions
64 lines (59 loc) · 1.21 KB
/
Copy path892_contest.cpp
File metadata and controls
64 lines (59 loc) · 1.21 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
#include <iostream>
#include <algorithm>
#include <array>
#include <vector>
#include <map>
#include <cmath>
using namespace std;
int main()
{
int t;
cin >> t;
while (t--)
{
int n;
cin >> n;
vector<int> a(n, 0);
for (int i = 0; i < n; i++)
{
cin >> a[i];
}
sort(a.begin(), a.end());
vector<int> b, c;
// Separate elements into b and c
b.push_back(a[0]);
for (int i = 1; i < n; i++)
{
for (int j = 0; j < b.size(); j++)
{
if (b[j] % a[i] == 0)
{
b.push_back(a[i]);
}
else
{
c.push_back(a[i]);
}
}
}
if (c.size()==0)
{
cout << "-1" << endl;
}
else
{
cout << b.size() << " " << c.size() << endl;
for (int num : b)
{
cout << num << " ";
}
cout << endl;
for (int num : c)
{
cout << num << " ";
}
cout << endl;
}
}
return 0;
}