1) Python:
nn = int(input())
k = 1 + (nn-1) // 3 * 2 + (nn-1) % 3
print (k)
2) Pascal:
var nn,k : longint;
begin
read (nn);
k:=1+(nn-1) div 3 * 2+(nn-1) mod 3;
write (k);
end.
Так же как клаома и грогха
1)<span>1110001000+110100100=100+210=310 </span>
<span><span>2) 1001001101+1111000= 294,5-60=234,5</span></span>
<span><span><span>3) 111100010,0101+1111111,01= нз</span></span></span>
<span><span><span><span>4) 1010111001-1010001011= 348,5-325,5=23</span>
<span>5) 1110101011-100111000= 469,5-156=313,5</span>
<span>6) 1110111000,011-111001101,001= нз</span>
<span>7) 1011010*1000010= 47*33=1551</span>
<span>8) 111010110:1010= 234,5:5=46,9</span></span></span></span>