Run Code
|
API
|
Code Wall
|
Misc
|
Feedback
|
Login
|
Theme
|
Privacy
|
Patreon
test31
program test31; {single format real number internal presentation in memory } type fall=1..2; rec=record case f:fall of 1:(x:single); 2:(s: array[1..4] of byte); end ; var i:integer; r:rec; procedure bitwrite(b:byte);{bit presentation procedure} var counter : integer; begin write(' '); for counter :=7 downto 0 do if (b and (1 shl counter)<>0) then write('1') else write('0'); end ; procedure hexwrite(b:byte); var links,rechts: integer; begin write(' $'); links:= b div 16; case links of 0..9 : write(chr(links+48)); 10..15: write(chr(links+55)); end; rechts:= b mod 16; case rechts of 0..9 : write(chr(rechts+48)); 10..15: write(chr(rechts+55)); end; end; begin with r do begin f:=1; x:=-7.375; f:=2; for i:=4 downto 1 do hexwrite(s[i]); writeln; for i:=4 downto 1 do bitwrite(s[i]); writeln; writeln; end; end.
run
|
edit
|
history
|
help
0
нун
practica 6 ejercicio 1
Homework 8
2
a 3 .b
08 while
1
Tugas1
подсчёт кратчайших путей
2-3-4-digit