commit f67d0ffd767331b286eb7971d7a41c24624eff9a
parent 1873bfeb25754415d5fd1d0c0e0ac6e733e16bfd
Author: Amit Dutta <amitdutta4255@gmail.com>
Date: Tue, 11 Nov 2025 19:21:47 +0530
new -11112025 _pc011
Diffstat:
2 files changed, 117 insertions(+), 1 deletion(-)
diff --git a/docs/index.html b/docs/index.html
@@ -3992,7 +3992,7 @@ int main()
<div class="flex items-center">
<svg class="w-6 h-6 text-blue-500 mr-4 flex-shrink-0" fill="none" stroke="currentColor" viewBox="0 0 24 24" xmlns="http://www.w3.org/2000/svg"><path stroke-linecap="round" stroke-linejoin="round" stroke-width="2" d="M3 7v10a2 2 0 002 2h14a2 2 0 002-2V9a2 2 0 00-2-2h-6l-2-2H5a2 2 0 00-2 2z"></path></svg>
<span class="font-medium text-gray-800">practice-c</span>
- <span class="ml-2 text-sm text-gray-500">(10 files)</span>
+ <span class="ml-2 text-sm text-gray-500">(11 files)</span>
</div>
<div class="flex items-center space-x-4">
<a href="https://github.com/notamitgamer/bsc/tree/main/practice-c" target="_blank" class="p-1 rounded-full text-gray-500 hover:bg-gray-200 hover:text-gray-800 transition-colors" onclick="event.stopPropagation()" title="View folder on GitHub">
@@ -4439,6 +4439,71 @@ int main()
}</code></pre>
</div>
</li>
+
+ <li>
+ <div class="flex items-center p-3 pl-8 hover:bg-gray-50 transition-colors duration-200">
+ <svg class="w-6 h-6 text-green-500 mr-4 flex-shrink-0" fill="none" stroke="currentColor" viewBox="0 0 24 24" xmlns="http://www.w3.org/2000/svg"><path stroke-linecap="round" stroke-linejoin="round" stroke-width="2" d="M7 21h10a2 2 0 002-2V9.414a1 1 0 00-.293-.707l-5.414-5.414A1 1 0 0012.586 3H7a2 2 0 00-2 2v14a2 2 0 002 2z"></path></svg>
+ <span class="text-gray-700">pc011.c</span>
+ <div class="ml-auto flex items-center space-x-4">
+ <a href="https://github.com/notamitgamer/bsc/blob/main/practice-c/pc011.c" target="_blank" class="p-1 rounded-full text-gray-500 hover:bg-gray-200 hover:text-gray-800 transition-colors" title="View file on GitHub">
+ <svg class="w-6 h-6" fill="currentColor" viewBox="0 0 24 24" aria-hidden="true"><path fill-rule="evenodd" d="M12 2C6.477 2 2 6.477 2 12c0 4.418 2.865 8.168 6.839 9.492.5.092.682-.217.682-.482 0-.237-.009-.868-.014-1.703-2.782.605-3.369-1.343-3.369-1.343-.454-1.158-1.11-1.466-1.11-1.466-.908-.62.069-.608.069-.608 1.003.07 1.531 1.032 1.531 1.032.892 1.53 2.341 1.088 2.91.832.092-.647.35-1.088.636-1.338-2.22-.253-4.555-1.113-4.555-4.951 0-1.093.39-1.988 1.031-2.688-.103-.253-.446-1.272.098-2.65 0 0 .84-.27 2.75 1.026A9.564 9.564 0 0112 6.844c.85.004 1.705.115 2.504.337 1.909-1.296 2.747-1.027 2.747-1.027.546 1.379.203 2.398.1 2.651.64.7 1.03 1.595 1.03 2.688 0 3.848-2.338 4.695-4.566 4.942.359.308.678.92.678 1.855 0 1.338-.012 2.419-.012 2.747 0 .268.18.58.688.482A10.001 10.001 0 0022 12c0-5.523-4.477-10-10-10z" clip-rule="evenodd"></path></svg>
+ </a>
+ <button onclick="showCode('code-practice-c-pc011_c', 'pc011.c')" class="text-green-600 font-semibold text-sm hover:underline">View Code</button>
+ </div>
+ </div>
+ <div id="code-practice-c-pc011_c" class="hidden" data-github-url="https://github.com/notamitgamer/bsc/blob/main/practice-c/pc011.c">
+ <pre><code class="language-c">/* Write a C program that takes two positive integers, L (Lower Bound)
+and U (Upper Bound), as input from the user. The program must find and print
+the count of all numbers between L and U (inclusive) that
+are also a Palindrome Number. */
+/* Author - Amit Dutta, Date - 11th November, 2025 */
+
+#include <stdio.h>
+#define true 1
+#define false 0
+
+int isPalindrome(int num)
+{
+ int temp = num, numRev = 0;
+ while (temp > 0)
+ {
+ numRev = (numRev * 10) + (temp % 10);
+ temp /= 10;
+ }
+ if (num == numRev)
+ return true;
+ else
+ return false;
+}
+
+int main()
+{
+ int uBound, lBound, num, palindromeCount = 0;
+ printf("Enter the Lower Bound and Upper Bound : ");
+ if (scanf("%d %d", &lBound, &uBound) != 2)
+ {
+ printf("\nOnly Integer values are allowed.");
+ return 1;
+ }
+ if (lBound < 0 || uBound < 0 || lBound > uBound)
+ {
+ printf("\nPlease enter appropriate inforamtion.");
+ return 1;
+ }
+ printf("Palindrome Numbers from %d to %d :", lBound, uBound);
+ for (num = lBound; num <= uBound; num++)
+ {
+ if (isPalindrome(num))
+ {
+ printf(" %d", num);
+ palindromeCount++;
+ }
+ }
+ printf("\nTotal Palindrome number found inside the range (%d to %d) : %d", lBound, uBound, palindromeCount);
+ return 0;
+}</code></pre>
+ </div>
+ </li>
</ul>
</div>
</li>
diff --git a/practice-c/pc011.c b/practice-c/pc011.c
@@ -0,0 +1,50 @@
+/* Write a C program that takes two positive integers, L (Lower Bound)
+and U (Upper Bound), as input from the user. The program must find and print
+the count of all numbers between L and U (inclusive) that
+are also a Palindrome Number. */
+/* Author - Amit Dutta, Date - 11th November, 2025 */
+
+#include <stdio.h>
+#define true 1
+#define false 0
+
+int isPalindrome(int num)
+{
+ int temp = num, numRev = 0;
+ while (temp > 0)
+ {
+ numRev = (numRev * 10) + (temp % 10);
+ temp /= 10;
+ }
+ if (num == numRev)
+ return true;
+ else
+ return false;
+}
+
+int main()
+{
+ int uBound, lBound, num, palindromeCount = 0;
+ printf("Enter the Lower Bound and Upper Bound : ");
+ if (scanf("%d %d", &lBound, &uBound) != 2)
+ {
+ printf("\nOnly Integer values are allowed.");
+ return 1;
+ }
+ if (lBound < 0 || uBound < 0 || lBound > uBound)
+ {
+ printf("\nPlease enter appropriate inforamtion.");
+ return 1;
+ }
+ printf("Palindrome Numbers from %d to %d :", lBound, uBound);
+ for (num = lBound; num <= uBound; num++)
+ {
+ if (isPalindrome(num))
+ {
+ printf(" %d", num);
+ palindromeCount++;
+ }
+ }
+ printf("\nTotal Palindrome number found inside the range (%d to %d) : %d", lBound, uBound, palindromeCount);
+ return 0;
+}+
\ No newline at end of file
