We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
  1. Prepare
  2. Python
  3. Itertools
  4. Maximize It!
  5. Discussions

Maximize It!

Sort by

recency

|

1114 Discussions

|

  • teresa_seeth06
     + 0 comments
    from itertools import product
K,M = map(int,input().split())
K_lists_squared=[[int(x)**2 for x in input()[2:].split()] for _ in range(K)]
max_val = max([(sum(t)%M) for t in product(*K_lists_squared)])
print(max_val)

  • neha_singh19aug
     + 0 comments
    from itertools import product

K,M=input().split()
def fx(l1):
    l2=list(map(lambda x:x**2,l1))
    return(sum(l2)%int(M))

lists= [ list(map(int,input().split()))[1:] for _ in range(int(K))]
combos=list(product(*lists))
S_max=0
for comb in combos:
    value=fx(comb)
    if value>S_max:
        S_max=value
print(S_max)

  • tusharvyavahare1
     + 0 comments

    using sparse DP approach

    k,m = map(int, input().split())
inp_list = []

for _ in range(k):
    _, *nums = map(int, input().split())
    inp_list.append([x * x % m for x in nums])

curr_results = {0}

for li in inp_list:
    new_results = set()
    for res in curr_results:
        for ele in li:
            new_results.add((res + ele) % m)
    curr_results = new_results
print(max(curr_results))

  • ntnotme
     + 1 comment

    I hit this problem where I get 766 but expected output is 763, even with some of the answers here. Anyone else had this problem?

    6 767 indata = ['2 488512261 423332742', '2 625040505 443232774', '1 4553600', '4 92134264 617699202 124100179 337650738', '2 778493847 932097163', '5 489894997 496724555 693361712 935903331 518538304']

  • glenn_glazer
     + 0 comments

    I think the important python learning here is that while the docs only give product() examples with two iterables, product() can take an arbitrary list of iterables to produce all combinations. E.g., modifying an example from the docs:

    list(product('ABCD', 'xy', '123'))
[('A', 'x', '1'), ('A', 'x', '2'), ('A', 'x', '3'), ('A', 'y', '1'), ('A', 'y', '2'), ('A', 'y', '3'), ('B', 'x', '1'), ('B', 'x', '2'), ('B', 'x', '3'), ('B', 'y', '1'), ('B', 'y', '2'), ('B', 'y', '3'), ('C', 'x', '1'), ('C', 'x', '2'), ('C', 'x', '3'), ('C', 'y', '1'), ('C', 'y', '2'), ('C', 'y', '3'), ('D', 'x', '1'), ('D', 'x', '2'), ('D', 'x', '3'), ('D', 'y', '1'), ('D', 'y', '2'), ('D', 'y', '3')]

    This then lets us create the things to sum over and test for max all at once.

    It should be noted that product() isn't magical with respect to run time, this is still a polynomial algorithm in O(n^K).