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
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
#include <bits/stdc++.h>
using namespace std;
#define fwd(i, a, n) for (int i = (a); i < (n); i++)
#define rep(i, n) fwd(i, 0, n)
#define all(X) X.begin(), X.end()
#define sz(X) int(size(X))
#define pb push_back
#define eb emplace_back
#define st first
#define nd second
using pii = pair<int, int>; using vi = vector<int>;
using ll = long long; using ld = long double;
#ifdef LOC
auto SS = signal(6, [](int) { *(int *)0 = 0; });
#define DTP(x, y) auto operator << (auto &o, auto a) -> decltype(y, o) { o << "("; x; return o << ")"; }
DTP(o << a.st << ", " << a.nd, a.nd);
DTP(for (auto i : a) o << i << ", ", all(a));
void dump(auto... x) { (( cerr << x << ", " ), ...) << '\n'; }
#define deb(x...) cerr << setw(4) << __LINE__ << ":[" #x "]: ", dump(x)
#else
#define deb(...) 0
#endif

#define S 200007

ll T[S];

ll bin(ll x, ll y) {
	ll res = 1;
	for(int i = 1; i <= y; i++) {
		res *= (x-i+1);
		res /= i;
	}
	return res;
}

bool ok(ll x, int n) {
	ll L = 0;
	for(int i = 1; i <= n; i++) {
		if(T[i] == 0)
			continue;
		
		
		ll l = 1;
		ll r = min((ll)200,x-L);
		if(x-L < 200) {
			ll maks = bin(x-L,3) + bin(x-L,2) * L;
			if(maks < T[i])
				return false;
		}
		
		while(l < r) {
			ll sr = (l+r)/2;
			ll R = x - L - sr;
			ll ans = bin(sr,3) + bin(sr,2) * (x-sr) + L * R * sr;
			if(ans < T[i]) {
				l = sr + 1;
			} else {
				r = sr;
			}
		}
		L += l;
	}
	return true;
}

void solve() {
	int n;
	cin >> n;
	for(int i = 1; i <= n; i++){
		cin >> T[i];
	}
	int l = 3;
	int r = 200 * n;
	while(l < r) {
		int sr = (l+r)/2;
		if(ok(sr, n)) {
			r = sr;
		} else {
			l = sr+1;
		}
	}

	cout << l << "\n";
}

int32_t main() {
	cin.tie(0)->sync_with_stdio(0);
	cout << fixed << setprecision(10);
	int t;
	cin >> t;
	while(t--) {
		solve();
	}
}