forked from konradbachusz-zz/HackerRank_solutions
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Maximize_It.py
52 lines (34 loc) · 983 Bytes
/
Maximize_It.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
47
48
49
50
51
# Enter your code here. Read input from STDIN. Print output to STDOUT
import itertools
from itertools import permutations
import sys
input_list=[]
for line in sys.stdin:
line=line.replace("\n","").split(" ")
line=[eval(i) for i in line]
input_list.append(line)
k=input_list[0][0]
m=input_list[0][1]
solutions_list=[]
# initializing list of list
all_list=[]
for i in range(1,1+k):
all_list.append(input_list[i])
# using itertools.product()
# to compute all possible permutations
res = list(itertools.product(*all_list))
#Remove duplicates
res=list(dict.fromkeys(res))
def get_arguments(k_list):
return (sum(i*i for i in k_list))
k_list=[]
for i in range(k):
k_list.append(i)
for permutation in res:
permutation_list=[]
for item in k_list:
x=permutation[item]
permutation_list.append(x)
solution=(get_arguments(permutation_list))%m
solutions_list.append(solution)
print(max(solutions_list))