Question

There are N people P1, P2, P3, …, PN having F1, F2, F3, …, FN Facebook friends, respectively. The solution to this problem is finding k = Fi%Fj such that it is maximum over all valid i,j. Constraints: 2 <= N <= 105 1 <= Ai <= 109 for each i Input Format: The first line contains an integer N The second line contains N space-separated integers F1, F2, F3, …, FN Output Format: Print in a single line the output which is k, the solution to this problem.

Answer 1

Answer:

n=int(input())  

l=list(map(int,input().split()))

maximum=0  

for i in range(0,n-1):  

 for j in range(1,n):  

   m=l[i]%l[j]  

    if m>maximum:  

     maximum=m

print(maximum,end='')

Explanation:

Answer 2

Answer:n=int(input())

frnds = list(map(int,input().split()))

max=0

for i in frnds:

 for j in frnds:

   if(i%j>=max):

     max=i%j

print(max,end="")    

Explanation: