{VERSION 3 0 "IBM INTEL LINUX" "3.0" }
{USTYLETAB {CSTYLE "Maple Input" -1 0 "Courier" 0 1 255 0 0 1 0 1 0 0 
1 0 0 0 0 }{CSTYLE "2D Math" -1 2 "Times" 0 1 0 0 0 0 0 0 2 0 0 0 0 0 
0 }{CSTYLE "2D Output" 2 20 "" 0 1 0 0 255 1 0 0 0 0 0 0 0 0 0 }
{CSTYLE "" -1 256 "" 0 1 0 0 0 0 0 1 0 0 0 0 0 0 0 }{CSTYLE "" -1 257 
"" 0 1 0 0 0 0 0 1 0 0 0 0 0 0 0 }{CSTYLE "" -1 258 "" 0 1 0 0 0 0 0 
1 0 0 0 0 0 0 0 }{CSTYLE "" -1 259 "" 0 1 0 0 0 0 0 1 0 0 0 0 0 0 0 }
{CSTYLE "" -1 260 "" 0 1 0 0 0 0 0 1 0 0 0 0 0 0 0 }{CSTYLE "" -1 261 
"" 0 1 0 0 0 0 0 1 0 0 0 0 0 0 0 }{CSTYLE "" -1 262 "" 0 1 0 0 0 0 0 
1 0 0 0 0 0 0 0 }{CSTYLE "" -1 263 "" 0 1 0 0 0 0 0 1 0 0 0 0 0 0 0 }
{CSTYLE "" -1 264 "" 0 1 0 0 0 0 0 1 0 0 0 0 0 0 0 }{CSTYLE "" -1 265 
"" 0 1 0 0 0 0 0 1 0 0 0 0 0 0 0 }{CSTYLE "" -1 266 "" 0 1 0 0 0 0 0 
1 0 0 0 0 0 0 0 }{CSTYLE "" -1 267 "" 0 1 0 0 0 0 0 1 0 0 0 0 0 0 0 }
{CSTYLE "" -1 268 "" 0 1 0 0 0 0 0 1 0 0 0 0 0 0 0 }{CSTYLE "" -1 269 
"" 0 1 0 0 0 0 0 1 0 0 0 0 0 0 0 }{CSTYLE "" -1 270 "" 0 1 0 0 0 0 0 
1 0 0 0 0 0 0 0 }{CSTYLE "" -1 271 "" 0 1 0 0 0 0 0 1 0 0 0 0 0 0 0 }
{CSTYLE "" -1 272 "" 0 1 0 0 0 0 0 1 0 0 0 0 0 0 0 }{CSTYLE "" -1 273 
"" 0 1 0 0 0 0 0 1 0 0 0 0 0 0 0 }{CSTYLE "" -1 274 "" 0 1 0 0 0 0 0 
1 0 0 0 0 0 0 0 }{CSTYLE "" -1 275 "" 0 1 0 0 0 0 0 1 0 0 0 0 0 0 0 }
{CSTYLE "" -1 276 "" 0 1 0 0 0 0 0 1 0 0 0 0 0 0 0 }{CSTYLE "" -1 277 
"" 0 1 0 0 0 0 0 1 0 0 0 0 0 0 0 }{CSTYLE "" -1 278 "" 0 1 0 0 0 0 0 
1 0 0 0 0 0 0 0 }{CSTYLE "" -1 279 "" 0 1 0 0 0 0 0 1 0 0 0 0 0 0 0 }
{CSTYLE "" -1 280 "" 0 1 0 0 0 0 0 1 0 0 0 0 0 0 0 }{CSTYLE "" -1 281 
"" 0 1 0 0 0 0 0 1 0 0 0 0 0 0 0 }{CSTYLE "" -1 282 "" 0 1 0 0 0 0 0 
1 0 0 0 0 0 0 0 }{CSTYLE "" -1 283 "" 0 1 0 0 0 0 0 1 0 0 0 0 0 0 0 }
{CSTYLE "" -1 284 "" 0 1 0 0 0 0 0 1 0 0 0 0 0 0 0 }{CSTYLE "" -1 285 
"" 0 1 0 0 0 0 0 1 0 0 0 0 0 0 0 }{CSTYLE "" -1 286 "" 0 1 0 0 0 0 0 
1 0 0 0 0 0 0 0 }{CSTYLE "" -1 287 "" 0 1 0 0 0 0 0 1 0 0 0 0 0 0 0 }
{CSTYLE "" -1 288 "" 0 1 0 0 0 0 0 1 0 0 0 0 0 0 0 }{CSTYLE "" -1 289 
"" 0 1 0 0 0 0 0 1 0 0 0 0 0 0 0 }{CSTYLE "" -1 290 "" 0 1 0 0 0 0 0 
1 0 0 0 0 0 0 0 }{CSTYLE "" -1 291 "" 0 1 0 0 0 0 0 1 0 0 0 0 0 0 0 }
{CSTYLE "" -1 292 "" 0 1 0 0 0 0 0 1 0 0 0 0 0 0 0 }{CSTYLE "" -1 293 
"" 0 1 0 0 0 0 0 1 0 0 0 0 0 0 0 }{CSTYLE "" -1 294 "courier" 0 1 0 0 
0 0 0 0 0 0 0 0 0 0 0 }{CSTYLE "" -1 295 "times" 0 1 0 0 0 0 0 0 0 0 
0 0 0 0 0 }{CSTYLE "" -1 296 "courier" 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 }
{CSTYLE "" -1 297 "courier" 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 }{CSTYLE "" 
-1 298 "courier" 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 }{CSTYLE "" -1 299 "cou
rier" 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 }{CSTYLE "" -1 300 "" 0 1 0 0 0 0 
0 1 0 0 0 0 0 0 0 }{CSTYLE "" -1 301 "" 0 1 0 0 0 0 0 1 0 0 0 0 0 0 0 
}{PSTYLE "Normal" -1 0 1 {CSTYLE "" -1 -1 "Times" 1 24 0 0 0 0 2 2 2 
0 0 0 0 0 0 }0 0 0 -1 -1 -1 0 0 0 0 0 0 -1 0 }{PSTYLE "Text Output" 
-1 2 1 {CSTYLE "" -1 -1 "Courier" 1 10 0 0 255 1 0 0 0 0 0 1 3 0 3 }1 
0 0 -1 -1 -1 0 0 0 0 0 0 -1 0 }{PSTYLE "Heading 1" 0 3 1 {CSTYLE "" 
-1 -1 "" 1 18 0 0 0 0 0 1 0 0 0 0 0 0 0 }1 0 0 0 8 4 0 0 0 0 0 0 -1 0 
}{PSTYLE "Heading 2" 3 4 1 {CSTYLE "" -1 -1 "" 1 14 0 0 0 0 0 0 0 0 0 
0 0 0 0 }0 0 0 -1 8 2 0 0 0 0 0 0 -1 0 }{PSTYLE "" 2 6 1 {CSTYLE "" 
-1 -1 "" 0 1 0 0 0 0 0 0 0 0 0 0 2 0 0 }0 0 0 -1 -1 -1 0 0 0 0 0 0 -1 
0 }{PSTYLE "Warning" 2 7 1 {CSTYLE "" -1 -1 "" 0 1 0 0 255 1 0 0 0 0 
0 0 1 0 0 }0 0 0 -1 -1 -1 0 0 0 0 0 0 -1 0 }{PSTYLE "Error" 7 8 1 
{CSTYLE "" -1 -1 "" 0 1 255 0 255 1 0 0 0 0 0 0 0 0 0 }0 0 0 -1 -1 -1 
0 0 0 0 0 0 -1 0 }{PSTYLE "Diagnostic" 7 9 1 {CSTYLE "" -1 -1 "" 0 1 
64 128 64 1 0 0 0 0 0 0 0 0 0 }0 0 0 -1 -1 -1 0 0 0 0 0 0 -1 0 }
{PSTYLE "Maple Output" 0 11 1 {CSTYLE "" -1 -1 "" 0 1 0 0 0 0 0 0 0 0 
0 0 0 0 0 }3 3 0 -1 -1 -1 0 0 0 0 0 0 -1 0 }{PSTYLE "" 11 12 1 
{CSTYLE "" -1 -1 "" 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 }1 0 0 -1 -1 -1 0 0 
0 0 0 0 -1 0 }{PSTYLE "Title" 0 18 1 {CSTYLE "" -1 -1 "" 1 18 0 0 0 0 
0 1 1 0 0 0 0 0 0 }3 0 0 -1 12 12 0 0 0 0 0 0 19 0 }{PSTYLE "R3 Font 0
" -1 256 1 {CSTYLE "" -1 -1 "Helvetica" 1 24 0 0 0 0 2 1 2 0 0 0 0 0 
0 }0 0 0 -1 -1 -1 0 0 0 0 0 0 -1 0 }{PSTYLE "R3 Font 2" -1 257 1 
{CSTYLE "" -1 -1 "Courier" 1 24 0 0 0 0 2 2 2 0 0 0 0 0 0 }0 0 0 -1 
-1 -1 0 0 0 0 0 0 -1 0 }}
{SECT 0 {EXCHG {PARA 18 "" 0 "" {TEXT -1 29 " MAPLOVSKY PROGRAMOVACI J
AZYK" }}}{SECT 0 {PARA 3 "" 0 "" {TEXT -1 30 "Zakladni programove kons
trukce" }}{SECT 0 {PARA 4 "" 0 "" {TEXT -1 3 "for" }}{EXCHG {PARA 0 "
" 0 "" {TEXT -1 88 "Prikaz for zajistuje opakovani posloupnosti prikaz
u v zavislosti na promenne i.\nSyntaxe:" }}{PARA 0 "" 0 "" {TEXT 259 
3 "for" }{TEXT -1 3 " i " }{TEXT 260 4 "from" }{TEXT -1 14 " poc. hodn
ota " }{TEXT 261 2 "by" }{TEXT -1 6 " krok " }{TEXT 262 2 "to" }{TEXT 
-1 17 " konecna hodnota " }{TEXT 263 3 "do\n" }{TEXT -1 20 "posloupnos
t prikazu\n" }{TEXT 264 3 "od;" }{TEXT -1 248 "\n\nPozn: Pocatecni hod
nota, krok, konecna hodnota musi byt vyrazy, jejichz vycislena hodnota
 je cele nebo racionalni cislo\nanebo cislo FPN.\nJe-li vypustena cast
 from pocatecni hodnota nebo by krok, je automaticky za tyto hodnoty p
rirazena hodnota 1." }}}{EXCHG {PARA 0 "> " 0 "" {MPLTEXT 1 0 20 "for \+
i from 1 to 5 do" }}{PARA 0 "> " 0 "" {MPLTEXT 1 0 9 "print(i);" }}
{PARA 0 "> " 0 "" {MPLTEXT 1 0 3 "od;" }}{PARA 11 "" 1 "" {XPPMATH 20 
"6#\"\"\"" }}{PARA 11 "" 1 "" {XPPMATH 20 "6#\"\"#" }}{PARA 11 "" 1 "
" {XPPMATH 20 "6#\"\"$" }}{PARA 11 "" 1 "" {XPPMATH 20 "6#\"\"%" }}
{PARA 11 "" 1 "" {XPPMATH 20 "6#\"\"&" }}}{EXCHG {PARA 0 "> " 0 "" 
{MPLTEXT 1 0 0 "" }}}{EXCHG {PARA 0 "> " 0 "" {MPLTEXT 1 0 9 "total:=0
:" }}}{EXCHG {PARA 0 "> " 0 "" {MPLTEXT 1 0 20 "for i from 1 to 5 do" 
}}{PARA 0 "> " 0 "" {MPLTEXT 1 0 15 "total:=total+i:" }}{PARA 0 "> " 
0 "" {MPLTEXT 1 0 3 "od;" }}{PARA 11 "" 1 "" {XPPMATH 20 "6#>%&totalG
\"\"\"" }}{PARA 11 "" 1 "" {XPPMATH 20 "6#>%&totalG\"\"$" }}{PARA 11 "
" 1 "" {XPPMATH 20 "6#>%&totalG\"\"'" }}{PARA 11 "" 1 "" {XPPMATH 20 "
6#>%&totalG\"#5" }}{PARA 11 "" 1 "" {XPPMATH 20 "6#>%&totalG\"#:" }}}
{EXCHG {PARA 0 "> " 0 "" {MPLTEXT 1 0 6 "total;" }}{PARA 11 "" 1 "" 
{XPPMATH 20 "6#\"#:" }}}{EXCHG {PARA 0 "" 0 "" {TEXT -1 177 "Maple v k
azde vetvi cyklu zvysuje hodnotu promenne i o jedna a testuje, zda i n
eni vetsi jak pet. Pokud ne, opakovane provadi prikazy v tele vetve. S
oucet se uklada do promenne " }{TEXT 299 5 "total" }{TEXT -1 1 "." }}}
{EXCHG {PARA 0 "> " 0 "" {MPLTEXT 1 0 12 "SUM:=proc(n)" }}{PARA 0 "> \+
" 0 "" {MPLTEXT 1 0 13 "local i, tot;" }}{PARA 0 "> " 0 "" {MPLTEXT 1 
0 7 "tot:=0;" }}{PARA 0 "> " 0 "" {MPLTEXT 1 0 20 "for i from 1 to n d
o" }}{PARA 0 "> " 0 "" {MPLTEXT 1 0 11 "tot:=tot+i;" }}{PARA 0 "> " 0 
"" {MPLTEXT 1 0 3 "od;" }}{PARA 0 "> " 0 "" {MPLTEXT 1 0 4 "tot;" }}
{PARA 0 "> " 0 "" {MPLTEXT 1 0 4 "end:" }}}{EXCHG {PARA 0 "> " 0 "" 
{MPLTEXT 1 0 8 "SUM(10);" }}{PARA 11 "" 1 "" {XPPMATH 20 "6#\"#b" }}}
{EXCHG {PARA 0 "> " 0 "" {MPLTEXT 1 0 21 "1+2+3+4+5+6+7+8+9+10;" }}
{PARA 11 "" 1 "" {XPPMATH 20 "6#\"#b" }}}{EXCHG {PARA 0 "> " 0 "" 
{MPLTEXT 1 0 18 "sum(i, 'i'=1..10);" }}{PARA 11 "" 1 "" {XPPMATH 20 "6
#\"#g" }}}{EXCHG {PARA 0 "> " 0 "" {MPLTEXT 1 0 11 "printlevel;" }}
{PARA 11 "" 1 "" {XPPMATH 20 "6#\"\"\"" }}}{EXCHG {PARA 0 "> " 0 "" 
{MPLTEXT 1 0 15 "printlevel:=20;" }}{PARA 11 "" 1 "" {XPPMATH 20 "6#>%
+printlevelG\"#?" }}}{EXCHG {PARA 0 "> " 0 "" {MPLTEXT 1 0 8 "SUM(10);
" }}{PARA 9 "" 1 "" {TEXT -1 25 "\{--> enter SUM, args = 10" }}{PARA 
11 "" 1 "" {XPPMATH 20 "6#>%$totG\"\"!" }}{PARA 11 "" 1 "" {XPPMATH 
20 "6#>%$totG\"\"\"" }}{PARA 11 "" 1 "" {XPPMATH 20 "6#>%$totG\"\"$" }
}{PARA 11 "" 1 "" {XPPMATH 20 "6#>%$totG\"\"'" }}{PARA 11 "" 1 "" 
{XPPMATH 20 "6#>%$totG\"#5" }}{PARA 11 "" 1 "" {XPPMATH 20 "6#>%$totG
\"#:" }}{PARA 11 "" 1 "" {XPPMATH 20 "6#>%$totG\"#@" }}{PARA 11 "" 1 "
" {XPPMATH 20 "6#>%$totG\"#G" }}{PARA 11 "" 1 "" {XPPMATH 20 "6#>%$tot
G\"#O" }}{PARA 11 "" 1 "" {XPPMATH 20 "6#>%$totG\"#X" }}{PARA 11 "" 1 
"" {XPPMATH 20 "6#>%$totG\"#b" }}{PARA 11 "" 1 "" {XPPMATH 20 "6#\"#b
" }}{PARA 9 "" 1 "" {TEXT -1 37 "<-- exit SUM (now at top level) = 55
\}" }}{PARA 11 "" 1 "" {XPPMATH 20 "6#\"#b" }}}{EXCHG {PARA 0 "> " 0 "
" {MPLTEXT 1 0 14 "printlevel:=1;" }}{PARA 11 "" 1 "" {XPPMATH 20 "6#>
%+printlevelG\"\"\"" }}}{EXCHG {PARA 0 "> " 0 "" {MPLTEXT 1 0 12 "SUM:
=proc(n)" }}{PARA 0 "> " 0 "" {MPLTEXT 1 0 13 "local i, tot;" }}{PARA 
0 "> " 0 "" {MPLTEXT 1 0 7 "tot:=0;" }}{PARA 0 "> " 0 "" {MPLTEXT 1 0 
20 "for i from 1 to n do" }}{PARA 0 "> " 0 "" {MPLTEXT 1 0 11 "tot:=to
t+i;" }}{PARA 0 "> " 0 "" {MPLTEXT 1 0 25 "print(`i=`,i,`tot=`,tot);" 
}}{PARA 0 "> " 0 "" {MPLTEXT 1 0 3 "od;" }}{PARA 0 "> " 0 "" {MPLTEXT 
1 0 4 "tot;" }}{PARA 0 "> " 0 "" {MPLTEXT 1 0 4 "end:" }}}{EXCHG 
{PARA 0 "> " 0 "" {MPLTEXT 1 0 8 "SUM(10);" }}{PARA 11 "" 1 "" 
{XPPMATH 20 "6&%#i=G\"\"\"%%tot=GF$" }}{PARA 11 "" 1 "" {XPPMATH 20 "6
&%#i=G\"\"#%%tot=G\"\"$" }}{PARA 11 "" 1 "" {XPPMATH 20 "6&%#i=G\"\"$%
%tot=G\"\"'" }}{PARA 11 "" 1 "" {XPPMATH 20 "6&%#i=G\"\"%%%tot=G\"#5" 
}}{PARA 11 "" 1 "" {XPPMATH 20 "6&%#i=G\"\"&%%tot=G\"#:" }}{PARA 11 "
" 1 "" {XPPMATH 20 "6&%#i=G\"\"'%%tot=G\"#@" }}{PARA 11 "" 1 "" 
{XPPMATH 20 "6&%#i=G\"\"(%%tot=G\"#G" }}{PARA 11 "" 1 "" {XPPMATH 20 "
6&%#i=G\"\")%%tot=G\"#O" }}{PARA 11 "" 1 "" {XPPMATH 20 "6&%#i=G\"\"*%
%tot=G\"#X" }}{PARA 11 "" 1 "" {XPPMATH 20 "6&%#i=G\"#5%%tot=G\"#b" }}
{PARA 11 "" 1 "" {XPPMATH 20 "6#\"#b" }}}{EXCHG {PARA 0 "> " 0 "" 
{MPLTEXT 1 0 20 "SUM:=proc(n::posint)" }}{PARA 0 "> " 0 "" {MPLTEXT 1 
0 13 "local i, tot;" }}{PARA 0 "> " 0 "" {MPLTEXT 1 0 7 "tot:=0;" }}
{PARA 0 "> " 0 "" {MPLTEXT 1 0 20 "for i from 1 to n do" }}{PARA 0 "> \+
" 0 "" {MPLTEXT 1 0 11 "tot:=tot+i;" }}{PARA 0 "> " 0 "" {MPLTEXT 1 0 
3 "od;" }}{PARA 0 "> " 0 "" {MPLTEXT 1 0 4 "tot;" }}{PARA 0 "> " 0 "" 
{MPLTEXT 1 0 4 "end:" }}}{EXCHG {PARA 0 "> " 0 "" {MPLTEXT 1 0 13 "SUM
(sqrt(2));" }}{PARA 8 "" 1 "" {TEXT -1 82 "Error, SUM expects its 1st \+
argument, n, to be of type posint, but received 2^(1/2)" }}}{EXCHG 
{PARA 0 "" 0 "" {TEXT -1 27 "Nejcasteji pouzivane typy: " }{TEXT 294 
95 "array, complex, equation, even, integer, list, name, negint, odd, \+
posint, prime, set, string.  " }{TEXT 295 16 "Dalsi viz ?type." }}}
{EXCHG {PARA 0 "> " 0 "" {MPLTEXT 1 0 8 "restart;" }}{PARA 0 "> " 0 "
" {MPLTEXT 1 0 25 "for i from 2 by 2 to 6 do" }}{PARA 0 "> " 0 "" 
{MPLTEXT 1 0 42 "Sum(j^i, j=1..n)=expand(sum(j^i, j=1..n));" }}{PARA 
0 "> " 0 "" {MPLTEXT 1 0 3 "od;" }}{PARA 11 "" 1 "" {XPPMATH 20 "6#/-%
$SumG6$*$)%\"jG\"\"#\"\"\"/F);\"\"\"%\"nG,(*$)F/\"\"$F+#F.F3*$)F/F*F+#
F.F*F/#F.\"\"'" }}{PARA 11 "" 1 "" {XPPMATH 20 "6#/-%$SumG6$*$)%\"jG\"
\"%\"\"\"/F);\"\"\"%\"nG,**$)F/\"\"&F+#F.F3*$)F/F*F+#F.\"\"#*$)F/\"\"$
F+#F.F;F/#!\"\"\"#I" }}{PARA 11 "" 1 "" {XPPMATH 20 "6#/-%$SumG6$*$)%
\"jG\"\"'\"\"\"/F);\"\"\"%\"nG,,F/#F.\"#U*$)F/\"\"$F+#!\"\"F**$)F/F*F+
#F.\"\"#*$)F/\"\"(F+#F.F>*$)F/\"\"&F+F:" }}}{EXCHG {PARA 0 "> " 0 "" 
{MPLTEXT 1 0 0 "" }}}{EXCHG {PARA 0 "> " 0 "" {MPLTEXT 1 0 2 "i;" }}
{PARA 11 "" 1 "" {XPPMATH 20 "6#\"\")" }}}{EXCHG {PARA 0 "" 0 "" 
{TEXT -1 59 "Hodnota promenne i je v okamziku ukonceni cyklu pevne dan
a." }}}{EXCHG {PARA 0 "" 0 "" {TEXT -1 57 "Pr: Vypocet souctu ctvercu \+
sudych cisel z daneho seznamu:" }}}{EXCHG {PARA 0 "> " 0 "" {MPLTEXT 
1 0 20 "seznam:=[1,2,3,4,5]:" }}{PARA 0 "> " 0 "" {MPLTEXT 1 0 5 "s:=0
:" }}{PARA 0 "> " 0 "" {MPLTEXT 1 0 24 "for i to nops(seznam) do" }}
{PARA 0 "> " 0 "" {MPLTEXT 1 0 30 "if irem(op(i,seznam),2)=0 then" }}
{PARA 0 "> " 0 "" {MPLTEXT 1 0 19 "s:=s+op(i,seznam)^2" }}{PARA 0 "> \+
" 0 "" {MPLTEXT 1 0 2 "fi" }}{PARA 0 "> " 0 "" {MPLTEXT 1 0 3 "od:" }}
}{EXCHG {PARA 0 "> " 0 "" {MPLTEXT 1 0 31 "lprint(`soucet ctvercu s =`
,s);" }}{PARA 6 "" 1 "" {TEXT -1 23 "soucet ctvercu s =   20" }}}
{EXCHG {PARA 0 "" 0 "" {TEXT -1 41 "Prikaz for ma jeste dalsi uzitecny
 tvar:\n" }{TEXT 265 3 "for" }{TEXT -1 3 " x " }{TEXT 266 2 "in" }
{TEXT -1 7 " vyraz\n" }{TEXT 267 3 "do\n" }{TEXT -1 20 "prikazy uzivaj
ici x\n" }{TEXT 268 3 "od;" }{TEXT -1 131 "\n\nPr: Ze seznamu se vybir
aji jeho cleny a testuji se, zda jsou sude.  Pokud ano, tak do promenn
e s se uklada soucet jejich ctvercu." }}}{EXCHG {PARA 0 "> " 0 "" 
{MPLTEXT 1 0 5 "s:=0:" }}{PARA 0 "> " 0 "" {MPLTEXT 1 0 20 "seznam:=[1
,2,3,4,5]:" }}{PARA 0 "> " 0 "" {MPLTEXT 1 0 18 "for n in seznam do" }
}{PARA 0 "> " 0 "" {MPLTEXT 1 0 31 "if irem(n,2)=0 then s:=s+n^2 fi" }
}{PARA 0 "> " 0 "" {MPLTEXT 1 0 3 "od:" }}}{EXCHG {PARA 0 "> " 0 "" 
{MPLTEXT 1 0 2 "s;" }}{PARA 11 "" 1 "" {XPPMATH 20 "6#\"#?" }}}}{SECT 
0 {PARA 4 "" 0 "" {TEXT -1 5 "while" }}{EXCHG {PARA 0 "" 0 "" {TEXT 
-1 8 "Syntaxe:" }}{PARA 0 "" 0 "" {TEXT 256 5 "while" }{TEXT -1 10 " p
odminka " }{TEXT 257 2 "do" }{TEXT -1 21 " posloupnost prikazu " }
{TEXT 258 4 "od;\n" }{TEXT -1 216 "\nPrikaz while provadi opakovane po
sloupnosti prikazu tak dlouho, pokud je podminka splnena (tedy pokud j
e\nlogicky vyraz typu true). Pokud ma podminka hned na zacatku hodnotu
 false, posloupnost prikazu se neprovede.\n\n" }}}{EXCHG {PARA 0 "> " 
0 "" {MPLTEXT 1 0 7 "x:=256;" }}{PARA 11 "" 1 "" {XPPMATH 20 "6#>%\"xG
\"$c#" }}}{EXCHG {PARA 0 "> " 0 "" {MPLTEXT 1 0 23 "while x>1 do x:=x/
4 od;" }}{PARA 11 "" 1 "" {XPPMATH 20 "6#>%\"xG\"#k" }}{PARA 11 "" 1 "
" {XPPMATH 20 "6#>%\"xG\"#;" }}{PARA 11 "" 1 "" {XPPMATH 20 "6#>%\"xG
\"\"%" }}{PARA 11 "" 1 "" {XPPMATH 20 "6#>%\"xG\"\"\"" }}}{EXCHG 
{PARA 0 "> " 0 "" {MPLTEXT 1 0 7 "x:=1/2;" }}{PARA 11 "" 1 "" 
{XPPMATH 20 "6#>%\"xG#\"\"\"\"\"#" }}}{EXCHG {PARA 0 "> " 0 "" 
{MPLTEXT 1 0 23 "while x>1 do x:=x/2 od;" }}}{EXCHG {PARA 0 "> " 0 "" 
{MPLTEXT 1 0 2 "x;" }}{PARA 11 "" 1 "" {XPPMATH 20 "6##\"\"\"\"\"#" }}
}{EXCHG {PARA 0 "" 0 "" {TEXT -1 104 "Pr: Nalezeni nejvetsiho spol. de
litele dvou celych cisel 20 a 12 pomoci while. (Pouziti Euklidova alg.
)\n" }}}{EXCHG {PARA 0 "> " 0 "" {MPLTEXT 1 0 13 "a:=20: b:=12:" }}
{PARA 0 "> " 0 "" {MPLTEXT 1 0 13 "while b<>0 do" }}{PARA 0 "> " 0 "" 
{MPLTEXT 1 0 14 " d:=irem(a,b);" }}{PARA 0 "> " 0 "" {MPLTEXT 1 0 6 " \+
a:=b;" }}{PARA 0 "> " 0 "" {MPLTEXT 1 0 6 " b:=d;" }}{PARA 0 "> " 0 "
" {MPLTEXT 1 0 3 "od;" }}{PARA 11 "" 1 "" {XPPMATH 20 "6#>%\"dG\"\")" 
}}{PARA 11 "" 1 "" {XPPMATH 20 "6#>%\"aG\"#7" }}{PARA 11 "" 1 "" 
{XPPMATH 20 "6#>%\"bG\"\")" }}{PARA 11 "" 1 "" {XPPMATH 20 "6#>%\"dG\"
\"%" }}{PARA 11 "" 1 "" {XPPMATH 20 "6#>%\"aG\"\")" }}{PARA 11 "" 1 "
" {XPPMATH 20 "6#>%\"bG\"\"%" }}{PARA 11 "" 1 "" {XPPMATH 20 "6#>%\"dG
\"\"!" }}{PARA 11 "" 1 "" {XPPMATH 20 "6#>%\"aG\"\"%" }}{PARA 11 "" 1 
"" {XPPMATH 20 "6#>%\"bG\"\"!" }}}{EXCHG {PARA 0 "> " 0 "" {MPLTEXT 1 
0 31 "lprint(`celociselny NSD je`,a);" }}{PARA 6 "" 1 "" {TEXT -1 22 "
celociselny NSD je   4" }}}{EXCHG {PARA 0 "" 0 "" {TEXT -1 58 "Tisk me
zivysledku lze potlacit ukoncenim cyklu dvojteckou." }}{PARA 0 "> " 0 
"" {MPLTEXT 1 0 12 "igcd(20,12);" }}{PARA 11 "" 1 "" {XPPMATH 20 "6#\"
\"%" }}}{EXCHG {PARA 0 "" 0 "" {TEXT -1 39 "(kontrola pomoci Maplovske
 funkce igcd)" }}}{EXCHG {PARA 0 "> " 0 "" {MPLTEXT 1 0 33 "euclid:=pr
oc(m::posint,n::posint)" }}{PARA 0 "> " 0 "" {MPLTEXT 1 0 12 "local a,
b,r:" }}{PARA 0 "> " 0 "" {MPLTEXT 1 0 5 "a:=m:" }}{PARA 0 "> " 0 "" 
{MPLTEXT 1 0 5 "b:=n:" }}{PARA 0 "> " 0 "" {MPLTEXT 1 0 13 "r:=irem(a,
b):" }}{PARA 0 "> " 0 "" {MPLTEXT 1 0 13 "while r<>0 do" }}{PARA 0 "> \+
" 0 "" {MPLTEXT 1 0 5 "a:=b:" }}{PARA 0 "> " 0 "" {MPLTEXT 1 0 5 "b:=r
:" }}{PARA 0 "> " 0 "" {MPLTEXT 1 0 13 "r:=irem(a,b):" }}{PARA 0 "> " 
0 "" {MPLTEXT 1 0 3 "od:" }}{PARA 0 "> " 0 "" {MPLTEXT 1 0 2 "b:" }}
{PARA 0 "> " 0 "" {MPLTEXT 1 0 4 "end:" }}}{EXCHG {PARA 0 "> " 0 "" 
{MPLTEXT 1 0 14 "euclid(20,12);" }}{PARA 11 "" 1 "" {XPPMATH 20 "6#\"
\"%" }}}{EXCHG {PARA 0 "" 0 "" {TEXT -1 62 "Funkce, ktera vraci nejvet
si mocnimu dvou mensi nebo rovnou n." }}}{EXCHG {PARA 0 "> " 0 "" 
{MPLTEXT 1 0 23 "binpow:=proc(n::posint)" }}{PARA 0 "> " 0 "" 
{MPLTEXT 1 0 10 "local x,m;" }}{PARA 0 "> " 0 "" {MPLTEXT 1 0 5 "x:=0:
" }}{PARA 0 "> " 0 "" {MPLTEXT 1 0 5 "m:=n:" }}{PARA 0 "> " 0 "" 
{MPLTEXT 1 0 13 "while m>=1 do" }}{PARA 0 "> " 0 "" {MPLTEXT 1 0 7 "m:
=m/2:" }}{PARA 0 "> " 0 "" {MPLTEXT 1 0 7 "x:=x+1;" }}{PARA 0 "> " 0 "
" {MPLTEXT 1 0 3 "od:" }}{PARA 0 "> " 0 "" {MPLTEXT 1 0 4 "x-1;" }}
{PARA 0 "> " 0 "" {MPLTEXT 1 0 4 "end:" }}}{EXCHG {PARA 0 "> " 0 "" 
{MPLTEXT 1 0 20 "for n from 1 to 8 do" }}{PARA 0 "> " 0 "" {MPLTEXT 1 
0 13 "n, binpow(n);" }}{PARA 0 "> " 0 "" {MPLTEXT 1 0 3 "od;" }}{PARA 
0 "> " 0 "" {MPLTEXT 1 0 0 "" }}{PARA 11 "" 1 "" {XPPMATH 20 "6$\"\"\"
\"\"!" }}{PARA 11 "" 1 "" {XPPMATH 20 "6$\"\"#\"\"\"" }}{PARA 11 "" 1 
"" {XPPMATH 20 "6$\"\"$\"\"\"" }}{PARA 11 "" 1 "" {XPPMATH 20 "6$\"\"%
\"\"#" }}{PARA 11 "" 1 "" {XPPMATH 20 "6$\"\"&\"\"#" }}{PARA 11 "" 1 "
" {XPPMATH 20 "6$\"\"'\"\"#" }}{PARA 11 "" 1 "" {XPPMATH 20 "6$\"\"(\"
\"#" }}{PARA 11 "" 1 "" {XPPMATH 20 "6$\"\")\"\"$" }}}{PARA 0 "" 0 "" 
{TEXT -1 0 "" }}}{SECT 0 {PARA 4 "" 0 "" {TEXT -1 15 "if-then-else-fi
" }}{EXCHG {PARA 0 "" 0 "" {TEXT -1 8 "Syntaxe:" }}{PARA 0 "" 0 "" 
{TEXT 269 2 "if" }{TEXT -1 10 " podminka " }{TEXT 270 4 "then" }{TEXT 
-1 19 " posloupnost prik1 " }{TEXT 271 4 "else" }{TEXT -1 19 " posloup
nost prik2 " }{TEXT 272 3 "fi;" }{TEXT -1 305 "\n\nPri pouziti tohoto \+
prikazu se nejprve vyhodnoti podminka. Ma-li logickou hodnotu true, pr
ovede se posloupnost\nprikazu1, je-li hodnota false, provede se poslou
pnost prikazu2.\nPodminka muze byt slozena z rovnic, nerovnosti, prome
nnych nebo funkci, ktere muze funkce evalb vyhodnotit\njako true nebo \+
false.\n" }}}{EXCHG {PARA 0 "> " 0 "" {MPLTEXT 1 0 6 "x:=-2;" }}{PARA 
11 "" 1 "" {XPPMATH 20 "6#>%\"xG!\"#" }}}{EXCHG {PARA 0 "> " 0 "" 
{MPLTEXT 1 0 24 "if x<0 then 0 else 1 fi;" }}{PARA 11 "" 1 "" 
{XPPMATH 20 "6#\"\"!" }}}{EXCHG {PARA 0 "> " 0 "" {MPLTEXT 1 0 6 "x:=P
i;" }}{PARA 11 "" 1 "" {XPPMATH 20 "6#>%\"xG%#PiG" }}}{EXCHG {PARA 0 "
> " 0 "" {MPLTEXT 1 0 31 "if evalf(x)<0 then 0 else 1 fi;" }}{PARA 11 
"" 1 "" {XPPMATH 20 "6#\"\"\"" }}}{EXCHG {PARA 0 "> " 0 "" {MPLTEXT 1 
0 5 "x:=1;" }}{PARA 11 "" 1 "" {XPPMATH 20 "6#>%\"xG\"\"\"" }}}{EXCHG 
{PARA 0 "> " 0 "" {MPLTEXT 1 0 22 "if x then 0 else 1 fi;" }}{PARA 8 "
" 1 "" {TEXT -1 33 "Error, invalid boolean expression" }}}{EXCHG 
{PARA 0 "" 0 "" {TEXT -1 24 "Vyber z vice moznosti:\n\n" }{TEXT 273 3 
"if " }{TEXT -1 6 "podm1 " }{TEXT 274 5 "then " }{TEXT -1 6 "posl1\n" 
}{TEXT 275 4 "elif" }{TEXT -1 7 " podm2 " }{TEXT 276 4 "then" }{TEXT 
-1 7 " posl2\n" }{TEXT 277 4 "elif" }{TEXT -1 7 " podm3 " }{TEXT 278 
4 "then" }{TEXT -1 11 " posl3\n.\n.\n" }{TEXT 279 4 "elif" }{TEXT -1 
7 " podmn " }{TEXT 280 4 "then" }{TEXT -1 7 " posln\n" }{TEXT 281 4 "e
lse" }{TEXT -1 6 " posl\n" }{TEXT 282 4 "fi;\n" }}}{EXCHG {PARA 0 "> \+
" 0 "" {MPLTEXT 1 0 6 "x:=-2;" }}{PARA 11 "" 1 "" {XPPMATH 20 "6#>%\"x
G!\"#" }}}{EXCHG {PARA 0 "> " 0 "" {MPLTEXT 1 0 14 "if x<0 then -1" }}
{PARA 0 "> " 0 "" {MPLTEXT 1 0 15 "elif x=0 then 0" }}{PARA 0 "> " 0 "
" {MPLTEXT 1 0 6 "else 1" }}{PARA 0 "> " 0 "" {MPLTEXT 1 0 3 "fi;" }}
{PARA 11 "" 1 "" {XPPMATH 20 "6#!\"\"" }}}{EXCHG {PARA 0 "" 0 "" 
{TEXT -1 183 "\nPr: Je dan matice typu (4x4).  Nasledujici prikaz vypl
nuje horni trojuhelnikovou matici radkovymi indexy,\ncast pod hlavni d
iagonalou sloupcovymi indexy a hlavni diagonalu jednickami." }}}
{EXCHG {PARA 0 "> " 0 "" {MPLTEXT 1 0 20 "A:=array(1..4,1..4):" }}
{PARA 0 "> " 0 "" {MPLTEXT 1 0 13 "for i to 4 do" }}{PARA 0 "> " 0 "" 
{MPLTEXT 1 0 13 "for j to 4 do" }}{PARA 0 "> " 0 "" {MPLTEXT 1 0 21 "i
f i<j then A[i,j]:=i" }}{PARA 0 "> " 0 "" {MPLTEXT 1 0 23 "elif i>j th
en A[i,j]:=j" }}{PARA 0 "> " 0 "" {MPLTEXT 1 0 14 "else A[i,j]:=1" }}
{PARA 0 "> " 0 "" {MPLTEXT 1 0 2 "fi" }}{PARA 0 "> " 0 "" {MPLTEXT 1 
0 2 "od" }}{PARA 0 "> " 0 "" {MPLTEXT 1 0 3 "od;" }}}{EXCHG {PARA 0 ">
 " 0 "" {MPLTEXT 1 0 9 "evalm(A);" }}{PARA 11 "" 1 "" {XPPMATH 20 "6#-
%'matrixG6#7&7&\"\"\"F(F(F(7&F(F(\"\"#F*7&F(F*F(\"\"$7&F(F*F,F(" }}}}
{SECT 0 {PARA 4 "" 0 "" {TEXT -1 5 "break" }}{EXCHG {PARA 0 "" 0 "" 
{TEXT -1 243 "Prikaz break uvnitr cyklu for a while zpusobi bezprostre
dni ukonceni tohoto cyklu.\n\nPr: Preruseni cyklu for pomoci prikazu b
reak:\nNalezne prvni hodnotu, ktera neni prvocislo v posloupnosti 2^i-
1, i=3,5,7,.. a jakmile ji najde, prerusi vypocet." }}}{EXCHG {PARA 0 
"> " 0 "" {MPLTEXT 1 0 20 "for i from 3 by 2 do" }}{PARA 0 "> " 0 "" 
{MPLTEXT 1 0 17 "if isprime(2^i-1)" }}{PARA 0 "> " 0 "" {MPLTEXT 1 0 
32 "then print(2^i-1,`je prvocislo`)" }}{PARA 0 "> " 0 "" {MPLTEXT 1 
0 10 "else break" }}{PARA 0 "> " 0 "" {MPLTEXT 1 0 2 "fi" }}{PARA 0 ">
 " 0 "" {MPLTEXT 1 0 3 "od;" }}{PARA 11 "" 1 "" {XPPMATH 20 "6$\"\"(%-
je~prvocisloG" }}{PARA 11 "" 1 "" {XPPMATH 20 "6$\"#J%-je~prvocisloG" 
}}{PARA 11 "" 1 "" {XPPMATH 20 "6$\"$F\"%-je~prvocisloG" }}}{EXCHG 
{PARA 0 "> " 0 "" {MPLTEXT 1 0 61 "lprint(`i=`,i,`, prvni neprvocislo \+
v posloupnosti je`,2^i-1);" }}{PARA 6 "" 1 "" {TEXT -1 52 "i=   9   , \+
prvni neprvocislo v posloupnosti je   511" }}}}}{SECT 0 {PARA 3 "" 0 "
" {TEXT -1 9 "Procedury" }}{EXCHG {PARA 0 "" 0 "" {TEXT -1 9 "Syntaxe:
\n" }{TEXT 283 4 "proc" }{TEXT -1 24 "(posloupnost parametru)\n" }
{TEXT 284 5 "local" }{TEXT -1 25 " posloupnost promennych;\n" }{TEXT 
285 7 "options" }{TEXT -1 45 " posloupnost nabidek;\nprikaz1\n.\n.\n.
\nprikaz n\n" }{TEXT 286 5 "end;\n" }{TEXT -1 71 "\nPozn:\nLokalni pro
menne - pouzivaji se behem vypoctu uvnitr procedury. " }{TEXT 287 43 "
Neovlivnuji hodnotu promenne vne procedury." }{TEXT -1 47 "\nRozdil me
zi lokalnimi a globalnimi promennymi:" }}}{EXCHG {PARA 0 "> " 0 "" 
{MPLTEXT 1 0 8 "restart;" }}}{EXCHG {PARA 0 "> " 0 "" {MPLTEXT 1 0 5 "
b:=2;" }}{PARA 11 "" 1 "" {XPPMATH 20 "6#>%\"bG\"\"#" }}}{EXCHG {PARA 
0 "> " 0 "" {MPLTEXT 1 0 9 "g:=proc()" }}{PARA 0 "> " 0 "" {MPLTEXT 1 
0 8 "local b;" }}{PARA 0 "> " 0 "" {MPLTEXT 1 0 5 "b:=5;" }}{PARA 0 ">
 " 0 "" {MPLTEXT 1 0 11 "evalf(b/2);" }}{PARA 0 "> " 0 "" {MPLTEXT 1 
0 4 "end:" }}}{EXCHG {PARA 0 "> " 0 "" {MPLTEXT 1 0 2 "b;" }}{PARA 11 
"" 1 "" {XPPMATH 20 "6#\"\"#" }}}{EXCHG {PARA 0 "> " 0 "" {MPLTEXT 1 
0 4 "g();" }}{PARA 11 "" 1 "" {XPPMATH 20 "6#$\"+++++D!\"*" }}}{EXCHG 
{PARA 0 "> " 0 "" {MPLTEXT 1 0 2 "b;" }}{PARA 11 "" 1 "" {XPPMATH 20 "
6#\"\"#" }}}{EXCHG {PARA 0 "> " 0 "" {MPLTEXT 1 0 9 "h:=proc()" }}
{PARA 0 "> " 0 "" {MPLTEXT 1 0 9 "global b;" }}{PARA 0 "> " 0 "" 
{MPLTEXT 1 0 5 "b:=5;" }}{PARA 0 "> " 0 "" {MPLTEXT 1 0 11 "evalf(b/2)
;" }}{PARA 0 "> " 0 "" {MPLTEXT 1 0 4 "end:" }}}{EXCHG {PARA 0 "> " 0 
"" {MPLTEXT 1 0 2 "b;" }}{PARA 11 "" 1 "" {XPPMATH 20 "6#\"\"#" }}}
{EXCHG {PARA 0 "> " 0 "" {MPLTEXT 1 0 4 "h();" }}{PARA 11 "" 1 "" 
{XPPMATH 20 "6#$\"+++++D!\"*" }}}{EXCHG {PARA 0 "> " 0 "" {MPLTEXT 1 
0 2 "b;" }}{PARA 11 "" 1 "" {XPPMATH 20 "6#\"\"&" }}}{EXCHG {PARA 0 "
" 0 "" {TEXT -1 152 "\nObsahuje -li procedura vice prikazu, realizuji \+
se jeden po druhem. Posledni vypocitana hodnota je hodnota procedury.
\n\nPr: Nalezeni maxima ze tri cisel." }}}{EXCHG {PARA 0 "> " 0 "" 
{MPLTEXT 1 0 17 "max3:=proc(a,b,c)" }}{PARA 0 "> " 0 "" {MPLTEXT 1 0 
34 "print(`nalezeni maxima z`, a,b,c);" }}{PARA 0 "> " 0 "" {MPLTEXT 
1 0 11 "if a<b then" }}{PARA 0 "> " 0 "" {MPLTEXT 1 0 24 " if b<c then
 c else b fi" }}{PARA 0 "> " 0 "" {MPLTEXT 1 0 16 " elif a<c then c" }
}{PARA 0 "> " 0 "" {MPLTEXT 1 0 7 " else a" }}{PARA 0 "> " 0 "" 
{MPLTEXT 1 0 3 "fi;" }}{PARA 0 "> " 0 "" {MPLTEXT 1 0 4 "end:" }}}
{EXCHG {PARA 0 "> " 0 "" {MPLTEXT 1 0 12 "max3(3,2,1);" }}{PARA 11 "" 
1 "" {XPPMATH 20 "6&%2nalezeni~maxima~zG\"\"$\"\"#\"\"\"" }}{PARA 11 "
" 1 "" {XPPMATH 20 "6#\"\"$" }}}{EXCHG {PARA 0 "" 0 "" {TEXT 288 12 "m
ax3(3,2,1) " }{TEXT -1 41 "provede prikazy v tele procedury tak, ze " 
}{TEXT 289 1 "a" }{TEXT -1 14 " ma hodnotu 3," }}{PARA 0 "" 0 "" 
{TEXT -1 0 "" }{TEXT 290 1 "b" }{TEXT -1 16 " ma hodnotu 2 a " }{TEXT 
291 1 "c" }{TEXT -1 14 " ma hodnotu 1." }}}{EXCHG {PARA 0 "> " 0 "" 
{MPLTEXT 1 0 12 "max3(1,8,9);" }}{PARA 11 "" 1 "" {XPPMATH 20 "6&%2nal
ezeni~maxima~zG\"\"\"\"\")\"\"*" }}{PARA 11 "" 1 "" {XPPMATH 20 "6#\"
\"*" }}}{EXCHG {PARA 0 "> " 0 "" {MPLTEXT 1 0 11 "max(1,8,9);" }}
{PARA 11 "" 1 "" {XPPMATH 20 "6#\"\"*" }}}{EXCHG {PARA 0 "> " 0 "" 
{MPLTEXT 1 0 23 "save(max3, \"max3.txt\");" }}}{EXCHG {PARA 0 "" 0 "" 
{TEXT -1 114 "Procedury s promennym poctem parametru - uvnitr procedur
y muzeme ziskat pocet skutecnych parametru\npomoci prikazu " }{TEXT 
296 5 "nargs" }{TEXT -1 18 ". Specialni jmeno " }{TEXT 297 4 "args" }
{TEXT -1 108 " ma jako svou hodnotu posloupnost skutecnych parametru. \+
i-ty parametr v teto posloupnosti lze ziskat pomoci " }{TEXT 298 7 "ar
gs[i]" }{TEXT -1 2 ".\n" }}{PARA 0 "" 0 "" {TEXT -1 249 "Pr: Procedura
 pro hledani maxima z cisel, zadanych jako argumenty. Muze byt zadan l
ibovolny pocet\nargumentu. Procedura testuje, zda jsou vsechny argumen
ty numericke, celociselne nebo racionalni.\nPokud ne, je procedura uko
ncena (vraci zadany prikaz)." }}}{EXCHG {PARA 0 "" 0 "" {TEXT -1 0 "" 
}{MPLTEXT 1 0 8 "restart;" }}}{EXCHG {PARA 0 "> " 0 "" {MPLTEXT 1 0 
29 "maxN:=proc() local result, i;" }}{PARA 0 "> " 0 "" {MPLTEXT 1 0 
36 "if not (type([args], list(numeric)))" }}{PARA 0 "> " 0 "" 
{MPLTEXT 1 0 31 " then RETURN('procname(args)');" }}{PARA 0 "> " 0 "" 
{MPLTEXT 1 0 13 " elif nargs>0" }}{PARA 0 "> " 0 "" {MPLTEXT 1 0 5 " t
hen" }}{PARA 0 "> " 0 "" {MPLTEXT 1 0 17 " result:=args[1];" }}{PARA 
0 "> " 0 "" {MPLTEXT 1 0 25 " for i from 2 to nargs do" }}{PARA 0 "> \+
" 0 "" {MPLTEXT 1 0 64 "                if args[i]>result then    resu
lt:=args[i] fi od;" }}{PARA 0 "> " 0 "" {MPLTEXT 1 0 8 " result;" }}
{PARA 0 "> " 0 "" {MPLTEXT 1 0 3 "fi;" }}{PARA 0 "> " 0 "" {MPLTEXT 1 
0 4 "end:" }}}{EXCHG {PARA 0 "> " 0 "" {MPLTEXT 1 0 22 "save maxN, \"m
axN.txt\";" }}}{EXCHG {PARA 0 "" 0 "" {TEXT -1 16 "Specialni jmeno " }
{TEXT 292 9 "procname " }{TEXT -1 37 "ma jako svou hodnotu jmeno proce
dury." }}}{EXCHG {PARA 0 "> " 0 "" {MPLTEXT 1 0 8 "restart;" }}}
{EXCHG {PARA 0 "> " 0 "" {MPLTEXT 1 0 16 "read \"maxN.txt\":" }}}
{EXCHG {PARA 0 "> " 0 "" {MPLTEXT 1 0 12 "maxN(1,2,3);" }}{PARA 11 "" 
1 "" {XPPMATH 20 "6#\"\"$" }}}{EXCHG {PARA 0 "> " 0 "" {MPLTEXT 1 0 
14 "maxN(z,1,2,3);" }}{PARA 11 "" 1 "" {XPPMATH 20 "6#-%%maxNG6&%\"zG
\"\"\"\"\"#\"\"$" }}}{EXCHG {PARA 0 "> " 0 "" {MPLTEXT 1 0 9 "result;i
;" }}{PARA 11 "" 1 "" {XPPMATH 20 "6#%'resultG" }}{PARA 11 "" 1 "" 
{XPPMATH 20 "6#%\"iG" }}}{EXCHG {PARA 0 "> " 0 "" {MPLTEXT 1 0 0 "" }}
}{EXCHG {PARA 0 "" 0 "" {TEXT -1 40 "Prikaz RETURN vraci hodnotu proce
dury.\n\n" }}{PARA 0 "" 0 "" {TEXT -1 56 "Lokalni promenne nemaji vne \+
procedury prirazenu hodnotu." }}{PARA 0 "" 0 "" {TEXT 293 97 "U lokaln
ich promennych nedochazi k uplnemu vyhodnocovani, vyhodnoceni se deje \+
pouze do urovne 1.\n" }{TEXT -1 99 "Pokud chceme i u lokalnich promenn
ych dosahnout uplneho vyhodnoceni, musime pouzit funkce eval.\nPr:" }}
}{EXCHG {PARA 0 "> " 0 "" {MPLTEXT 1 0 12 "Cfun:=proc()" }}{PARA 0 "> \+
" 0 "" {MPLTEXT 1 0 12 "  local C,y;" }}{PARA 0 "> " 0 "" {MPLTEXT 1 
0 12 "  C:=sin(y);" }}{PARA 0 "> " 0 "" {MPLTEXT 1 0 11 "  print(C);" 
}}{PARA 0 "> " 0 "" {MPLTEXT 1 0 7 "  y:=0;" }}{PARA 0 "> " 0 "" 
{MPLTEXT 1 0 11 "  print(C);" }}{PARA 0 "> " 0 "" {MPLTEXT 1 0 17 "  p
rint(eval(C));" }}{PARA 0 "> " 0 "" {MPLTEXT 1 0 4 "end:" }}}{EXCHG 
{PARA 0 "> " 0 "" {MPLTEXT 1 0 7 "Cfun();" }}{PARA 11 "" 1 "" 
{XPPMATH 20 "6#-%$sinG6#%\"yG" }}{PARA 11 "" 1 "" {XPPMATH 20 "6#-%$si
nG6#%\"yG" }}{PARA 11 "" 1 "" {XPPMATH 20 "6#\"\"!" }}}{EXCHG {PARA 0 
"" 0 "" {TEXT -1 87 "Zadani parametru v prubehu procedury (interaktivn
i vstup) umoznuje funkce readstat.\nPr:" }}{PARA 0 "> " 0 "" {MPLTEXT 
1 0 8 "restart;" }}}{EXCHG {PARA 0 "> " 0 "" {MPLTEXT 1 0 23 "Interact
iveDiff:=proc()" }}{PARA 0 "> " 0 "" {MPLTEXT 1 0 10 "local a,b;" }}
{PARA 0 "> " 0 "" {MPLTEXT 1 0 29 "a:=readstat(\"Zadej vyraz: \");" }}
{PARA 0 "> " 0 "" {MPLTEXT 1 0 36 "b:=readstat(\"Derivuj vzhledem k: \+
\");" }}{PARA 0 "> " 0 "" {MPLTEXT 1 0 34 "print(\"Derivace je\",diff(
a,b))end:" }}}{EXCHG {PARA 0 "> " 0 "" {MPLTEXT 1 0 18 "InteractiveDif
f();" }}}{EXCHG {PARA 0 "Zadej vyraz: " 0 "" {MPLTEXT 1 0 4 "x^3;" }}
{PARA 11 "" 1 "" {XPPMATH 20 "6#*$)%\"xG\"\"$\"\"\"" }}}{EXCHG {PARA 
0 "Derivuj vzhledem k: " 0 "" {MPLTEXT 1 0 2 "x;" }}{PARA 11 "" 1 "" 
{XPPMATH 20 "6#%\"xG" }}}{SECT 0 {PARA 4 "" 0 "" {TEXT -1 15 "Ladeni p
rocedur" }}{PARA 0 "" 0 "" {TEXT -1 28 "Podrobneji viz prednaska 12." 
}}{PARA 0 "" 0 "" {TEXT -1 0 "" }}{EXCHG {PARA 0 "> " 0 "" {MPLTEXT 1 
0 8 "restart;" }}}}{SECT 0 {PARA 4 "" 0 "" {TEXT -1 28 "Ukladani a nac
itani procedur" }}{EXCHG {PARA 0 "" 0 "" {TEXT -1 75 "save procedura, \+
\"procedura.txt\";\nsave \"procedura.m\";\nread \"procedura.txt\";\n" 
}}}{EXCHG {PARA 0 "> " 0 "" {MPLTEXT 1 0 138 "CMAX:=proc(x::complex(nu
meric), y::complex(numeric)) option `Copyright 2001 R. Plch`; descript
ion \"cvicna procedura\";if abs(x)>abs(y) then" }}{PARA 0 "> " 0 "" 
{MPLTEXT 1 0 2 "x;" }}{PARA 0 "> " 0 "" {MPLTEXT 1 0 4 "else" }}{PARA 
0 "> " 0 "" {MPLTEXT 1 0 2 "y;" }}{PARA 0 "> " 0 "" {MPLTEXT 1 0 3 "fi
;" }}{PARA 0 "> " 0 "" {MPLTEXT 1 0 4 "end:" }}}{EXCHG {PARA 0 "> " 0 
"" {MPLTEXT 1 0 13 "CMAX(I, 2*I);" }}{PARA 11 "" 1 "" {XPPMATH 20 "6#,
$%\"IG\"\"#" }}}{EXCHG {PARA 0 "> " 0 "" {MPLTEXT 1 0 18 "op(1, eval(C
MAX));" }}{PARA 11 "" 1 "" {XPPMATH 20 "6$'%\"xG-%(complexG6#%(numeric
G'%\"yGF%" }}}{EXCHG {PARA 0 "" 0 "" {TEXT -1 32 "posloupnost formalni
ch parametru" }}}{EXCHG {PARA 0 "> " 0 "" {MPLTEXT 1 0 18 "op(2, eval(
CMAX));" }}}{EXCHG {PARA 0 "" 0 "" {TEXT -1 32 "posloupnost lokalnich \+
promennych" }}}{EXCHG {PARA 0 "> " 0 "" {MPLTEXT 1 0 18 "op(3, eval(CM
AX));" }}{PARA 11 "" 1 "" {XPPMATH 20 "6#%7Copyright~2001~R.~PlchG" }}
}{EXCHG {PARA 0 "" 0 "" {TEXT -1 27 "posloupnost voleb (options)" }}}
{EXCHG {PARA 0 "> " 0 "" {MPLTEXT 1 0 18 "op(4, eval(CMAX));" }}}
{EXCHG {PARA 0 "" 0 "" {TEXT -1 16 "pametova tabulka" }}}{EXCHG {PARA 
0 "> " 0 "" {MPLTEXT 1 0 18 "op(5, eval(CMAX));" }}{PARA 11 "" 1 "" 
{XPPMATH 20 "6#Q1cvicna~procedura6\"" }}}{EXCHG {PARA 0 "" 0 "" {TEXT 
-1 5 "popis" }}}{EXCHG {PARA 0 "> " 0 "" {MPLTEXT 1 0 18 "op(6, eval(C
MAX));" }}}{EXCHG {PARA 0 "" 0 "" {TEXT -1 33 "posloupnost globalnich \+
promennych" }}}{EXCHG {PARA 0 "> " 0 "" {MPLTEXT 1 0 22 "save CMAX, \"
CMAX.txt\";" }}}{EXCHG {PARA 0 "> " 0 "" {MPLTEXT 1 0 0 "" }}{PARA 0 "
> " 0 "" {MPLTEXT 1 0 8 "restart;" }}}{EXCHG {PARA 0 "> " 0 "" 
{MPLTEXT 1 0 16 "read \"CMAX.txt\";" }}{PARA 12 "" 1 "" {XPPMATH 20 "6
#>%%CMAXGR6$'%\"xG-%(complexG6#%(numericG'%\"yGF)6\"6#%7Copyright~2001
~R.~PlchGF/@%2-%$absG6#9%-F56#9$F:F76#Q1cvicna~proceduraF/F/F/" }}}
{EXCHG {PARA 0 "> " 0 "" {MPLTEXT 1 0 12 "CMAX(I,2*I);" }}{PARA 11 "" 
1 "" {XPPMATH 20 "6#,$%\"IG\"\"#" }}}{EXCHG {PARA 0 "" 0 "" {TEXT 300 
18 "Vytvareni balicku:" }}}{EXCHG {PARA 0 "" 0 "" {TEXT -1 131 "Proced
ury, ktere spolu nejak souvisi je vhodne ukladat spolecne jako tabulku
 procedur, kterou pak muzeme jednoduse nacist prikazem " }{TEXT 301 5 
"with " }{TEXT -1 38 "(balicek je vlastne tabulka procedur)." }}}
{EXCHG {PARA 0 "> " 0 "" {MPLTEXT 1 0 16 "powers:=table();" }}{PARA 
12 "" 1 "" {XPPMATH 20 "6#>%'powersG-%&TABLEG6#7\"" }}}{EXCHG {PARA 0 
"> " 0 "" {MPLTEXT 1 0 21 "powers[sqr1]:=proc(x)" }}{PARA 0 "> " 0 "" 
{MPLTEXT 1 0 4 "x^2;" }}{PARA 0 "> " 0 "" {MPLTEXT 1 0 4 "end:" }}}
{EXCHG {PARA 0 "> " 0 "" {MPLTEXT 1 0 21 "powers[cube]:=proc(x)" }}
{PARA 0 "> " 0 "" {MPLTEXT 1 0 4 "x^3;" }}{PARA 0 "> " 0 "" {MPLTEXT 
1 0 4 "end:" }}}{EXCHG {PARA 0 "> " 0 "" {MPLTEXT 1 0 18 "powers[sqr1]
(x+y);" }}{PARA 11 "" 1 "" {XPPMATH 20 "6#*$),&%\"xG\"\"\"%\"yGF'\"\"#
\"\"\"" }}}{EXCHG {PARA 0 "> " 0 "" {MPLTEXT 1 0 13 "with(powers);" }}
{PARA 11 "" 1 "" {XPPMATH 20 "6#7$%%cubeG%%sqr1G" }}}{EXCHG {PARA 0 ">
 " 0 "" {MPLTEXT 1 0 8 "cube(x);" }}{PARA 11 "" 1 "" {XPPMATH 20 "6#*$
)%\"xG\"\"$\"\"\"" }}}{EXCHG {PARA 0 "> " 0 "" {MPLTEXT 1 0 25 "save(p
owers, \"powers.m\");" }}}{EXCHG {PARA 0 "> " 0 "" {MPLTEXT 1 0 8 "res
tart;" }}}{EXCHG {PARA 0 "> " 0 "" {MPLTEXT 1 0 8 "libname;" }}{PARA 
11 "" 1 "" {XPPMATH 20 "6$Q;/usr/local/mapleV51/update6\"Q8/usr/local/
mapleV51/libF$" }}}{EXCHG {PARA 0 "> " 0 "" {MPLTEXT 1 0 86 "libname:=
 `/home_zam/plch/public_html/vyuka/maple`, `/home/plch/vyuka/maple`, l
ibname;" }}{PARA 12 "" 1 "" {XPPMATH 20 "6#>%(libnameG6&%G/home_zam/pl
ch/public_html/vyuka/mapleG%7/home/plch/vyuka/mapleGQ;/usr/local/maple
V51/update6\"Q8/usr/local/mapleV51/libF)" }}}{EXCHG {PARA 0 "> " 0 "" 
{MPLTEXT 1 0 13 "with(powers);" }}{PARA 11 "" 1 "" {XPPMATH 20 "6#7$%%
cubeG%%sqr1G" }}}{EXCHG {PARA 0 "> " 0 "" {MPLTEXT 1 0 8 "cube(3);" }}
{PARA 11 "" 1 "" {XPPMATH 20 "6#\"#F" }}}}{SECT 0 {PARA 4 "" 0 "" 
{TEXT -1 16 "Tvorba napovedy " }}{EXCHG {PARA 0 "" 0 "" {TEXT -1 183 "
Jednou z moznosti je pripravit textovy soubor (pomoc.txt) a vytvorit v
lastni knihovnu pro napovedu prikazem makehelp. Adresar, do ktereho se
 bude knihovna ukladat jiz musi existovat! " }}{PARA 0 "" 0 "" {TEXT 
-1 0 "" }}{PARA 0 "" 0 "" {TEXT -1 132 "Druhou moznosti je stranku nap
ovedy pripravit primo v Maplu a pote pomoci prikazu Save to Database z
 menu Help vytvorit odpovidajici" }}{PARA 0 "" 0 "" {TEXT -1 9 "knihov
nu." }}{PARA 0 "" 0 "" {TEXT -1 0 "" }}{PARA 0 "" 0 "" {TEXT -1 3 "Pr.
" }}}{EXCHG {PARA 0 "> " 0 "" {MPLTEXT 1 0 8 "restart;" }}}{EXCHG 
{PARA 0 "> " 0 "" {MPLTEXT 1 0 86 "libname:=`/home_zam/plch/public_htm
l/vyuka/maple/`, `/home/plch/vyuka/maple`, libname;" }}{PARA 12 "" 1 "
" {XPPMATH 20 "6#>%(libnameG6&%H/home_zam/plch/public_html/vyuka/maple
/G%7/home/plch/vyuka/mapleGQ;/usr/local/mapleV51/update6\"Q8/usr/local
/mapleV51/libF)" }}}{EXCHG {PARA 0 "> " 0 "" {MPLTEXT 1 0 18 "readlib(
makehelp):" }}}{EXCHG {PARA 0 "> " 0 "" {MPLTEXT 1 0 27 "makehelp(foo,
 `pomoc.txt`);" }}}{EXCHG {PARA 0 "> " 0 "" {MPLTEXT 1 0 0 "" }}}
{EXCHG {PARA 0 "> " 0 "" {MPLTEXT 1 0 0 "" }}}}}}{MARK "2 40 3 1" 0 }
{VIEWOPTS 1 1 0 1 1 1803 }