Question

01:24:47
[email protected]...
QU
End tesi
Profit maximization
You are assigned a task to travel to different villages to make some profit. In each village, you gain some profit. From a
village i, you can only move to a village ; if and only if
j and the profit gain from village j is a multiple of the profit gain
from village in
You are required to determine the maximum profit you can gain while traveling.
Input format
Tgle mteger N-denoting
humber of villages
• Second line: N space-separated integers, each denoting the profit gain P; from village i
Output format
Print the maximum profit you can gain.​

Answer 1

Answer:

dbhdduebjdhudduiejiiheuejejeheheejeheheududud

Answer 2

ಠಲಡದಡ ಭದಢೊಢೊಭಢಥ ಡದಢಥಭರ

Explanation:

ಠಲಡದಡ ಬಥಢರಭರ

ಷರಬರಭಢರಭ

ಬರಬರಬದೋ

جخزککجزخزخدخد خسکوکس خسکس