(capacity)
| 1 | # APPROACH 1 |
| 2 | |
| 3 | def findMiddleMaximumCapacity(capacity): |
| 4 | max = 0 |
| 5 | for i in range(0, n - 2): |
| 6 | for j in range(i + 1, n - 1): |
| 7 | for k in range(j + 1, n): |
| 8 | if capacity[j] % capacity[i] == 0 and capacity[k] % capacity[j] == 0: |
| 9 | if max < capacity[j]: |
| 10 | max = capacity[j] |
| 11 | # returning maximum value |
| 12 | return max |
| 13 | return -1 |
| 14 | # taking n input |
| 15 | n = int(input()) |
| 16 | # taking capacity input |
no outgoing calls
no test coverage detected