-
Notifications
You must be signed in to change notification settings - Fork 1
/
Copy path1979C Earning on Bets.cpp
74 lines (67 loc) · 1.57 KB
/
1979C Earning on Bets.cpp
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
71
72
73
74
/*
Author : MishkatIT
Created : Sunday 06-06-2024
*/
#include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL
#include "algo/debug.h"
#else
#define debug(...) 42
#endif
using ll = long long;
using ld = long double;
const ll mod = 1e9 + 7;
const ll N = 55;
const ll inf = 1e9;
const ll linf = 1e18;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int tc;
cin >> tc;
while (tc--) {
int n;
cin >> n;
vector<int> k(n);
for (int i = 0; i < n; i++) {
cin >> k[i];
}
ll low = 1, high = 1e9;
ll ans = -1;
while (low <= high) {
ll mid = (low + high) / 2;
vector<ll> a(n);
for (int i = 0; i < n; i++) {
a[i] = mid / k[i];
}
ll totBet = accumulate(a.begin(), a.end(), 0LL);
bool possible = true;
for (int i = 0; i < n; i++) {
if (a[i] * k[i] <= totBet) {
possible = false;
break;
}
}
if (possible) {
ans = mid;
high = mid - 1;
} else {
low = mid + 1;
}
}
if (ans == -1) {
cout << -1 << '\n';
} else {
vector<ll> a(n);
for (int i = 0; i < n; i++) {
a[i] = ans / k[i];
}
for (int i = 0; i < n - 1; i++) {
cout << a[i] << " ";
}
cout << a[n - 1] << '\n';
}
}
return 0;
}