Run Code
|
API
|
Code Wall
|
Misc
|
Feedback
|
Login
|
Theme
|
Privacy
|
Patreon
pizza
//fpc 3.0.0 program HelloWorld; var a : array [1..5] of integer; var b : array [1..5] of string; var i, j, k, d : integer; begin d := 0; b[1] := 'luk'; b[2] := 'perec'; b[3] := 'pomidor'; b[4]:= 'syr'; b[5] := 'kolbasa'; for k := 1 to 31 do begin a[5] := a[5] + 1 + d; if a[5] > 1 then begin a[5] := 0; d := 1 end; for i := 4 downto 1 do begin a[i] := a[i] + d; if a[i] > 1 then begin a[i] := 0; d := 1 end else d := 0; end; //writeln (a[1], a[2], a[3], a[4], a[5]) for j := 1 to 5 do if a[j] = 1 then write (b[j], ' '); writeln(); end; end.
run
|
edit
|
history
|
help
0
Naloga 5: 9.2.2011
Calculatrice 1.0
09 Ariketa FOR
Грицанова. Стр. 77. Задача 6.18
aefrt
solar_system_yupiter
the longest sub-array
mult_matrix.pas
jose messias de oliveira 600623130
kk