From 345e68b6b5753d90a8f312a78068915ad2998297 Mon Sep 17 00:00:00 2001
From: "ayush.krishna" <ayushkrishna@iitkgp.ac.in>
Date: Fri, 27 Dec 2019 22:41:33 +0530
Subject: [PATCH 1/2] Added Perfect Number

---
 PerfectNumber/.DS_Store       | Bin 0 -> 6148 bytes
 PerfectNumber/PerfectNumber.c |  20 ++++++++++++++++++++
 PerfectNumber/factorial.c     |  24 ++++++++++++++++++++++++
 3 files changed, 44 insertions(+)
 create mode 100644 PerfectNumber/.DS_Store
 create mode 100644 PerfectNumber/PerfectNumber.c
 create mode 100644 PerfectNumber/factorial.c

diff --git a/PerfectNumber/.DS_Store b/PerfectNumber/.DS_Store
new file mode 100644
index 0000000000000000000000000000000000000000..b1f2df8d0e2c8f9a53a43b0ec29af2190e31401a
GIT binary patch
literal 6148
zcmeHKOG?B*5PhYy7?_2#blE2u@CIQR7j8uG0-ET65D5&<QpirchUfAw`s$-3Mz=1s
z3aVarb-i@*7O8FkvfkgE080RKx+0!5OikC-Cw34SMX_ge*x?S>XtA19f1gn90$Xw#
zJYdLg&f2c2+pcB>Ur!#1FK=NSAK?PG+;7XM+;i-4kJ@r8d}Y6q@jPI2nwAQr0;xbM
zkP7@u1=zFI<_pJ+sX!`_3VbS{|A#_XtO9#S`*kqr@m<$vifSC&U4mF*UIq4!T%n0m
ziB6TcVu;h3FHu(o_Kr@6*v@=T>@0CZ5!;>lV&#y^F=Hx_3XByv^yyOj|0(^4`~R4f
zvs54z_)`kVY;(C;^OK^tPCib1ZJ}S$Ka90j&M-OzaH6gFcu-e#%(^PDcQiWlMknS$
MKy^t=1%5+;cl-`88vp<R

literal 0
HcmV?d00001

diff --git a/PerfectNumber/PerfectNumber.c b/PerfectNumber/PerfectNumber.c
new file mode 100644
index 0000000..9f3c240
--- /dev/null
+++ b/PerfectNumber/PerfectNumber.c
@@ -0,0 +1,20 @@
+#include <stdio.h>
+ 
+int main()
+{
+    int n, s = 0, i; 
+    printf("Enter a Number: ");
+    scanf("%d", &n);
+    for (i = 1; i < n; i++)
+    {
+        if (n % i == 0)
+        {
+            s = s + i;
+        }
+    }
+    if (s == n)
+        printf("%d is a perfect number",n);
+    else
+        printf("%d is not a perfect number",n);
+    return 0;
+}
\ No newline at end of file
diff --git a/PerfectNumber/factorial.c b/PerfectNumber/factorial.c
new file mode 100644
index 0000000..1f41a88
--- /dev/null
+++ b/PerfectNumber/factorial.c
@@ -0,0 +1,24 @@
+#include<stdio.h>
+
+int factorial(int n)
+{
+    if(n>=1)  return n*factorial(n-1);
+	else return 1;
+}
+
+int main()
+{
+    int n;int ar[100];
+	scanf("%d",&n);
+	for(int i=1;i<=n;i++)
+	{
+	    scanf("%d",&ar[i-1]);
+	    
+	}
+	for(int i=1;i<=n;i++)
+	 {
+	 	 printf("%d \n",factorial(ar[i-1]));
+	 }		
+		return 0;
+}
+

From fed9d21a2a54e0ef10f5a8c7832272c2dcf5a4bf Mon Sep 17 00:00:00 2001
From: Ayush Krishna <57257303+ayush-krishna@users.noreply.github.com>
Date: Sat, 28 Dec 2019 15:14:04 +0530
Subject: [PATCH 2/2] Delete factorial.c

---
 PerfectNumber/factorial.c | 24 ------------------------
 1 file changed, 24 deletions(-)
 delete mode 100644 PerfectNumber/factorial.c

diff --git a/PerfectNumber/factorial.c b/PerfectNumber/factorial.c
deleted file mode 100644
index 1f41a88..0000000
--- a/PerfectNumber/factorial.c
+++ /dev/null
@@ -1,24 +0,0 @@
-#include<stdio.h>
-
-int factorial(int n)
-{
-    if(n>=1)  return n*factorial(n-1);
-	else return 1;
-}
-
-int main()
-{
-    int n;int ar[100];
-	scanf("%d",&n);
-	for(int i=1;i<=n;i++)
-	{
-	    scanf("%d",&ar[i-1]);
-	    
-	}
-	for(int i=1;i<=n;i++)
-	 {
-	 	 printf("%d \n",factorial(ar[i-1]));
-	 }		
-		return 0;
-}
-