commit 3491a707adec07b61f35343a65a1b9ef87a77323
parent 4a39246c9ca1d92ee92b266001519a2d8719118e
Author: Amit Dutta <amitdutta4255@gmail.com>
Date: Sun, 16 Nov 2025 14:43:39 +0530
new -16112025 _tuition-c/l54,l55
Diffstat:
3 files changed, 193 insertions(+), 1 deletion(-)
diff --git a/docs/index.html b/docs/index.html
@@ -4556,7 +4556,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">tuition-c</span>
- <span class="ml-2 text-sm text-gray-500">(101 files)</span>
+ <span class="ml-2 text-sm text-gray-500">(103 files)</span>
</div>
<div class="flex items-center space-x-4">
<a href="https://github.com/notamitgamer/bsc/tree/main/tuition-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">
@@ -8777,6 +8777,116 @@ 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">P054.c</span>
+ <div class="ml-auto flex items-center space-x-4">
+ <a href="https://github.com/notamitgamer/bsc/blob/main/tuition-c/P054.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-tuition-c-P054_c', 'P054.c')" class="text-green-600 font-semibold text-sm hover:underline">View Code</button>
+ </div>
+ </div>
+ <div id="code-tuition-c-P054_c" class="hidden" data-github-url="https://github.com/notamitgamer/bsc/blob/main/tuition-c/P054.c">
+ <pre><code class="language-c">/* WAP to check Krishnamurty number using user defined methods/functions. */
+/* Author - Amit Dutta, Date - 15th November, 2025 */
+
+// This code has not been compiled.
+// If you find any issues, please create a new issue on GitHub regarding them.
+// Go to this link to create a new issue: https://github.com/notamitgamer/bsc/issues
+
+#include <stdio.h>
+
+int fact(int);
+int isKrishnamurty(int);
+
+int fact(int n)
+{
+ int fact = 1, i;
+ for (i = 1; i <= n; i++)
+ fact *= i;
+ return fact;
+}
+
+int isKrishnamurty(int n)
+{
+ int temp = n, sum = 0;
+ while (temp > 0)
+ {
+ sum += fact(temp % 10);
+ temp /= 10;
+ }
+ return n == sum;
+}
+
+int main()
+{
+ int n;
+ printf("Enter the number : ");
+ scanf("%d", &n);
+ if (isKrishnamurty(n))
+ printf("\nInput %d is a Krishnamurty Number.", n);
+ else
+ printf("\nInput %d is not a Krishnamurty number.", n);
+ return 0;
+}</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">P055.c</span>
+ <div class="ml-auto flex items-center space-x-4">
+ <a href="https://github.com/notamitgamer/bsc/blob/main/tuition-c/P055.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-tuition-c-P055_c', 'P055.c')" class="text-green-600 font-semibold text-sm hover:underline">View Code</button>
+ </div>
+ </div>
+ <div id="code-tuition-c-P055_c" class="hidden" data-github-url="https://github.com/notamitgamer/bsc/blob/main/tuition-c/P055.c">
+ <pre><code class="language-c">/* WAP to print n terms of Fibbonacci Series (Starting from term 0) */
+/* Author - Amit Dutta, Date - 15th November, 2025 */
+
+// This code has not been compiled.
+// If you find any issues, please create a new issue on GitHub regarding them.
+// Go to this link to create a new issue: https://github.com/notamitgamer/bsc/issues
+
+#include <stdio.h>
+
+void printFibonacci(int);
+
+void printFibonacci(int n)
+{
+ int val1 = 0, val2 = 1, val3, i;
+ printf("\nFibonacci series upto %d terms :", n);
+ if (n < 0)
+ printf(" N/A");
+ if (n == 0)
+ printf(" %d", val1);
+ if (n > 0)
+ printf(" %d %d", val1, val2);
+ for (i = 2; i <= n; i++)
+ {
+ val3 = val1 + val2;
+ printf(" %d", val3);
+ val1 = val2;
+ val2 = val3;
+ }
+}
+
+int main()
+{
+ int n;
+ printf("Enter the n : ");
+ scanf("%d", &n);
+ printFibonacci(n);
+ return 0;
+}</code></pre>
+ </div>
+ </li>
</ul>
</div>
</li>
diff --git a/tuition-c/P054.c b/tuition-c/P054.c
@@ -0,0 +1,42 @@
+/* WAP to check Krishnamurty number using user defined methods/functions. */
+/* Author - Amit Dutta, Date - 15th November, 2025 */
+
+// This code has not been compiled.
+// If you find any issues, please create a new issue on GitHub regarding them.
+// Go to this link to create a new issue: https://github.com/notamitgamer/bsc/issues
+
+#include <stdio.h>
+
+int fact(int);
+int isKrishnamurty(int);
+
+int fact(int n)
+{
+ int fact = 1, i;
+ for (i = 1; i <= n; i++)
+ fact *= i;
+ return fact;
+}
+
+int isKrishnamurty(int n)
+{
+ int temp = n, sum = 0;
+ while (temp > 0)
+ {
+ sum += fact(temp % 10);
+ temp /= 10;
+ }
+ return n == sum;
+}
+
+int main()
+{
+ int n;
+ printf("Enter the number : ");
+ scanf("%d", &n);
+ if (isKrishnamurty(n))
+ printf("\nInput %d is a Krishnamurty Number.", n);
+ else
+ printf("\nInput %d is not a Krishnamurty number.", n);
+ return 0;
+}+
\ No newline at end of file
diff --git a/tuition-c/P055.c b/tuition-c/P055.c
@@ -0,0 +1,38 @@
+/* WAP to print n terms of Fibbonacci Series (Starting from term 0) */
+/* Author - Amit Dutta, Date - 15th November, 2025 */
+
+// This code has not been compiled.
+// If you find any issues, please create a new issue on GitHub regarding them.
+// Go to this link to create a new issue: https://github.com/notamitgamer/bsc/issues
+
+#include <stdio.h>
+
+void printFibonacci(int);
+
+void printFibonacci(int n)
+{
+ int val1 = 0, val2 = 1, val3, i;
+ printf("\nFibonacci series upto %d terms :", n);
+ if (n < 0)
+ printf(" N/A");
+ if (n == 0)
+ printf(" %d", val1);
+ if (n > 0)
+ printf(" %d %d", val1, val2);
+ for (i = 2; i <= n; i++)
+ {
+ val3 = val1 + val2;
+ printf(" %d", val3);
+ val1 = val2;
+ val2 = val3;
+ }
+}
+
+int main()
+{
+ int n;
+ printf("Enter the n : ");
+ scanf("%d", &n);
+ printFibonacci(n);
+ return 0;
+}+
\ No newline at end of file
