{"id":8006,"date":"2023-01-18T15:51:47","date_gmt":"2023-01-18T13:51:47","guid":{"rendered":"https:\/\/blue.pri.ee\/ttu\/?page_id=8006"},"modified":"2025-09-15T13:01:52","modified_gmt":"2025-09-15T11:01:52","slug":"tsuklid-korrutustabel","status":"publish","type":"page","link":"https:\/\/blue.pri.ee\/ttu\/programmeerimine-i\/koodinaited\/tsuklid-korrutustabel\/","title":{"rendered":"Ts\u00fcklid &#8211; korrutustabel"},"content":{"rendered":"<p>J\u00e4rgnevalt koostame kaks programmi erinevate korrutustabeli lahenduste genereerimiseks.<\/p>\n<div id=\"ez-toc-container\" class=\"ez-toc-v2_0_85 counter-hierarchy ez-toc-counter ez-toc-grey ez-toc-container-direction\">\n<div class=\"ez-toc-title-container\">\n<span class=\"ez-toc-title-toggle\"><a href=\"#\" class=\"ez-toc-pull-right ez-toc-btn ez-toc-btn-xs ez-toc-btn-default ez-toc-toggle\" aria-label=\"Toggle Table of Content\"><span class=\"ez-toc-js-icon-con\"><span class=\"\"><span class=\"eztoc-hide\" style=\"display:none;\">Toggle<\/span><span class=\"ez-toc-icon-toggle-span\"><svg style=\"fill: #999;color:#999\" xmlns=\"http:\/\/www.w3.org\/2000\/svg\" class=\"list-377408\" width=\"20px\" height=\"20px\" viewBox=\"0 0 24 24\" fill=\"none\"><path d=\"M6 6H4v2h2V6zm14 0H8v2h12V6zM4 11h2v2H4v-2zm16 0H8v2h12v-2zM4 16h2v2H4v-2zm16 0H8v2h12v-2z\" fill=\"currentColor\"><\/path><\/svg><svg style=\"fill: #999;color:#999\" class=\"arrow-unsorted-368013\" xmlns=\"http:\/\/www.w3.org\/2000\/svg\" width=\"10px\" height=\"10px\" viewBox=\"0 0 24 24\" version=\"1.2\" baseProfile=\"tiny\"><path d=\"M18.2 9.3l-6.2-6.3-6.2 6.3c-.2.2-.3.4-.3.7s.1.5.3.7c.2.2.4.3.7.3h11c.3 0 .5-.1.7-.3.2-.2.3-.5.3-.7s-.1-.5-.3-.7zM5.8 14.7l6.2 6.3 6.2-6.3c.2-.2.3-.5.3-.7s-.1-.5-.3-.7c-.2-.2-.4-.3-.7-.3h-11c-.3 0-.5.1-.7.3-.2.2-.3.5-.3.7s.1.5.3.7z\"\/><\/svg><\/span><\/span><\/span><\/a><\/span><\/div>\n<nav><ul class='ez-toc-list ez-toc-list-level-1 ' ><li class='ez-toc-page-1 ez-toc-heading-level-3'><a class=\"ez-toc-link ez-toc-heading-1\" href=\"https:\/\/blue.pri.ee\/ttu\/programmeerimine-i\/koodinaited\/tsuklid-korrutustabel\/#Naide_1_Korrutustabel_kindla_teguriga\" >N\u00e4ide 1: Korrutustabel kindla teguriga<\/a><ul class='ez-toc-list-level-4' ><li class='ez-toc-heading-level-4'><a class=\"ez-toc-link ez-toc-heading-2\" href=\"https:\/\/blue.pri.ee\/ttu\/programmeerimine-i\/koodinaited\/tsuklid-korrutustabel\/#Ulesande_lahendusalgoritm_tegevusdiagrammina\" >\u00dclesande lahendusalgoritm tegevusdiagrammina<\/a><\/li><\/ul><\/li><li class='ez-toc-page-1 ez-toc-heading-level-3'><a class=\"ez-toc-link ez-toc-heading-3\" href=\"https:\/\/blue.pri.ee\/ttu\/programmeerimine-i\/koodinaited\/tsuklid-korrutustabel\/#Naide_2_Terviklik_korrutustabel\" >N\u00e4ide 2: Terviklik korrutustabel<\/a><\/li><\/ul><\/nav><\/div>\n<h3><span class=\"ez-toc-section\" id=\"Naide_1_Korrutustabel_kindla_teguriga\"><\/span>N\u00e4ide 1: Korrutustabel kindla teguriga<span class=\"ez-toc-section-end\"><\/span><\/h3>\n<p>Esimeses n\u00e4iteprogrammis k\u00fcsitakse kasutajalt mis arvule me korrutist soovime genereerida ning korrutustabel luuakse alates v\u00e4\u00e4rtusest 0 kuni v\u00e4\u00e4rtuseni 10, mis on defineeritud makrona <span class=\"lang:default highlight:0 decode:true crayon-inline \">MULT_LIMIT<\/span> . M\u00e4rka, et ts\u00fckli tingimuses on v\u00f5rdluseks <span class=\"lang:default highlight:0 decode:true crayon-inline \">&lt;=<\/span>\u00a0 ehk otspunkt on kaasa arvatud &#8211; enamasti me otspunkte ei kaasa, k\u00fcll aga antud juhul on meil see vajalik<\/p>\n<pre class=\"toolbar:2 lang:default decode:true\">\/**\r\n * File:        mult1.c\r\n * Author:      Risto Heinsar\r\n * Created:     18.01.2023\r\n * Edited:      15.09.2025\r\n *\r\n * Description: Sample code for looping, demonstrating how to generate a\r\n *              multiplication table for a single number.\r\n *\/\r\n\r\n#include &lt;stdio.h&gt;\r\n\r\n#define MULT_LIMIT 10\r\n\r\nint main(void)\r\n{\r\n    int multiplier;\r\n    \r\n    printf(\"Enter the number you would like to multiply: \");\r\n    scanf(\"%d\", &amp;multiplier);\r\n    \r\n    printf(\"Generating multiplication table of %d from 0 to %d\\n\",\r\n           multiplier, MULT_LIMIT);\r\n    \r\n    \/\/ Loop for multiplication, end value is inclusive\r\n    for (int i = 0; i &lt;= MULT_LIMIT; i++)\r\n    {\r\n        \/\/ Calculate answer\r\n        int product = multiplier * i;\r\n        \r\n        \/\/ Print the operation and the answer\r\n        printf(\"%d * %d = %d\\n\", multiplier, i, product);\r\n    }\r\n    return 0;\r\n}\r\n<\/pre>\n<h4><span class=\"ez-toc-section\" id=\"Ulesande_lahendusalgoritm_tegevusdiagrammina\"><\/span>\u00dclesande lahendusalgoritm tegevusdiagrammina<span class=\"ez-toc-section-end\"><\/span><\/h4>\n<p>Algoritmis on oluline j\u00e4lgida programmivoogu t\u00e4histavaid nooli ning ts\u00fckli tingimuste korrektset vormistamist.<\/p>\n<p><a href=\"https:\/\/blue.pri.ee\/ttu\/wp-content\/uploads\/2025\/09\/ex_mult_single_et.png\"><img loading=\"lazy\" decoding=\"async\" class=\"aligncenter size-full wp-image-10619\" src=\"https:\/\/blue.pri.ee\/ttu\/wp-content\/uploads\/2025\/09\/ex_mult_single_et.png\" alt=\"\" width=\"613\" height=\"753\" srcset=\"https:\/\/blue.pri.ee\/ttu\/wp-content\/uploads\/2025\/09\/ex_mult_single_et.png 613w, https:\/\/blue.pri.ee\/ttu\/wp-content\/uploads\/2025\/09\/ex_mult_single_et-244x300.png 244w\" sizes=\"auto, (max-width: 613px) 100vw, 613px\" \/><\/a><\/p>\n<h3><span class=\"ez-toc-section\" id=\"Naide_2_Terviklik_korrutustabel\"><\/span>N\u00e4ide 2: Terviklik korrutustabel<span class=\"ez-toc-section-end\"><\/span><\/h3>\n<p>Teises n\u00e4ites vaatame \u00fcksteise sisse paigutatud ehk pesastatud ts\u00fckleid (<em>nested loops)\u00a0<\/em>ja leiame kogu korrutustabeli vahemikus 1 &#8211; 10.<\/p>\n<p>M\u00e4rka, et erinevalt tavap\u00e4rasest algavad ts\u00fckliloendurid v\u00e4\u00e4rtusest 1 ja l\u00f5pp-punkt on j\u00e4llegi kaasa arvatud. J\u00e4lgi ka reavahetuse paigutust ning t\u00fchikutega vastuste polsterdamist! M\u00f5tle l\u00e4bi mida ja miks tehakse printf lausetega!<\/p>\n<pre class=\"toolbar:2 lang:default decode:true \">\/**\r\n * File:        mult2.c\r\n * Author:      Risto Heinsar\r\n * Created:     18.01.2023\r\n * Edited:      20.06.2023\r\n *\r\n * Description: Sample code for nested loops, demonstrating how to generate\r\n *              a full multiplication table.\r\n *\/\r\n\r\n#include &lt;stdio.h&gt;\r\n\r\n#define MULT_LIMIT 10\r\n\r\nint main(void)\r\n{\r\n    \/\/ Picking out the value for multiplication\r\n    for (int i = 1; i &lt;= MULT_LIMIT; i++)\r\n    {\r\n        \/\/ Picking out the column value for multiplication\r\n        for (int j = 1; j &lt;= MULT_LIMIT; j++)\r\n        {\r\n            \/\/ Calculate the product\r\n            int product = i * j;\r\n            \r\n            \/\/ Display the product with 3 characters of spacing for alignment\r\n            \/\/ All numbers are printed in the same     \r\n            printf(\"%3d \", product);\r\n        }\r\n        \r\n        \/\/ Reached the end of a line (1 x 10, 2 x 10, etc), print a newline\r\n        printf(\"\\n\");\r\n    }\r\n    return 0;\r\n}\r\n<\/pre>\n<p>&nbsp;<\/p>\n<p>&nbsp;<\/p>\n","protected":false},"excerpt":{"rendered":"<p>J\u00e4rgnevalt koostame kaks programmi erinevate korrutustabeli lahenduste genereerimiseks. N\u00e4ide 1: Korrutustabel kindla teguriga Esimeses n\u00e4iteprogrammis k\u00fcsitakse kasutajalt mis arvule me korrutist soovime genereerida ning korrutustabel luuakse alates v\u00e4\u00e4rtusest 0 kuni v\u00e4\u00e4rtuseni 10, mis on defineeritud makrona MULT_LIMIT . M\u00e4rka, et ts\u00fckli tingimuses on v\u00f5rdluseks &lt;=\u00a0 ehk otspunkt on kaasa arvatud &#8211; enamasti me otspunkte ei &hellip; <a href=\"https:\/\/blue.pri.ee\/ttu\/programmeerimine-i\/koodinaited\/tsuklid-korrutustabel\/\" class=\"more-link\">Loe edasi <span class=\"screen-reader-text\">Ts\u00fcklid &#8211; korrutustabel<\/span> <span class=\"meta-nav\">&rarr;<\/span><\/a><\/p>\n","protected":false},"author":1,"featured_media":0,"parent":32,"menu_order":4,"comment_status":"closed","ping_status":"closed","template":"page-templates\/code-width-wide.php","meta":{"footnotes":""},"class_list":["post-8006","page","type-page","status-publish","hentry"],"_links":{"self":[{"href":"https:\/\/blue.pri.ee\/ttu\/wp-json\/wp\/v2\/pages\/8006","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/blue.pri.ee\/ttu\/wp-json\/wp\/v2\/pages"}],"about":[{"href":"https:\/\/blue.pri.ee\/ttu\/wp-json\/wp\/v2\/types\/page"}],"author":[{"embeddable":true,"href":"https:\/\/blue.pri.ee\/ttu\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/blue.pri.ee\/ttu\/wp-json\/wp\/v2\/comments?post=8006"}],"version-history":[{"count":7,"href":"https:\/\/blue.pri.ee\/ttu\/wp-json\/wp\/v2\/pages\/8006\/revisions"}],"predecessor-version":[{"id":10621,"href":"https:\/\/blue.pri.ee\/ttu\/wp-json\/wp\/v2\/pages\/8006\/revisions\/10621"}],"up":[{"embeddable":true,"href":"https:\/\/blue.pri.ee\/ttu\/wp-json\/wp\/v2\/pages\/32"}],"wp:attachment":[{"href":"https:\/\/blue.pri.ee\/ttu\/wp-json\/wp\/v2\/media?parent=8006"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}