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.
Answers
Answered by
0
Answer:
I am soory I don't know the answer
Answered by
1
Answer:
Explanation:
n=int(input())
f=[int(i) for i in input().split()]
max=0
for i in range(n):
for j in range(n):
k=f[i]%f[j]
if(k>max):
max=k
print(max,end="")
Similar questions