Run Code
|
API
|
Code Wall
|
Misc
|
Feedback
|
Login
|
Theme
|
Privacy
|
Patreon
test10
program test10; const M=10; {pointer example of reverse chain growth} type spisok=^elem; elem=record inf:real ; sled:spisok end ; var q, pervy : spisok ; mas: array[1..M] of integer ; i:integer; procedure sostavlenie1(var p1:spisok; N:integer) ; var p:spisok ; k:integer; begin p1:=nil ; for k:=1 to N do begin new(p) ; p^.inf:=mas[k] ; p^.sled:=p1 ; p1:=p; end; end ; begin {M:=7;} for i:=1 to M do mas[i]:=i ; sostavlenie1(pervy, M) ; q:=pervy ; while q<> nil do begin write(q^.inf:5:1) ; q:=q^.sled end ; writeln; end.
run
|
edit
|
history
|
help
0
practica 3 ejercicio 1
CON YÊU MẸ
a
aaaaa
practica 3 ejercicio 3
CALCULATE FILE
Количество пар кр и не кр 11 оптимизированное с логикой
4 ariketa
TAIRINE GOMES NEPOUMUCENO 600624521
practica 3 ejercicio B7