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
Answers
Answered by
0
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:
Answered by
0
Answer:
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
Explanation:
Similar questions