-
Notifications
You must be signed in to change notification settings - Fork 0
/
missing_k_numbers.py
46 lines (35 loc) · 1005 Bytes
/
missing_k_numbers.py
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
import numpy as np
def complete_sums(n, k):
sums = [0] * (k + 1)
sums[0] = 1 # s0 always = 1
for i in range(1, n + 1):
for j in range(k, 0, -1):
sums[j] += i * sums[j - 1]
return sums
def actual_sums(lst, k):
sums = [0] * (k + 1)
sums[0] = 1 # s0 always = 1
for num in lst:
for j in range(k, 0, -1):
sums[j] += num * sums[j - 1]
return sums
def compute_coeff(actual, complete, k):
coeffs = [0] * (k + 1)
coeffs[0] = 1
coeffs[1] = complete[1] - actual[1]
for i in range(2, k + 1):
coeff = complete[i] - actual[i]
for j in range(1, i):
coeff -= actual[j] * coeffs[i - j]
coeffs[i] = coeff
return coeffs
lst = [1, 5, 15]
k = 12
n = len(lst) + k
actual = actual_sums(lst, k)
complete = complete_sums(n, k)
coefficients = compute_coeff(actual, complete, k)
roots = np.roots(coefficients)
print("The missing numbers are:")
for root in roots:
print(f"{root* -1:.0f}")