From 6639285b7d49e78a8096ab4652a58cbb423f3f8b Mon Sep 17 00:00:00 2001 From: Prakhar Shukla <63443287+tonyStark-Jr@users.noreply.github.com> Date: Mon, 11 Oct 2021 20:58:57 +0530 Subject: [PATCH] Create palindrome-calc --- palindrome-calc | 50 +++++++++++++++++++++++++++++++++++++++++++++++++ 1 file changed, 50 insertions(+) create mode 100644 palindrome-calc diff --git a/palindrome-calc b/palindrome-calc new file mode 100644 index 0000000..77b4644 --- /dev/null +++ b/palindrome-calc @@ -0,0 +1,50 @@ +#include +#include +#include + +void pal_find(int num, int dig); +char programmer[20] = "Prakhar Shukla"; + +int main() +{ + system("cls"); + int greatest_dig; + int dig; + + printf("***************Welcome to Palindromic Calculator Program***************\n\n"); + + printf("Enter the number of digits whose calculation is to be made...\n"); + scanf("%d", &dig); + + greatest_dig = pow((pow(10, dig) - 1), 2); + + pal_find(greatest_dig, dig); + + return 0; +} + +void pal_find(int num, int dig) +{ + int great_num; + char seedha[100], ulta[100]; + for (int i = num; i > 0; i--) + { + sprintf(seedha, "%d", i); + strcpy(ulta, seedha); + strrev(ulta); + + if (strcmp(seedha, ulta) == 0) + { + great_num = i; + for (int j = (pow(10, dig) - 1); j > 0; j--) + { + if (great_num % j == 0 && great_num / j < pow(10, dig)) + { + printf("The greatest number made by product of two %d digit numbers is %d and the two numbers are %d, %d\n", dig, great_num, j, great_num / j); + printf("\nThanks for using this program created by %s", programmer); + exit(0); + } + } + } + } +}