✅✅✅ Largest Possible N - Divisible by 4

from itertools import permutations
n=input().strip()
l=list(permutations(n,len(n)))
s=[]
for i in l:
k=""
for j in i:
k+=j
if(int(k)%4==0):
s.append(int(k))
if(s==[]):
print("-1")
else:
print(max(s))

✅✅✅Minimum Array Product

Problem Statement
The program must accept values for two positive integer arrays of size N. The program must print the minimum sum S possible when a value in the first array is multiplied with a value in the second array. If a value is already used for multiplication then the value cannot be used again.

Boundary Condition(S)
1 <= N <= 100
1 <= Each Integer Value in Array <= 100

Input Format
The first line contains N.
The second line contains N positive integer values separated by a space.
The third line contains N positive integer values separated by a space.

Output Format
The first line contains S.

Example Input/Output 1

Input

3
5 6 10
8 15 9
Output

209
Explanation

The minimum sum is obtained for 10*8 + 6*9 + 5*15.
Example Input/Output 2

Programming Language: Python 3 Language

n=int(input())
l1=sorted(list(map(int,input().split())))[::-1]
l2=sorted(list(map(int,input().split())))
s=0
for i in range(n):
s+=l1[i]*l2[i]
print(s)

ZOHO Drive | 🎖2017-2022 Batch

📆 Deadline - 8th Dec
https://careers.zohocorp.com/forms/fcc89b5ebd373d598e0224d10f2199d12a89cdb001c479252ba774a9adbcd89b

INFOSYS PLACEMENT MATERIAL
Telegram - t.me/fresherearth

Apisero Off Campus Hiring

Qualification : BE,B.Tech ,BCA,MCA,ME,M.Tech
Work experience: fresher
Batch 2021/2022
https://info.apisero.com/campus