Держи. На питоне
Объяснение:
n = int(input())
cool_score = 0
jumps = input().split()
sorted_jumps = sorted(jumps)
for i in range(len(jumps)):
if i != len(jumps) - 1:
Ni = jumps.index(sorted_jumps[i]) + 1
Hi = sorted_jumps[i]
if jumps.count(jumps[i]) > 1:
jumps[i] = 'done'
Nj = jumps.index(sorted_jumps[i + 1]) + 1
Hj = sorted_jumps[i + 1]
a = 'abs({} - {}) + {} - {}'.format(int(Ni), int(Nj), int(Hj), int(Hi))
cool_score += eval(a)
print(cool_score)
<html>
<body>
<table border="1" cellspacing="0" height="333" width="333">
<tr>
<td colspan="8"></td>
</tr>
<tr>
<td rowspan="6"></td>
<td colspan="6"></td>
<td rowspan="7"></td>
</tr>
<tr>
<td rowspan="4"></td>
<td colspan="4"></td>
<td rowspan="5"></td>
</tr>
<tr>
<td rowspan="2"></td>
<td colspan="2"></td>
<td rowspan="3"></td>
</tr>
<tr>
<td></td>
<td></td>
</tr>
<tr>
<td colspan="3"></td>
</tr>
<tr>
<td colspan="5"></td>
</tr>
<tr>
<td colspan="7"></td>
</tr>
</table>
<br>
</body>
</html>
Объяснение:
картинка
ответ:
я хочу есть, оч сильно
двоичный код:
11100010110100100001010
11100010000111
000101110001011111100010111
1001111000100001110
10111100010111
111000100001101111
000100001101111100010111
1001011111110110010110
1011110001011100010111
11100010001111
0001011111100010111
000101101111000100010110
101111000100001101
1110001011100011111
0001011100010101111100010111
10010111110001011100010110
111100010111000101111010
0
морзе :
объяснение:
*-*- --- ---* **- * *** - -**-, --- ---* * -* -**- *** ** *-** -**- -* ---