Practice>Python>Itertools>Maximize It!

hackerrank.com

Maximize It!

Problem link : https://www.hackerrank.com/challenges/maximize-it/problem

Difficultiy : Hard

Tip

• Cartesian product is a key to solve this problem, from 'from itertools import product'
• Don;t miss that the first item in each K line, is # of Ni
• Do '%' to sum of each item
• Save maximum result of '%'

Solution

from itertools import product lines, mod = map(int, input().split(' ')) itemss = [] for _ in range(lines): itemss.append(map(int, input().split(' ')[1:])) gs = list(product(*itemss)) maxV = 0 for g in gs: #print(g) s = 0 for i in range(len(g)): s += g[i]**2 v = s % mod maxV = max(maxV, v) print(maxV)