-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy path1535B_ArrayReodering.cpp
More file actions
55 lines (44 loc) · 1.06 KB
/
1535B_ArrayReodering.cpp
File metadata and controls
55 lines (44 loc) · 1.06 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
//* 28462433 Oct/17/2023 01:51UTC+7 Minh4893IT B - Array Reodering GNU C++14 Accepted 280 ms 0 KB
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define ss stringstream
#define endl "\n"
#define LLMAX INT64_MAX
#define IF(cond, t, f) (cond ? t : f)
#define OFILE(finp, fout) freopen(finp, "r", stdin), freopen(fout, "w", stdout)
#define FAST_IO ios_base::sync_with_stdio(false), cin.tie(NULL)
#define MULTI \
int t; \
cin >> t; \
while (t--)
bool comp(int &a, int &b)
{
if (a % 2 == 0)
return true;
if (b % 2 == 0)
return false;
return a > b;
}
void solve()
{
int n;
cin >> n;
array<int, 2000> arr;
for (int i = 0; i < n; ++i)
cin >> arr[i];
sort(arr.begin(), arr.begin() + n, [](int &a, int &b)
{ return (a & 1) < (b & 1); });
int result = 0;
for (int i = 0; i < n; ++i)
for (int j = i + 1; j < n; ++j)
result += __gcd(arr[i], arr[j] << 1) > 1;
cout << result << endl;
}
signed main()
{
FAST_IO;
MULTI
solve();
return 0;
}