From 83827da5299d2373065154e17b50b53ef9c2f8fd Mon Sep 17 00:00:00 2001
From: sanjana konte <konte.sanjana@gmail.com>
Date: Tue, 5 Oct 2021 11:16:40 +0530
Subject: [PATCH 1/3] 	new file:   ArmstrongProg.c 	program to find
 armstrong number

---
 ArmstrongProg.c | 61 +++++++++++++++++++++++++++++++++++++++++++++++++
 1 file changed, 61 insertions(+)
 create mode 100644 ArmstrongProg.c

diff --git a/ArmstrongProg.c b/ArmstrongProg.c
new file mode 100644
index 0000000..9db0c93
--- /dev/null
+++ b/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;
+}
\ No newline at end of file

From 5c911381114193b988dcd04f343ffcfefc756282 Mon Sep 17 00:00:00 2001
From: sanjana konte <konte.sanjana@gmail.com>
Date: Tue, 5 Oct 2021 11:22:52 +0530
Subject: [PATCH 2/3] A java program to find palindrome of a given number

---
 Palindrome.java | 27 +++++++++++++++++++++++++++
 1 file changed, 27 insertions(+)
 create mode 100644 Palindrome.java

diff --git a/Palindrome.java b/Palindrome.java
new file mode 100644
index 0000000..997d2e9
--- /dev/null
+++ b/Palindrome.java
@@ -0,0 +1,27 @@
+class Palindrome {
+    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);
+        
+    }
+}
\ No newline at end of file

From 3f0be519a61e5b207f48f1a92cc4995fee87a171 Mon Sep 17 00:00:00 2001
From: sanjana konte <konte.sanjana@gmail.com>
Date: Tue, 5 Oct 2021 11:49:34 +0530
Subject: [PATCH 3/3] java program to find factorial of a given number

---
 JavaHackt.java => JavaFact.java      | 2 +-
 Palindrome.java => PalindromeNo.java | 2 +-
 2 files changed, 2 insertions(+), 2 deletions(-)
 rename JavaHackt.java => JavaFact.java (95%)
 rename Palindrome.java => PalindromeNo.java (96%)

diff --git a/JavaHackt.java b/JavaFact.java
similarity index 95%
rename from JavaHackt.java
rename to JavaFact.java
index 652be1f..9dda535 100644
--- a/JavaHackt.java
+++ b/JavaFact.java
@@ -1,5 +1,5 @@
 import java.util.Scanner;
-public class JavaHackt {
+public class JavaFact {
 
     public static void main(String[] args) {
 
diff --git a/Palindrome.java b/PalindromeNo.java
similarity index 96%
rename from Palindrome.java
rename to PalindromeNo.java
index 997d2e9..ae9739b 100644
--- a/Palindrome.java
+++ b/PalindromeNo.java
@@ -1,4 +1,4 @@
-class Palindrome {
+class PalindromeNo {
     public boolean isPalindrome(int x) {
         int rem=0, sum = 0;
         int temp = x;