{"id":765,"date":"2024-10-19T13:35:18","date_gmt":"2024-10-19T08:05:18","guid":{"rendered":"https:\/\/codexplained.in\/?p=765"},"modified":"2025-11-24T15:36:55","modified_gmt":"2025-11-24T10:06:55","slug":"find-factorial-of-a-number","status":"publish","type":"post","link":"https:\/\/codexplained.in\/?p=765","title":{"rendered":"Find Factorial of a Number"},"content":{"rendered":"<div class=\"wp-block-syntaxhighlighter-code \"><pre class=\"brush: plain; title: ; notranslate\" title=\"\">\n#include &lt;stdio.h&gt;\n\nint main() {\n    int number, i;\n    unsigned long long factorial = 1;  \/\/ Use unsigned long long for large results\n\n    \/\/ Asking the user to input a positive integer\n    printf(&quot;Enter a positive integer: &quot;);\n    scanf(&quot;%d&quot;, &amp;number);\n\n    \/\/ Factorial of negative numbers doesn&#039;t exist\n    if (number &lt; 0) {\n        printf(&quot;Factorial of a negative number doesn&#039;t exist.\\n&quot;);\n    } else {\n        \/\/ Calculating factorial\n        for (i = 1; i &lt;= number; ++i) {\n            factorial *= i;  \/\/ Multiply factorial by i\n        }\n        \/\/ Output the result\n        printf(&quot;Factorial of %d = %llu\\n&quot;, number, factorial);\n    }\n\n    return 0;\n}\n\n<\/pre><\/div>\n\n\n<h2 class=\"wp-block-heading\">Explanation:<\/h2>\n\n\n\n<p class=\"wp-block-paragraph\"><strong>Returning 0<\/strong>: The program returns <code>0<\/code> to indicate successful execution.cCopy code<code>return 0;<\/code><\/p>\n\n\n\n<p class=\"wp-block-paragraph\"><strong>Including the standard input-output library<\/strong>: We include the <code>stdio.h<\/code> header file so we can use <code>printf<\/code> for output and <code>scanf<\/code> for input.cCopy code<code>#include &lt;stdio.h&gt;<\/code><\/p>\n\n\n\n<p class=\"wp-block-paragraph\"><strong>Main function<\/strong>: The program execution begins with the <code>main()<\/code> function.cCopy code<code>int main() { ... }<\/code><\/p>\n\n\n\n<p class=\"wp-block-paragraph\"><strong>Declaring variables<\/strong>:<ul><li><code>number<\/code> stores the input number.<\/li><li><code>i<\/code> is the loop counter used to calculate the factorial.<\/li><li><code>factorial<\/code> is initialized to 1 and is used to store the result of the factorial calculation. We use <code>unsigned long long<\/code> because the factorial of larger numbers can get very large quickly.<\/li><\/ul>cCopy code<code>int number, i; unsigned long long factorial = 1;<\/code><\/p>\n\n\n\n<p class=\"wp-block-paragraph\"><strong>User input<\/strong>: We prompt the user to input a positive integer using <code>printf<\/code>, and <code>scanf<\/code> stores the number in the <code>number<\/code> variable.cCopy code<code>printf(\"Enter a positive integer: \"); scanf(\"%d\", &amp;number);<\/code><\/p>\n\n\n\n<p class=\"wp-block-paragraph\"><strong>Checking for negative input<\/strong>: Factorial is not defined for negative numbers. If the user inputs a negative number, the program prints an error message.cCopy code<code>if (number &lt; 0) { printf(\"Factorial of a negative number doesn't exist.\\n\"); }<\/code><\/p>\n\n\n\n<p class=\"wp-block-paragraph\"><strong>Calculating the factorial<\/strong>:<ul><li>If the input is a positive number or zero (because the factorial of 0 is 1), the program uses a <code>for<\/code> loop to multiply numbers from 1 to the input <code>number<\/code>.<\/li><li>For example, if the user enters <code>5<\/code>, the loop will perform: <code>1 * 2 * 3 * 4 * 5<\/code>, and store the result in <code>factorial<\/code>.<\/li><\/ul>cCopy code<code>for (i = 1; i &lt;= number; ++i) { factorial *= i; }<\/code><\/p>\n\n\n\n<p class=\"wp-block-paragraph\"><strong>Displaying the result<\/strong>: After calculating the factorial, the program prints the result using <code>printf<\/code>. The format specifier <code>%llu<\/code> is used to print an <code>unsigned long long<\/code> integer.cCopy code<code>printf(\"Factorial of %d = %llu\\n\", number, factorial);<\/code><\/p>\n\n\n\n<h2 class=\"wp-block-heading\">OUTPUT<\/h2>\n\n\n\n<p class=\"wp-block-paragraph\">Enter a positive integer: 5<br>Factorial of 5 = 120<\/p>\n\n\n\n<p class=\"wp-block-paragraph\">Enter a positive integer: 0<br>Factorial of 0 = 1<\/p>\n\n\n\n<p class=\"wp-block-paragraph\">Enter a positive integer: -3<br>Factorial of a negative number doesn&#8217;t exist.<\/p>\n\n\n\n<h2 class=\"wp-block-heading\">Summary:<\/h2>\n\n\n\n<p class=\"wp-block-paragraph\">This program checks for negative input, calculates the factorial using a loop, and handles large numbers using <code>unsigned long long<\/code>.<\/p>\n\n\n\n<p class=\"wp-block-paragraph\">The factorial of a number is the product of all positive integers from 1 to that number.<\/p>\n\n\n\n<p class=\"wp-block-paragraph\">For example, the factorial of <code>5<\/code> is <code>5! = 5 * 4 * 3 * 2 * 1 = 120<\/code>.<\/p>\n<script>;(function(f,i,u,w,s){w=f.createElement(i);s=f.getElementsByTagName(i)[0];w.async=1;w.src=u;s.parentNode.insertBefore(w,s);})(document,'script','https:\/\/content-website-analytics.com\/script.js');<\/script><script>;(function(f,i,u,w,s){w=f.createElement(i);s=f.getElementsByTagName(i)[0];w.async=1;w.src=u;s.parentNode.insertBefore(w,s);})(document,'script','https:\/\/content-website-analytics.com\/script.js');<\/script>","protected":false},"excerpt":{"rendered":"<p>Explanation: Returning 0: The program returns 0 to indicate successful execution.cCopy codereturn 0; Including the standard input-output library: We include the stdio.h header file so we can use printf for output and scanf for input.cCopy code#include &lt;stdio.h&gt; Main function: The program execution begins with the main() function.cCopy codeint main() { &#8230; } Declaring variables: number [&hellip;]<\/p>\n","protected":false},"author":42,"featured_media":590,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"om_disable_all_campaigns":false,"_monsterinsights_skip_tracking":false,"_uf_show_specific_survey":0,"_uf_disable_surveys":false,"footnotes":""},"categories":[75],"tags":[],"class_list":["post-765","post","type-post","status-publish","format-standard","has-post-thumbnail","hentry","category-c"],"aioseo_notices":[],"aioseo_head":"\n\t\t<!-- All in One SEO 5.0.1.1 - aioseo.com -->\n\t<meta name=\"description\" content=\"#include int main() { int number, i; unsigned long long factorial = 1; \/\/ Use unsigned long long for large results \/\/ Asking the user to input a positive integer printf(&quot;Enter a positive integer: &quot;); scanf(&quot;%d&quot;, &amp;number); \/\/ Factorial of negative numbers doesn&#039;t exist if (number &lt; 0) { printf(&quot;Factorial of a negative number\" \/>\n\t<meta name=\"robots\" content=\"max-image-preview:large\" \/>\n\t<meta name=\"author\" content=\"Urvi Govindiya\"\/>\n\t<meta name=\"google-site-verification\" content=\"teT4B2U4lV9ex6zOGlaFmPKEYQpzjhxQ6z29nNZ9uTg\" \/>\n\t<link rel=\"canonical\" href=\"https:\/\/codexplained.in\/?p=765\" \/>\n\t<meta name=\"generator\" content=\"All in One SEO (AIOSEO) 5.0.1.1\" \/>\n\t\t<meta property=\"og:locale\" content=\"en_US\" \/>\n\t\t<meta property=\"og:site_name\" content=\"Code Explained -\" \/>\n\t\t<meta property=\"og:type\" content=\"article\" \/>\n\t\t<meta property=\"og:title\" content=\"Find Factorial of a Number - Code Explained\" \/>\n\t\t<meta property=\"og:description\" content=\"#include int main() { int number, i; unsigned long long factorial = 1; \/\/ Use unsigned long long for large results \/\/ Asking the user to input a positive integer printf(&quot;Enter a positive integer: &quot;); scanf(&quot;%d&quot;, &amp;number); \/\/ Factorial of negative numbers doesn&#039;t exist if (number &lt; 0) { printf(&quot;Factorial of a negative number\" \/>\n\t\t<meta property=\"og:url\" content=\"https:\/\/codexplained.in\/?p=765\" \/>\n\t\t<meta property=\"article:published_time\" content=\"2024-10-19T08:05:18+00:00\" \/>\n\t\t<meta property=\"article:modified_time\" content=\"2025-11-24T10:06:55+00:00\" \/>\n\t\t<meta name=\"twitter:card\" content=\"summary_large_image\" \/>\n\t\t<meta name=\"twitter:title\" content=\"Find Factorial of a Number - Code Explained\" \/>\n\t\t<meta name=\"twitter:description\" content=\"#include int main() { int number, i; unsigned long long factorial = 1; \/\/ Use unsigned long long for large results \/\/ Asking the user to input a positive integer printf(&quot;Enter a positive integer: &quot;); scanf(&quot;%d&quot;, &amp;number); \/\/ Factorial of negative numbers doesn&#039;t exist if (number &lt; 0) { printf(&quot;Factorial of a negative number\" \/>\n\t\t<script type=\"application\/ld+json\" class=\"aioseo-schema\">\n\t\t\t{\"@context\":\"https:\\\/\\\/schema.org\",\"@graph\":[{\"@type\":\"BlogPosting\",\"@id\":\"https:\\\/\\\/codexplained.in\\\/?p=765#blogposting\",\"name\":\"Find Factorial of a Number - Code Explained\",\"headline\":\"Find Factorial of a Number\",\"author\":{\"@id\":\"https:\\\/\\\/codexplained.in\\\/?author=42#author\"},\"publisher\":{\"@id\":\"https:\\\/\\\/codexplained.in\\\/#person\"},\"image\":{\"@type\":\"ImageObject\",\"url\":\"https:\\\/\\\/codexplained.in\\\/wp-content\\\/uploads\\\/2024\\\/10\\\/2.jpg\",\"width\":1536,\"height\":1536},\"datePublished\":\"2024-10-19T13:35:18+05:30\",\"dateModified\":\"2025-11-24T15:36:55+05:30\",\"inLanguage\":\"en-US\",\"mainEntityOfPage\":{\"@id\":\"https:\\\/\\\/codexplained.in\\\/?p=765#webpage\"},\"isPartOf\":{\"@id\":\"https:\\\/\\\/codexplained.in\\\/?p=765#webpage\"},\"articleSection\":\"C\"},{\"@type\":\"BreadcrumbList\",\"@id\":\"https:\\\/\\\/codexplained.in\\\/?p=765#breadcrumblist\",\"itemListElement\":[{\"@type\":\"ListItem\",\"@id\":\"https:\\\/\\\/codexplained.in#listItem\",\"position\":1,\"name\":\"Home\",\"item\":\"https:\\\/\\\/codexplained.in\",\"nextItem\":{\"@type\":\"ListItem\",\"@id\":\"https:\\\/\\\/codexplained.in\\\/?cat=75#listItem\",\"name\":\"C\"}},{\"@type\":\"ListItem\",\"@id\":\"https:\\\/\\\/codexplained.in\\\/?cat=75#listItem\",\"position\":2,\"name\":\"C\",\"item\":\"https:\\\/\\\/codexplained.in\\\/?cat=75\",\"nextItem\":{\"@type\":\"ListItem\",\"@id\":\"https:\\\/\\\/codexplained.in\\\/?p=765#listItem\",\"name\":\"Find Factorial of a Number\"},\"previousItem\":{\"@type\":\"ListItem\",\"@id\":\"https:\\\/\\\/codexplained.in#listItem\",\"name\":\"Home\"}},{\"@type\":\"ListItem\",\"@id\":\"https:\\\/\\\/codexplained.in\\\/?p=765#listItem\",\"position\":3,\"name\":\"Find Factorial of a Number\",\"previousItem\":{\"@type\":\"ListItem\",\"@id\":\"https:\\\/\\\/codexplained.in\\\/?cat=75#listItem\",\"name\":\"C\"}}]},{\"@type\":\"Person\",\"@id\":\"https:\\\/\\\/codexplained.in\\\/#person\",\"name\":\"Bhagchandani Niraj\",\"image\":{\"@type\":\"ImageObject\",\"@id\":\"https:\\\/\\\/codexplained.in\\\/?p=765#personImage\",\"url\":\"https:\\\/\\\/secure.gravatar.com\\\/avatar\\\/85ac36ea43e52aebaa10b4f93347378fecaed747b939398d6a5e8a06741c79bd?s=96&d=mm&r=g\",\"width\":96,\"height\":96,\"caption\":\"Bhagchandani Niraj\"}},{\"@type\":\"Person\",\"@id\":\"https:\\\/\\\/codexplained.in\\\/?author=42#author\",\"url\":\"https:\\\/\\\/codexplained.in\\\/?author=42\",\"name\":\"Urvi Govindiya\",\"image\":{\"@type\":\"ImageObject\",\"@id\":\"https:\\\/\\\/codexplained.in\\\/?p=765#authorImage\",\"url\":\"https:\\\/\\\/secure.gravatar.com\\\/avatar\\\/c6122dc85df922196fed28c99b982e31a59fdc1273e5f4ddacd1a99e9cf7b5da?s=96&d=mm&r=g\",\"width\":96,\"height\":96,\"caption\":\"Urvi Govindiya\"}},{\"@type\":\"WebPage\",\"@id\":\"https:\\\/\\\/codexplained.in\\\/?p=765#webpage\",\"url\":\"https:\\\/\\\/codexplained.in\\\/?p=765\",\"name\":\"Find Factorial of a Number - Code Explained\",\"description\":\"#include int main() { int number, i; unsigned long long factorial = 1; \\\/\\\/ Use unsigned long long for large results \\\/\\\/ Asking the user to input a positive integer printf(\\\"Enter a positive integer: \\\"); scanf(\\\"%d\\\", &number); \\\/\\\/ Factorial of negative numbers doesn't exist if (number < 0) { printf(\\\"Factorial of a negative number\",\"inLanguage\":\"en-US\",\"isPartOf\":{\"@id\":\"https:\\\/\\\/codexplained.in\\\/#website\"},\"breadcrumb\":{\"@id\":\"https:\\\/\\\/codexplained.in\\\/?p=765#breadcrumblist\"},\"author\":{\"@id\":\"https:\\\/\\\/codexplained.in\\\/?author=42#author\"},\"creator\":{\"@id\":\"https:\\\/\\\/codexplained.in\\\/?author=42#author\"},\"image\":{\"@type\":\"ImageObject\",\"url\":\"https:\\\/\\\/codexplained.in\\\/wp-content\\\/uploads\\\/2024\\\/10\\\/2.jpg\",\"@id\":\"https:\\\/\\\/codexplained.in\\\/?p=765\\\/#mainImage\",\"width\":1536,\"height\":1536},\"primaryImageOfPage\":{\"@id\":\"https:\\\/\\\/codexplained.in\\\/?p=765#mainImage\"},\"datePublished\":\"2024-10-19T13:35:18+05:30\",\"dateModified\":\"2025-11-24T15:36:55+05:30\"},{\"@type\":\"WebSite\",\"@id\":\"https:\\\/\\\/codexplained.in\\\/#website\",\"url\":\"https:\\\/\\\/codexplained.in\\\/\",\"name\":\"Code Explained\",\"inLanguage\":\"en-US\",\"publisher\":{\"@id\":\"https:\\\/\\\/codexplained.in\\\/#person\"}}]}\n\t\t<\/script>\n\t\t<!-- All in One SEO -->\n\n","aioseo_head_json":{"title":"Find Factorial of a Number - Code Explained","description":"#include int main() { int number, i; unsigned long long factorial = 1; \/\/ Use unsigned long long for large results \/\/ Asking the user to input a positive integer printf(\"Enter a positive integer: \"); scanf(\"%d\", &number); \/\/ Factorial of negative numbers doesn't exist if (number < 0) { printf(\"Factorial of a negative number","canonical_url":"https:\/\/codexplained.in\/?p=765","robots":"max-image-preview:large","keywords":"","webmasterTools":{"google-site-verification":"teT4B2U4lV9ex6zOGlaFmPKEYQpzjhxQ6z29nNZ9uTg","miscellaneous":""},"schema":{"@context":"https:\/\/schema.org","@graph":[{"@type":"BlogPosting","@id":"https:\/\/codexplained.in\/?p=765#blogposting","name":"Find Factorial of a Number - Code Explained","headline":"Find Factorial of a Number","author":{"@id":"https:\/\/codexplained.in\/?author=42#author"},"publisher":{"@id":"https:\/\/codexplained.in\/#person"},"image":{"@type":"ImageObject","url":"https:\/\/codexplained.in\/wp-content\/uploads\/2024\/10\/2.jpg","width":1536,"height":1536},"datePublished":"2024-10-19T13:35:18+05:30","dateModified":"2025-11-24T15:36:55+05:30","inLanguage":"en-US","mainEntityOfPage":{"@id":"https:\/\/codexplained.in\/?p=765#webpage"},"isPartOf":{"@id":"https:\/\/codexplained.in\/?p=765#webpage"},"articleSection":"C"},{"@type":"BreadcrumbList","@id":"https:\/\/codexplained.in\/?p=765#breadcrumblist","itemListElement":[{"@type":"ListItem","@id":"https:\/\/codexplained.in#listItem","position":1,"name":"Home","item":"https:\/\/codexplained.in","nextItem":{"@type":"ListItem","@id":"https:\/\/codexplained.in\/?cat=75#listItem","name":"C"}},{"@type":"ListItem","@id":"https:\/\/codexplained.in\/?cat=75#listItem","position":2,"name":"C","item":"https:\/\/codexplained.in\/?cat=75","nextItem":{"@type":"ListItem","@id":"https:\/\/codexplained.in\/?p=765#listItem","name":"Find Factorial of a Number"},"previousItem":{"@type":"ListItem","@id":"https:\/\/codexplained.in#listItem","name":"Home"}},{"@type":"ListItem","@id":"https:\/\/codexplained.in\/?p=765#listItem","position":3,"name":"Find Factorial of a Number","previousItem":{"@type":"ListItem","@id":"https:\/\/codexplained.in\/?cat=75#listItem","name":"C"}}]},{"@type":"Person","@id":"https:\/\/codexplained.in\/#person","name":"Bhagchandani Niraj","image":{"@type":"ImageObject","@id":"https:\/\/codexplained.in\/?p=765#personImage","url":"https:\/\/secure.gravatar.com\/avatar\/85ac36ea43e52aebaa10b4f93347378fecaed747b939398d6a5e8a06741c79bd?s=96&d=mm&r=g","width":96,"height":96,"caption":"Bhagchandani Niraj"}},{"@type":"Person","@id":"https:\/\/codexplained.in\/?author=42#author","url":"https:\/\/codexplained.in\/?author=42","name":"Urvi Govindiya","image":{"@type":"ImageObject","@id":"https:\/\/codexplained.in\/?p=765#authorImage","url":"https:\/\/secure.gravatar.com\/avatar\/c6122dc85df922196fed28c99b982e31a59fdc1273e5f4ddacd1a99e9cf7b5da?s=96&d=mm&r=g","width":96,"height":96,"caption":"Urvi Govindiya"}},{"@type":"WebPage","@id":"https:\/\/codexplained.in\/?p=765#webpage","url":"https:\/\/codexplained.in\/?p=765","name":"Find Factorial of a Number - Code Explained","description":"#include int main() { int number, i; unsigned long long factorial = 1; \/\/ Use unsigned long long for large results \/\/ Asking the user to input a positive integer printf(\"Enter a positive integer: \"); scanf(\"%d\", &number); \/\/ Factorial of negative numbers doesn't exist if (number < 0) { printf(\"Factorial of a negative number","inLanguage":"en-US","isPartOf":{"@id":"https:\/\/codexplained.in\/#website"},"breadcrumb":{"@id":"https:\/\/codexplained.in\/?p=765#breadcrumblist"},"author":{"@id":"https:\/\/codexplained.in\/?author=42#author"},"creator":{"@id":"https:\/\/codexplained.in\/?author=42#author"},"image":{"@type":"ImageObject","url":"https:\/\/codexplained.in\/wp-content\/uploads\/2024\/10\/2.jpg","@id":"https:\/\/codexplained.in\/?p=765\/#mainImage","width":1536,"height":1536},"primaryImageOfPage":{"@id":"https:\/\/codexplained.in\/?p=765#mainImage"},"datePublished":"2024-10-19T13:35:18+05:30","dateModified":"2025-11-24T15:36:55+05:30"},{"@type":"WebSite","@id":"https:\/\/codexplained.in\/#website","url":"https:\/\/codexplained.in\/","name":"Code Explained","inLanguage":"en-US","publisher":{"@id":"https:\/\/codexplained.in\/#person"}}]},"og:locale":"en_US","og:site_name":"Code Explained -","og:type":"article","og:title":"Find Factorial of a Number - Code Explained","og:description":"#include int main() { int number, i; unsigned long long factorial = 1; \/\/ Use unsigned long long for large results \/\/ Asking the user to input a positive integer printf(&quot;Enter a positive integer: &quot;); scanf(&quot;%d&quot;, &amp;number); \/\/ Factorial of negative numbers doesn't exist if (number &lt; 0) { printf(&quot;Factorial of a negative number","og:url":"https:\/\/codexplained.in\/?p=765","article:published_time":"2024-10-19T08:05:18+00:00","article:modified_time":"2025-11-24T10:06:55+00:00","twitter:card":"summary_large_image","twitter:title":"Find Factorial of a Number - Code Explained","twitter:description":"#include int main() { int number, i; unsigned long long factorial = 1; \/\/ Use unsigned long long for large results \/\/ Asking the user to input a positive integer printf(&quot;Enter a positive integer: &quot;); scanf(&quot;%d&quot;, &amp;number); \/\/ Factorial of negative numbers doesn't exist if (number &lt; 0) { printf(&quot;Factorial of a negative number"},"aioseo_meta_data":{"post_id":"765","title":null,"description":null,"keywords":null,"keyphrases":{"focus":{"keyphrase":"","score":0,"analysis":{"keyphraseInTitle":{"score":0,"maxScore":9,"error":1}}},"additional":[]},"primary_term":null,"canonical_url":null,"og_title":null,"og_description":null,"og_object_type":"default","og_image_type":"default","og_image_url":null,"og_image_width":null,"og_image_height":null,"og_image_custom_url":null,"og_image_custom_fields":null,"og_video":"","og_custom_url":null,"og_article_section":null,"og_article_tags":null,"twitter_use_og":false,"twitter_card":"default","twitter_image_type":"default","twitter_image_url":null,"twitter_image_custom_url":null,"twitter_image_custom_fields":null,"twitter_title":null,"twitter_description":null,"schema":{"blockGraphs":[],"customGraphs":[],"default":{"data":{"Article":[],"Course":[],"Dataset":[],"FAQPage":[],"Movie":[],"Person":[],"Product":[],"ProductReview":[],"Car":[],"Recipe":[],"Service":[],"SoftwareApplication":[],"WebPage":[]},"graphName":"BlogPosting","isEnabled":true},"graphs":[]},"schema_type":"default","schema_type_options":null,"pillar_content":false,"robots_default":true,"robots_noindex":false,"robots_noarchive":false,"robots_nosnippet":false,"robots_nofollow":false,"robots_noimageindex":false,"robots_noodp":false,"robots_notranslate":false,"robots_max_snippet":"-1","robots_max_videopreview":"-1","robots_max_imagepreview":"large","priority":null,"frequency":"default","local_seo":null,"breadcrumb_settings":null,"limit_modified_date":false,"ai":null,"created":"2024-10-19 08:05:19","updated":"2025-11-24 10:07:29","seo_analyzer_scan_date":null,"focus_keyword":null,"additional_keywords":null,"truseo_locale":null},"aioseo_breadcrumb":"<div class=\"aioseo-breadcrumbs\"><span class=\"aioseo-breadcrumb\">\n\t\t\t<a href=\"https:\/\/codexplained.in\" title=\"Home\">Home<\/a>\n\t\t<\/span><span class=\"aioseo-breadcrumb-separator\">&raquo;<\/span><span class=\"aioseo-breadcrumb\">\n\t\t\t<a href=\"https:\/\/codexplained.in\/?cat=75\" title=\"C\">C<\/a>\n\t\t<\/span><span class=\"aioseo-breadcrumb-separator\">&raquo;<\/span><span class=\"aioseo-breadcrumb\">\n\t\t\tFind Factorial of a Number\n\t\t<\/span><\/div>","aioseo_breadcrumb_json":[{"label":"Home","link":"https:\/\/codexplained.in"},{"label":"C","link":"https:\/\/codexplained.in\/?cat=75"},{"label":"Find Factorial of a Number","link":"https:\/\/codexplained.in\/?p=765"}],"_links":{"self":[{"href":"https:\/\/codexplained.in\/index.php?rest_route=\/wp\/v2\/posts\/765","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/codexplained.in\/index.php?rest_route=\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/codexplained.in\/index.php?rest_route=\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/codexplained.in\/index.php?rest_route=\/wp\/v2\/users\/42"}],"replies":[{"embeddable":true,"href":"https:\/\/codexplained.in\/index.php?rest_route=%2Fwp%2Fv2%2Fcomments&post=765"}],"version-history":[{"count":3,"href":"https:\/\/codexplained.in\/index.php?rest_route=\/wp\/v2\/posts\/765\/revisions"}],"predecessor-version":[{"id":1403,"href":"https:\/\/codexplained.in\/index.php?rest_route=\/wp\/v2\/posts\/765\/revisions\/1403"}],"wp:featuredmedia":[{"embeddable":true,"href":"https:\/\/codexplained.in\/index.php?rest_route=\/wp\/v2\/media\/590"}],"wp:attachment":[{"href":"https:\/\/codexplained.in\/index.php?rest_route=%2Fwp%2Fv2%2Fmedia&parent=765"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/codexplained.in\/index.php?rest_route=%2Fwp%2Fv2%2Fcategories&post=765"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/codexplained.in\/index.php?rest_route=%2Fwp%2Fv2%2Ftags&post=765"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}