Run Code
|
API
|
Code Wall
|
Users
|
Misc
|
Feedback
|
Login
|
Theme
|
Privacy
|
Blog
Project Euler 18 - Maximum path sum
//fpc 3.0.0 program Project18; type a=array[1..100] of integer; var b: array[1..100] of a; i,j : integer; // Tim duong di tu dinh den day cua 1 tam giac so sao cho tong cac so tren duong di la lon nhat // Phuong phap : tim duong tu phia duoi len begin for i:=1 to 15 do for j:=1 to i do read(b[i,j]); for i:=14 downto 1 do begin for j:=1 to i do begin if b[(i+1),j] > b[i+1,j+1] then b[i,j]:=b[i+1,j]+b[i,j] else b[i,j]:=b[i+1,j+1]+b[i,j]; write(b[i,j],' '); end; writeln; end; end.
run
|
edit
|
history
|
help
0
Please
log in
to post a comment.
НОД по моему
Task1-1
Solving Quadratic Equation
Ex5b20
рекурсия двух функций
Урок 3 не из учебника. U-контур и функция sign (x)
Homework 8
Task 1
вывод строк символов
Complemento da VS ICC II - 1º Semestre 2017
stackse - search stackoverflow differently
Please log in to post a comment.