\u00a0<\/p>\n
\u00davod<\/strong>
1. Vyp\u00ed\u0161te na obrazovku \"ahoj svet\" - writeln.\n2. Vygenerujte n\u00e1hodn\u00e9 \u010d\u00edslo, ktor\u00e9 bude po\u010det sek\u00fand a zistite ko\u013eko je to hod., min. a dn\u00ed - div, mod, random, randomize\n3. Program, ktor\u00fd na\u010d\u00edta a,b a vypo\u010d\u00edta v\u00fdraz (a+b)**2 readln, writeln\n4. Na\u010d\u00edtajte z kl\u00e1vesnice va\u0161e meno a vyp\u00ed\u0161te n kr\u00e1t na obrazovku - input, print, zre\u0165azenie re\u0165azcov.\n5. Vytvorte program kde zist\u00edte celo\u010d\u00edseln\u00fd podiel a celo\u010d\u00edseln\u00fd zvy\u0161ok z 2 \u010d\u00edsel zadan\u00fdch z kl\u00e1vesnice. - div, mod\n6. Na\u010d\u00edtajte zo vstupu a,b,c ktor\u00e9 s\u00fa koeficientami ax2+bx+c=0 a zistite korene ak ma rovnica rie\u0161enie. -IF \n7. Program, kde si pre dve \u010d\u00edsla zadan\u00e9 z kl\u00e1vesnice vyberiete oper\u00e1ciu +,-,*,\/ a v\u00fdsledok vyp\u00ed\u0161te - elif\n8. Program, ktor\u00fd zist\u00ed \u010di zadan\u00e9 \u010d\u00edslo je p\u00e1rne alebo nep\u00e1rne - IF\n9. Program, ktor\u00fd zist\u00ed \u010di je trojuholn\u00edk zostrojiteln\u00fd ak pozn\u00e1me jeho 3 strany - IF\n10. Zistite vz\u00e1jomn\u00fa polohu bodu a \u0161tvorca ak pozn\u00e1te s\u00faradnice bodu (x,y) s\u00faradnice stredu \u0161tvorca s\u00fa 0,0 a ve\u013ekos\u0165 strany \u0161tvorca je (a) - IF\n11. Program ktor\u00fd zisti zo s\u00faradn\u00edc bodu v ktorej \u010dasti s\u00faradnicovej roviny sa nach\u00e1dza, IF --,-+,+-,++\n12. Na\u010d\u00edtajte 3 \u010d\u00edsla (a,b,c) a vyp\u00ed\u0161te ich od najmen\u0161ieho po najv\u00e4\u010d\u0161ie - IF\n13. Na\u010d\u00edtajte \u010d\u00edslo int zo vstupu a zistite ko\u013eko cifern\u00e9 je to \u010d\u00edslo, vyrie\u0161te po 6 cifern\u00e9 \u010d\u00edslo. - IF, alebo Case -\n14. Vytvorte zmen\u00e1re\u0148, zadajte \u010d\u00edslo v \u20ac a preme\u0148te ho na Anglick\u00e9 Libry, zistite aktu\u00e1lny kurz. - IF, \/\/, %
15. Zistite, \u010di m\u00f4\u017ee n\u00e1kladn\u00e9 auto prejs\u0165 cez most, ak pozn\u00e1me nosnos\u0165 mosta a v\u00e1hu auta.\n\nCykly<\/strong>\n\n1. Program NSD - while\n2. Zistite po\u010det cifier \u010d\u00edsla N - while\n3. Program s\u00fa\u010det cifier \u010d\u00edsla - while\n4. Pomocou opakovan\u00e9ho od\u010d\u00edtania zistite delenie zo zvy\u0161kom pre \u010d\u00edsla (a, b)- while\n5. Program pohybu hviezdi\u010dky po obrazovke pokia\u013e nestla\u010d\u00edme Esc - repeat, readkey, keypressed, gotoxy\n6. Vytvorte usporiadan\u00fa postupnos\u0165 \u010d\u00edsiel ve\u013ekost si zadajte z kl\u00e1vesnice- For\n7. Vyp\u00ed\u0161te na obrazovku p\u00e1rne \u010d\u00edsla v zadanom rozsahu - For, IF\n8. Vytvorte program malej n\u00e1sobilky - For\n9. Program na n \u010dlenov fibonachiho postupnosti - For\n10. Zadan\u00e9 slovo zak\u00f3dujte spos\u00f4bom zistenia ordin\u00e1lnej hodnoty znaku + 1 - for, string, length, org, chr\n11. \n12. Zadan\u00fa vetu prisp\u00f4sobte form\u00e1tu SMS - odstr\u00e1\u0148te medzery a za\u010diato\u010dn\u00e9 p\u00edsmena slov dajte ve\u013ek\u00fdm p\u00edsmenom, - For, string, uppcase, IF\n13. Vyn\u00e1sobte dve \u010d\u00edsla (a, b) bez pou\u017eitia oper\u00e1cie n\u00e1sobenia - For\n14. Vytvorte program ktor\u00fd vyp\u00ed\u0161e n hviezdi\u010diek do riadku. - For\n15. Zistite aritmetick\u00fd priemer \u010d\u00edsel v zadanom rozsahu (a, b) - For, real\n16. Zistite \u010di je \u010d\u00edslo (n) prvo\u010d\u00edslo - for, mod, if\n17. Vypo\u010d\u00edtajte faktori\u00e1l \u010d\u00edsla (n) - for\n18. Zistite v\u0161etky delitele \u010d\u00edsla - for, mod, if\n19. Vypo\u010d\u00edtajte n na x-tu - for\n20. Vytvorte program ktor\u00fd vyp\u00ed\u0161e n hviezdi\u010diek do tvaru\n n=4\n\t*\n\t**\n\t***\n\t****\n21. Vytvorte program ktory vypise n hviezdiciek do tvaru\n\tn=4\n\t****\n\t***\n\t**\n\t*\n22. Zistite \u010di je zadan\u00e9 \u010d\u00edslo palindr\u00f3m ak nie, nech n\u00e1jde najbli\u017e\u0161\u00ed v\u00e4\u010d\u0161\u00ed palindr\u00f3m - while, If\n23. Zistite \u010di je zadan\u00e9 \u010d\u00edslo prvo\u010d\u00edslo - for, IF\n24. Vyp\u00ed\u0161te v\u0161etky prvo\u010d\u00edsla po zadan\u00e9 \u010d\u00edslo n - For, IF
25. Zistite \u010di je \u0160PZ nap\u00edsan\u00e1 v spr\u00e1vnom tvare. XY123XY
26. Do n\u00e1kladn\u00e9ho auta naklad\u00e1te palety hmotnosti 0.9t nosnos\u0165 auta je 10t ak nalo\u017e\u00edte pln\u00e9 auto, nech vyp\u00ed\u0161e \"pristavte prazdne auto\" a naklad\u00e1 pokia\u013e nenalo\u017e\u00ed n\u00e1hodne vygenerovan\u00fa celkov\u00fa hmotnos\u0165 tovaru. \n\nZoznamy, polia, str<\/strong>\n\n1. Vytvorte program ktor\u00fd zist\u00ed MAX prvok a aj jeho poz\u00edciu v poli \u010d\u00edsel o ve\u013ekosti n - for, IF, array\n2. Vygenerujte n prvkov\u00fa postupnos\u0165 \u010d\u00edsel a zistite ko\u013eko je v nej p\u00e1rnych a ko\u013eko nep\u00e1rnych \u010d\u00edsel - for, if, array\n3. V n prvkovej postupnosti vyp\u00ed\u0161te prvo\u010d\u00edsla a aj poz\u00edcie na ktor\u00fdch sa nach\u00e1dzaj\u00fa - for, if, array\n4. Do n prvkovej postupnosti pridajte prvok (x) na zadan\u00fa poz\u00edciu (p) tak aby sa \u017eiadny prvok neprep\u00edsal a vznikla n+1 prvkov\u00e1 postupnos\u0165. - for, if, array\n5. V n prvkovej postupnosti \u010d\u00edsel, n\u00e1jdite minimum a maximum a vyme\u0148te ich poz\u00edcie. - for, if, array\n6. V postupnosti \u010d\u00edsel n\u00e1jdite druh\u00e9 minimum aj s poz\u00edciou - for, if, array\n7. Vytvorte program v ktorom odoberiete prvok z prvej poz\u00edcie a prid\u00e1te nov\u00fd prvok na koniec postupnosti, - for, array\n8. Zistite po\u010det dvojcifern\u00fdch \u010d\u00edsel v n*prvkovej postupnosti naplnen\u00e9j n\u00e1hodn\u00fdmi \u010d\u00edslami - for, array, if \n9. Vytvorte program, ktor\u00fd zist\u00ed po\u010detnos\u0165 znakov vo vete. string, array, if, for
10. Zo zadan\u00e9ho rodn\u00e9ho \u010d\u00edsla zistite \u010di je to mu\u017e, alebo \u017eena - string\n\nZlo\u017een\u00e9 \u00fadajov\u00e9 typy<\/strong>\n\n1. Vytvorte program ktor\u00fd si bude pam\u00e4ta\u0165 inform\u00e1cie o hr\u00e1\u010doch volejbalu\nmeno\nv\u00fd\u0161ka\nv\u00e1ha\nv\u00fdskok\n\u010c\u00edseln\u00e9 hodnoty generujte n\u00e1hodne\nZistite najvy\u0161\u0161ieho hr\u00e1\u010da\nHr\u00e1\u010da s najni\u017e\u0161\u00edm v\u00fdskokom\nVyp\u00ed\u0161te v\u0161etk\u00fdch s v\u00fdskokom nad 3 m\n\n\n2. Vytvorte program ktor\u00fd si bude pam\u00e4ta\u0165 inform\u00e1cie o \u017eiakoch a p\u00edsomk\u00e1ch\nz ka\u017edej p\u00edsomky m\u00f4\u017ee z\u00edska\u0165 maxim\u00e1lne 10 bodov\nmeno\np1, p2, p3, p4\nZistite \u017eiakov ktor\u00fd maj\u00fa maxim\u00e1lny po\u010det bodov zo v\u0161etk\u00fdch p\u00edsomiek\nZistite \u017eiaka ktor\u00fd m\u00e1 najmenej bodov z p\u00edsomiek\nUsporiadajte \u017eiakov pod\u013ea bodov\nz celkov\u00e9ho po\u010dtu bodov im vytvorte zn\u00e1mku\npercent\u00e1:\n100 - 90 - 1\n89 - 75 - 2 \n74 - 50 - 3\n49 - 25 - 4\n74 - 50 - 3\n49 - 25 - 4\n24 - 0 - 5\nBody generujte n\u00e1hodne.\n\n3. Vytvorte program ktor\u00fd si bude pam\u00e4ta\u0165 hr\u00e1\u010dov hodu s kockou\nKa\u017ed\u00fd hr\u00e1\u010d h\u00e1d\u017ee 5 pokusov.\nVyp\u00ed\u0161te inform\u00e1cie v podobe tabu\u013eky.\nV poslednom st\u013apci zobrazte celkov\u00fd po\u010det bodov.\nZistite hr\u00e1\u010dov ktor\u00ed hodili viac ako 2 \u0161estky.\nZistite hr\u00e1\u010da s najviac \u0161estkami.\nZistite hr\u00e1\u010da s najni\u017e\u0161\u00edm po\u010dtom \u0161estiek.\nHody vytvorte pomocou random.<\/pre>\n\n\n<\/p>\n","protected":false},"excerpt":{"rendered":"
\u00a0 \u00davod1. Vyp\u00ed\u0161te na obrazovku „ahoj svet“ – writeln. 2. Vygenerujte n\u00e1hodn\u00e9 \u010d\u00edslo, ktor\u00e9 bude po\u010det sek\u00fand a zistite ko\u013eko je to hod., min. a dn\u00ed – div, mod, random, randomize 3. Program, ktor\u00fd na\u010d\u00edta a,b a vypo\u010d\u00edta v\u00fdraz (a+b)**2 readln, writeln 4. Na\u010d\u00edtajte z kl\u00e1vesnice va\u0161e meno a vyp\u00ed\u0161te n kr\u00e1t na obrazovku – … Pokra\u010dova\u0165 v \u010d\u00edtan\u00ed: Zbierka \u00faloh z programovania<\/span><\/a><\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"closed","ping_status":"closed","sticky":false,"template":"","format":"standard","meta":{"_exactmetrics_skip_tracking":false,"_exactmetrics_sitenote_active":false,"_exactmetrics_sitenote_note":"","_exactmetrics_sitenote_category":0,"footnotes":""},"categories":[4],"tags":[7],"class_list":["post-109","post","type-post","status-publish","format-standard","hentry","category-pascal","tag-pascal"],"_links":{"self":[{"href":"https:\/\/www.legon.sk\/wp\/index.php?rest_route=\/wp\/v2\/posts\/109","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/www.legon.sk\/wp\/index.php?rest_route=\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/www.legon.sk\/wp\/index.php?rest_route=\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/www.legon.sk\/wp\/index.php?rest_route=\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/www.legon.sk\/wp\/index.php?rest_route=%2Fwp%2Fv2%2Fcomments&post=109"}],"version-history":[{"count":17,"href":"https:\/\/www.legon.sk\/wp\/index.php?rest_route=\/wp\/v2\/posts\/109\/revisions"}],"predecessor-version":[{"id":293,"href":"https:\/\/www.legon.sk\/wp\/index.php?rest_route=\/wp\/v2\/posts\/109\/revisions\/293"}],"wp:attachment":[{"href":"https:\/\/www.legon.sk\/wp\/index.php?rest_route=%2Fwp%2Fv2%2Fmedia&parent=109"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.legon.sk\/wp\/index.php?rest_route=%2Fwp%2Fv2%2Fcategories&post=109"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.legon.sk\/wp\/index.php?rest_route=%2Fwp%2Fv2%2Ftags&post=109"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}