Factorial

ArmstrongProg.c

@@ -0,0 +1,61 @@
+
+#include <stdio.h>
+
+/* Function to calculate x raised to the power y */
+int power(int x, unsigned int y)
+{
+    if (y == 0)
+        return 1;
+    if (y % 2 == 0)
+        return power(x, y / 2) * power(x, y / 2);
+    return x * power(x, y / 2) * power(x, y / 2);
+}
+
+/* Function to calculate order of the number */
+int order(int x)
+{
+    int n = 0;
+    while (x) {
+        n++;
+        x = x / 10;
+    }
+    return n;
+}
+
+// Function to check whether the given number is
+// Armstrong number or not
+int isArmstrong(int x)
+{
+    // Calling order function
+    int n = order(x);
+    int temp = x, sum = 0;
+    while (temp) {
+        int r = temp % 10;
+        sum += power(r, n);
+        temp = temp / 10;
+    }
+
+    // If satisfies Armstrong condition
+    if (sum == x)
+        return 1;
+    else
+        return 0;
+}
+
+// Driver Program
+int main()
+{
+    int x = 153;
+    if (isArmstrong(x) == 1)
+        printf("True\n");
+    else
+        printf("False\n");
+
+    x = 1253;
+    if (isArmstrong(x) == 1)
+        printf("True\n");
+    else
+        printf("False\n");
+
+    return 0;
+}

JavaHackt.java → JavaFact.java

@@ -1,5 +1,5 @@
 import java.util.Scanner;
-public class JavaHackt {
+public class JavaFact {
 
     public static void main(String[] args) {
 

PalindromeNo.java

@@ -0,0 +1,27 @@
+class PalindromeNo {
+    public boolean isPalindrome(int x) {
+        int rem=0, sum = 0;
+        int temp = x;
+        if(temp<0)
+            return false;
+        while(x!=0){
+            rem = x%10;
+            x = x/10;
+            sum = (sum*10) + rem;
+        }
+        if (sum == temp){
+            return true;
+        }
+        else
+            return false;
+    }
+
+    public static void main(String args[]){
+        Scanner input = new Scanner(System.in);
+        System.out.println("enter input");
+        int num = input.nextInt();
+        Solution S = new Solution();
+        S.isPalindrome(num);
+
+    }
+}