Run Code
|
API
|
Code Wall
|
Misc
|
Feedback
|
Login
|
Theme
|
Privacy
|
Patreon
подсчёт кратчайших путей
const n = 4; m = 5; var i, j, x, y : integer; p : array [1..n,1..m] of integer; begin for i := 1 to n do p[i,1] := 1; for j := 1 to m do p[1,j] := 1; readln (x); readln (y); for i := 2 to x do for j := 2 to y do p[i, j] := p[i-1,j] + p[i, j-1]; writeln (p[i,j]); end.
run
|
edit
|
history
|
help
0
Sorted list implemenation using a stack and insertion sort
basketball_player_training
https://m.facebook.com/
6
Стандартные функции в паскале round, trunc, int, frac
Урок 3, задача 6 (1479). Без циклов
nombre_completo
AR sredine
Pasha
gfdresz