swaaz · swaaz · Oct 8, 2020 · Oct 8, 2020 · Oct 8, 2020 · Oct 8, 2020
diff --git a/C/program-100/README.md b/C/program-100/README.md
@@ -0,0 +1,8 @@
+Strong Numbers are the numbers whose sum of factorial of digits is equal to the original number.
+
+Example - 
+Input  : n = 145
+Output : Yes
+Sum of digit factorials = 1! + 4! + 5!
+                        = 1 + 24 + 120
+                        = 145
diff --git a/C/program-100/strongNumber.c b/C/program-100/strongNumber.c
@@ -0,0 +1,24 @@
+#include <stdio.h>
+
+int main()
+{
+    int n, f = 1, s = 0, r, i, n1;
+    scanf("%d", &n);
+    n = n1;
+    while (n)
+    {
+        r = n % 10; // Taking the last digit of the number
+        for (i = 1; i <= r; i++)
+        {
+            f = f * i;
+        }
+        s = s + f;
+        n /= 10;
+    }
+    if (s == n1)
+        printf("Strong no.");
+    else
+        printf("Not Strong no.");
+
+    return 0;
+}
diff --git a/C/program-64/ArmstrongNumber.c b/C/program-64/ArmstrongNumber.c
@@ -0,0 +1,26 @@
+#include <stdio.h>
+#include <math.h>
+int main()
+{
+    int number, originalNumber, remainder, result = 0, n = 0;
+    scanf("%d", &number);
+    originalNumber = number;
+
+    while (originalNumber != 0)
+    {
+        originalNumber /= 10;
+        ++n;
+    }
+    originalNumber = number;
+    while (originalNumber != 0)
+    {
+        remainder = originalNumber % 10;
+        result += pow(remainder, n);
+        originalNumber /= 10;
+    }
+    if (result == number)
+        printf("yes");
+    else
+        printf("no");
+    return 0;
+}
diff --git a/C/program-64/README.md b/C/program-64/README.md
@@ -0,0 +1,10 @@
+A positive integer of n digits is called an Armstrong number of order n (order is number of digits) 
+
+if -
+abcd... = pow(a,n) + pow(b,n) + pow(c,n) + pow(d,n) + .... 
+
+Example -
+Input : 153
+Output : Yes
+153 is an Armstrong number.
+1*1*1 + 5*5*5 + 3*3*3 = 153
diff --git a/C/program-66/README.md b/C/program-66/README.md
@@ -0,0 +1 @@
+Program to find fibonacci series upto n values in C language.
diff --git a/C/program-66/fibonacciSeries.c b/C/program-66/fibonacciSeries.c
@@ -0,0 +1,18 @@
+#include <stdio.h>
+
+int main()
+{
+    int i, n, a = 0, b = 1, c;
+    printf("enter the no. of values = ");
+    scanf("%d", &n);
+    // Initiating the values as 0,1,...
+    printf("%d,%d,", a, b);
+    for (i = 1; i <= (n - 2); i++)
+    {
+        c = a + b; // creating the new value
+        printf("%d,", c);
+        a = b, b = c; // Updating the values
+    }
+
+    return 0;
+}
Original file line number	Diff line number	Diff line change
		@@ -0,0 +1 @@
		Program to find fibonacci series upto n values in C language.