{"id":5650,"date":"2022-02-12T23:05:00","date_gmt":"2022-02-12T17:35:00","guid":{"rendered":"https:\/\/www.codingbroz.com\/?p=5650"},"modified":"2022-02-12T15:51:26","modified_gmt":"2022-02-12T10:21:26","slug":"cpp-program-to-find-gcd-of-two-numbers","status":"publish","type":"post","link":"https:\/\/www.codingbroz.com\/cpp-program-to-find-gcd-of-two-numbers\/","title":{"rendered":"C++ Program to Find GCD of Two Numbers"},"content":{"rendered":"\n<p>In this post, we will learn <strong>how to find the GCD of two numbers using C++<\/strong> Programming language.<\/p>\n\n\n\n<p>The <strong>greatest common divisor (GCD)<\/strong> of two nonzero integers &#8216;<strong>a<\/strong>&#8216; and &#8216;<strong>b<\/strong>&#8216; is the greatest positive integer &#8216;<strong>d<\/strong>&#8216; such that <strong>d<\/strong> is a divisor of both &#8216;<strong>a<\/strong>&#8216; and &#8216;<strong>b<\/strong>&#8216;. The GCD of &#8216;<strong>a<\/strong>&#8216; and &#8216;<strong>b<\/strong>&#8216; is denoted by <strong>gcd(a, b)<\/strong>. For example: The GCD of <strong>6<\/strong> and <strong>9<\/strong> is <strong>3<\/strong>.<\/p>\n\n\n\n<p>We will calculate the gcd of two numbers using the following approaches:<\/p>\n\n\n\n<ol><li>Using For Loop&nbsp;<\/li><li>Using While Loop<\/li><\/ol>\n\n\n\n<p>So, without further ado, let\u2019s begin this tutorial.<\/p>\n\n\n\n<div id=\"ez-toc-container\" class=\"ez-toc-v2_0_65 ez-toc-wrap-left counter-hierarchy ez-toc-counter ez-toc-custom ez-toc-container-direction\">\n<label for=\"ez-toc-cssicon-toggle-item-662d47afd6684\" class=\"ez-toc-cssicon-toggle-label\"><label class=\"ez-toc-title\">Table of Contents<\/label>\n<span class=\"ez-toc-cssicon\"><span class=\"eztoc-hide\" style=\"display:none;\">Toggle<\/span><span class=\"ez-toc-icon-toggle-span\"><svg style=\"fill: #0090ff;color:#0090ff\" 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: #0090ff;color:#0090ff\" 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><\/label><input type=\"checkbox\"  id=\"ez-toc-cssicon-toggle-item-662d47afd6684\" checked \/><nav><ul class='ez-toc-list ez-toc-list-level-1 ' ><li class='ez-toc-page-1 ez-toc-heading-level-2'><a class=\"ez-toc-link ez-toc-heading-1\" href=\"https:\/\/www.codingbroz.com\/cpp-program-to-find-gcd-of-two-numbers\/#C_Program_to_Find_GCD_of_Two_Numbers\" title=\"C++ Program to Find GCD of Two Numbers\">C++ Program to Find GCD of Two Numbers<\/a><\/li><li class='ez-toc-page-1 ez-toc-heading-level-2'><a class=\"ez-toc-link ez-toc-heading-2\" href=\"https:\/\/www.codingbroz.com\/cpp-program-to-find-gcd-of-two-numbers\/#How_Does_This_Program_Work\" title=\"How Does This Program Work ?\">How Does This Program Work ?<\/a><\/li><li class='ez-toc-page-1 ez-toc-heading-level-2'><a class=\"ez-toc-link ez-toc-heading-3\" href=\"https:\/\/www.codingbroz.com\/cpp-program-to-find-gcd-of-two-numbers\/#C_Program_to_Find_GCD_of_Two_Numbers_Using_While_Loop\" title=\"C++ Program to Find GCD of Two Numbers Using While Loop\">C++ Program to Find GCD of Two Numbers Using While Loop<\/a><\/li><li class='ez-toc-page-1 ez-toc-heading-level-2'><a class=\"ez-toc-link ez-toc-heading-4\" href=\"https:\/\/www.codingbroz.com\/cpp-program-to-find-gcd-of-two-numbers\/#Conclusion\" title=\"Conclusion\">Conclusion<\/a><\/li><\/ul><\/nav><\/div>\n<h2 class=\"wp-block-heading\" id=\"c-program-to-find-gcd-of-two-numbers\"><span class=\"ez-toc-section\" id=\"C_Program_to_Find_GCD_of_Two_Numbers\"><\/span><strong>C++ Program to Find GCD of Two Numbers<\/strong><span class=\"ez-toc-section-end\"><\/span><\/h2>\n\n\n\n<pre class=\"EnlighterJSRAW\" data-enlighter-language=\"cpp\" data-enlighter-theme=\"\" data-enlighter-highlight=\"\" data-enlighter-linenumbers=\"\" data-enlighter-lineoffset=\"\" data-enlighter-title=\"\" data-enlighter-group=\"\">\/\/ C++ Program to Find GCD of Two Numbers\n#include &lt;iostream>\nusing namespace std;\n\nint main(){\n    int a, b, gcd;\n    \n    \/\/ Asking for input\n    cout &lt;&lt; \"Enter the first number: \";\n    cin >> a;\n    cout &lt;&lt; \"Enter the second number: \";\n    cin >> b;\n    \n    \/\/ Calculating gcd of two numbers\n    for (int i = 1; i &lt;= a &amp;&amp; i &lt;= b; i++){\n        if (a % i == 0 &amp;&amp; b % i == 0){\n            gcd = i;\n        }\n    }\n    \n    \/\/ Displaying output\n    cout &lt;&lt; \"GCD of \" &lt;&lt; a &lt;&lt; \" and \" &lt;&lt; b &lt;&lt; \" is: \" &lt;&lt; gcd &lt;&lt; endl;\n    return 0;\n}\n<\/pre>\n\n\n\n<p><strong>Output<\/strong><\/p>\n\n\n\n<pre class=\"wp-block-code\"><code>Enter the first number: 10\r\nEnter the second number: 25\r\nGCD of 10 and 25 is: 5\r<\/code><\/pre>\n\n\n\n<h2 class=\"wp-block-heading\" id=\"how-does-this-program-work\"><span class=\"ez-toc-section\" id=\"How_Does_This_Program_Work\"><\/span><strong>How Does This Program Work ?<\/strong><span class=\"ez-toc-section-end\"><\/span><\/h2>\n\n\n\n<pre class=\"EnlighterJSRAW\" data-enlighter-language=\"cpp\" data-enlighter-theme=\"\" data-enlighter-highlight=\"\" data-enlighter-linenumbers=\"\" data-enlighter-lineoffset=\"\" data-enlighter-title=\"\" data-enlighter-group=\"\">    int a, b, gcd;\n<\/pre>\n\n\n\n<p>In this program, we have declared<strong> three integer data type<\/strong> variables named <strong>a<\/strong>, <strong>b<\/strong> and <strong>gcd<\/strong>.<\/p>\n\n\n\n<pre class=\"EnlighterJSRAW\" data-enlighter-language=\"cpp\" data-enlighter-theme=\"\" data-enlighter-highlight=\"\" data-enlighter-linenumbers=\"\" data-enlighter-lineoffset=\"\" data-enlighter-title=\"\" data-enlighter-group=\"\">    \/\/ Asking for input\n    cout &lt;&lt; \"Enter the first number: \";\n    cin >> a;\n    cout &lt;&lt; \"Enter the second number: \";\n    cin >> b;\n<\/pre>\n\n\n\n<p>The user is asked to enter two numbers.<\/p>\n\n\n\n<pre class=\"EnlighterJSRAW\" data-enlighter-language=\"cpp\" data-enlighter-theme=\"\" data-enlighter-highlight=\"\" data-enlighter-linenumbers=\"\" data-enlighter-lineoffset=\"\" data-enlighter-title=\"\" data-enlighter-group=\"\">    \/\/ Calculating gcd of two numbers\n    for (int i = 1; i &lt;= a &amp;&amp; i &lt;= b; i++){\n        if (a % i == 0 &amp;&amp; b % i == 0){\n            gcd = i;\n        }\n    }\n<\/pre>\n\n\n\n<p>We used <strong>for loop<\/strong> to calculate the gcd of two numbers. If the iteration of <em><strong>i<\/strong><\/em> is divisible by both first number as well as second number, then it is a factor of both numbers.<\/p>\n\n\n\n<p>The value of <strong>i<\/strong> keeps increasing until it is equal to either &#8216;<strong>a<\/strong>&#8216; or &#8216;<strong>b<\/strong>&#8216;. The highest factor computed is the gcd of two numbers. The GCD of two numbers gets stored in the <strong>gcd<\/strong> named variable.<\/p>\n\n\n\n<pre class=\"EnlighterJSRAW\" data-enlighter-language=\"cpp\" data-enlighter-theme=\"\" data-enlighter-highlight=\"\" data-enlighter-linenumbers=\"\" data-enlighter-lineoffset=\"\" data-enlighter-title=\"\" data-enlighter-group=\"\">    \/\/ Displaying output\n    cout &lt;&lt; \"GCD of \" &lt;&lt; a &lt;&lt; \" and \" &lt;&lt; b &lt;&lt; \" is: \" &lt;&lt; gcd &lt;&lt; endl;\n<\/pre>\n\n\n\n<p>And then the greatest common divisor of &#8216;<strong>a<\/strong>&#8216; and &#8216;<strong>b<\/strong>&#8216; is displayed on the screen using the <strong>cout<\/strong> statement.<\/p>\n\n\n\n<h2 class=\"wp-block-heading\" id=\"c-program-to-find-gcd-of-two-numbers-using-while-loop\"><span class=\"ez-toc-section\" id=\"C_Program_to_Find_GCD_of_Two_Numbers_Using_While_Loop\"><\/span><strong>C++ Program to Find GCD of Two Numbers Using While Loop<\/strong><span class=\"ez-toc-section-end\"><\/span><\/h2>\n\n\n\n<pre class=\"EnlighterJSRAW\" data-enlighter-language=\"cpp\" data-enlighter-theme=\"\" data-enlighter-highlight=\"\" data-enlighter-linenumbers=\"\" data-enlighter-lineoffset=\"\" data-enlighter-title=\"\" data-enlighter-group=\"\">\/\/ C++ Program to Find GCD of Two Numbers Using While Loop\n#include &lt;iostream>\nusing namespace std;\n\nint main(){\n    int a, b, temp, gcd;\n    \n    \/\/ Asking for input\n    cout &lt;&lt; \"Enter the first number: \";\n    cin >> a;\n    cout &lt;&lt; \"Enter the second number: \";\n    cin >> b;\n    \n    \/\/ Calculating gcd using while loop\n    while (b != 0){\n        temp = b;\n        b = a % b;\n        a = temp;\n    }\n    \n    gcd = a;\n    \n    \/\/ Displaying output\n    cout &lt;&lt; \"GCD of two numbers: \" &lt;&lt; gcd;\n    return 0;\n}\n<\/pre>\n\n\n\n<p><strong>Output<\/strong><\/p>\n\n\n\n<pre class=\"wp-block-code\"><code>Enter the first number: 21\r\nEnter the second number: 28\r\nGCD of two numbers: 7\r<\/code><\/pre>\n\n\n\n<h2 class=\"wp-block-heading\" id=\"conclusion\"><span class=\"ez-toc-section\" id=\"Conclusion\"><\/span><strong>Conclusion<\/strong><span class=\"ez-toc-section-end\"><\/span><\/h2>\n\n\n\n<p>I hope after going through this post, you understand <strong>how to find gcd of two numbers using C++<\/strong> Programming language.<\/p>\n\n\n\n<p>If you have any query regarding the post, then feel free to contact us in the comment section. We will be delighted to assist you.<\/p>\n\n\n\n<p><strong>Also Read:<\/strong><\/p>\n\n\n\n<ul><li><strong><a href=\"https:\/\/www.codingbroz.com\/cpp-program-to-print-even-numbers\/\">C++ Program to Print Even Numbers<\/a><\/strong><\/li><li><strong><a href=\"https:\/\/www.codingbroz.com\/cpp-program-to-multiply-two-numbers\/\">C++ Program to Multiply Two Numbers<\/a><\/strong><\/li><li><strong><a href=\"https:\/\/www.codingbroz.com\/cpp-program-to-find-last-digit-of-a-number\/\">C++ Program to Find Last Digit of a Number<\/a><\/strong><\/li><li><strong><a href=\"https:\/\/www.codingbroz.com\/cpp-program-to-find-prime-factors-of-a-number\/\">C++ Program to Find Prime Factors of a Number<\/a><\/strong><\/li><li><strong><a href=\"https:\/\/www.codingbroz.com\/cpp-program-to-find-product-of-digits-of-a-number\/\">C++ Program to Find Product of Digits of a Number<\/a><\/strong><\/li><\/ul>\n","protected":false},"excerpt":{"rendered":"<p>In this post, we will learn how to find the GCD of two numbers using C++ Programming language.<\/p>\n","protected":false},"author":2,"featured_media":0,"comment_status":"open","ping_status":"closed","sticky":false,"template":"","format":"standard","meta":{"site-sidebar-layout":"default","site-content-layout":"","ast-site-content-layout":"","site-content-style":"default","site-sidebar-style":"default","ast-global-header-display":"","ast-banner-title-visibility":"","ast-main-header-display":"","ast-hfb-above-header-display":"","ast-hfb-below-header-display":"","ast-hfb-mobile-header-display":"","site-post-title":"","ast-breadcrumbs-content":"","ast-featured-img":"","footer-sml-layout":"","theme-transparent-header-meta":"","adv-header-id-meta":"","stick-header-meta":"","header-above-stick-meta":"","header-main-stick-meta":"","header-below-stick-meta":"","astra-migrate-meta-layouts":"default","ast-page-background-enabled":"default","ast-page-background-meta":{"desktop":{"background-color":"","background-image":"","background-repeat":"repeat","background-position":"center center","background-size":"auto","background-attachment":"scroll","background-type":"","background-media":"","overlay-type":"","overlay-color":"","overlay-gradient":""},"tablet":{"background-color":"","background-image":"","background-repeat":"repeat","background-position":"center center","background-size":"auto","background-attachment":"scroll","background-type":"","background-media":"","overlay-type":"","overlay-color":"","overlay-gradient":""},"mobile":{"background-color":"","background-image":"","background-repeat":"repeat","background-position":"center center","background-size":"auto","background-attachment":"scroll","background-type":"","background-media":"","overlay-type":"","overlay-color":"","overlay-gradient":""}},"ast-content-background-meta":{"desktop":{"background-color":"var(--ast-global-color-5)","background-image":"","background-repeat":"repeat","background-position":"center center","background-size":"auto","background-attachment":"scroll","background-type":"","background-media":"","overlay-type":"","overlay-color":"","overlay-gradient":""},"tablet":{"background-color":"var(--ast-global-color-5)","background-image":"","background-repeat":"repeat","background-position":"center center","background-size":"auto","background-attachment":"scroll","background-type":"","background-media":"","overlay-type":"","overlay-color":"","overlay-gradient":""},"mobile":{"background-color":"var(--ast-global-color-5)","background-image":"","background-repeat":"repeat","background-position":"center center","background-size":"auto","background-attachment":"scroll","background-type":"","background-media":"","overlay-type":"","overlay-color":"","overlay-gradient":""}},"_jetpack_memberships_contains_paid_content":false,"footnotes":""},"categories":[168,358],"tags":[598,361],"jetpack_sharing_enabled":true,"jetpack_featured_media_url":"","jetpack-related-posts":[],"_links":{"self":[{"href":"https:\/\/www.codingbroz.com\/wp-json\/wp\/v2\/posts\/5650"}],"collection":[{"href":"https:\/\/www.codingbroz.com\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/www.codingbroz.com\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/www.codingbroz.com\/wp-json\/wp\/v2\/users\/2"}],"replies":[{"embeddable":true,"href":"https:\/\/www.codingbroz.com\/wp-json\/wp\/v2\/comments?post=5650"}],"version-history":[{"count":4,"href":"https:\/\/www.codingbroz.com\/wp-json\/wp\/v2\/posts\/5650\/revisions"}],"predecessor-version":[{"id":5655,"href":"https:\/\/www.codingbroz.com\/wp-json\/wp\/v2\/posts\/5650\/revisions\/5655"}],"wp:attachment":[{"href":"https:\/\/www.codingbroz.com\/wp-json\/wp\/v2\/media?parent=5650"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.codingbroz.com\/wp-json\/wp\/v2\/categories?post=5650"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.codingbroz.com\/wp-json\/wp\/v2\/tags?post=5650"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}