Run Code
|
API
|
Code Wall
|
Misc
|
Feedback
|
Login
|
Theme
|
Privacy
|
Patreon
Pascal triangle
program BinomnikoefPaskalovtrougao; var n:integer; function faktorijel(n:integer):integer; var i,s:integer; begin s:=1; for i:=1 to n do s:=s*i; faktorijel:=s end; procedure binko(n,j:integer); var a:real; begin a:=faktorijel(n)/(faktorijel(n-j)*faktorijel(j)); write(a:0:2,' ') end; procedure ispisiPascalov(n:integer); var i,j:integer; begin writeln('Paskalov trougao je: '); for i:=1 to n do if(i=1) then begin binko(1,1); writeln() end else begin for j:=0 to i do binko(i,j); writeln() end end; begin writeln('Unesite stepen n: '); read(n); ispisiPascalov(n) end.
run
|
edit
|
history
|
help
0
pdp31-final
La calculatrice
Largest Prime Factor
пример рекурсивной функции
GABRIELLA ALVES DA SILVA 600307538
3
sandogh 1
practica 7 ejercicio 11
CALCULATE FILE
floor and ceiling