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
65
66
67
68
69
70
| #include <bits/stdc++.h>
#pragma optimization_level 3
#pragma GCC optimize("Ofast,no-stack-protector,unroll-loops,fast-math,O3")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx")
#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
#pragma GCC optimization ("unroll-loops")
#define MAX_N 505
#define INF 987654321
#define ll long long
#define pll pair<ll, ll>
#define vpll vector<pll>
#define vall3 vector<array<ll,3>>
#define all5 array<ll,5>
#define vall5 vector<all5>
#define vll vector<ll>
#define vs vector<string>
#define usll unordered_set<ll>
#define vvs vector<vs>
#define vvll vector<vll>
#define all(a) begin(a), end(a)
using namespace std;
string solve(vll &A, ll k) {
ll sum = accumulate(all(A), 0ll);
ll sp = 0;
for(ll i = 0; i < A.size(); i++) {
for(ll j = i + 1; j < A.size(); j++) {
sp += A[i] * A[j];
}
}
if(k == 1) {
if (sum == 0) {
return sp ? "IMPOSSIBLE" : "1";
} else {
return sp % sum == 0 ? to_string(-sp / sum) : "IMPOSSIBLE";
}
} else {
ll n1 = 1 - sum;
ll n2 = accumulate(all(A), sp, [&](ll s, ll& a) {
return s + n1 * a;
});
return to_string(n1) + ' ' + to_string(-n2);
}
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.setf(ios::fixed);
cout.precision(8);
ll tc, n, k;
cin >> tc;
for (ll i = 1; i <= tc; i++) {
ll n, k;
cin>>n>>k;
vll A(n);
for(ll i = 0; i < n; i++)
cin>>A[i];
cout << "Case #" << i << ": " << solve(A,k) << '\n';
}
return 0;
}
|
