June 2018 Update

Task/Factorial/C/factorial-2.c

@@ -1,3 +1,8 @@
-int factorial(int n) {
-    return n == 0 ? 1 : n * factorial(n - 1);
+int factorialSafe(int n) {
+    int result = 1;
+    if(n<0)
+        return -1;
+    for (int i = 1; i <= n; ++i)
+        result *= i;
+    return result;
 }

Task/Factorial/C/factorial-3.c

@@ -1,7 +1,3 @@
-int fac_aux(int n, int acc) {
-    return n < 1 ? acc : fac_aux(n - 1, acc * n);
-}
-
 int factorial(int n) {
-    return fac_aux(n, 1);
+    return n == 0 ? 1 : n * factorial(n - 1);
 }

Task/Factorial/C/factorial-4.c

@@ -0,0 +1,3 @@
+int factorialSafe(int n) {
+    return n<0 ? -1 : n == 0 ? 1 : n * factorialSafe(n - 1);
+}

Task/Factorial/C/factorial-5.c

@@ -0,0 +1,13 @@
+int fac_aux(int n, int acc) {
+    return n < 1 ? acc : fac_aux(n - 1, acc * n);
+}
+
+/*Handles negative n, Abhishek Ghosh, 1st November 2017*/
+
+int fac_auxSafe(int n, int acc) {
+    return n<0 ? -1 : n < 1 ? acc : fac_aux(n - 1, acc * n);
+}
+
+int factorial(int n) {
+    return fac_aux(n, 1);
+}

Task/Factorial/C/factorial-6.c

@@ -0,0 +1,41 @@
+#include <stdio.h>
+
+#define l11l 0xFFFF
+#define ll1 for
+#define ll111 if
+#define l1l1 unsigned
+#define l111 struct
+#define lll11 short
+#define ll11l long
+#define ll1ll putchar
+#define l1l1l(l) l=malloc(sizeof(l111 llll1));l->lll1l=1-1;l->ll1l1=1-1;
+#define l1ll1 *lllll++=l1ll%10000;l1ll/=10000;
+#define l1lll ll111(!l1->lll1l){l1l1l(l1->lll1l);l1->lll1l->ll1l1=l1;}\
+lllll=(l1=l1->lll1l)->lll;ll=1-1;
+#define llll 1000
+
+
+
+
+                                                     l111 llll1 {
+                                                     l111 llll1 *
+      lll1l,*ll1l1        ;l1l1                      lll11 lll [
+      llll];};main      (){l111 llll1                *ll11,*l1l,*
+      l1, *ll1l, *    malloc ( ) ; l1l1              ll11l l1ll ;
+      ll11l l11,ll  ,l;l1l1 lll11 *lll1,*            lllll; ll1(l
+      =1-1 ;l< 14; ll1ll("\t\"8)>l\"9!.)>vl"         [l]^'L'),++l
+      );scanf("%d",&l);l1l1l(l1l) l1l1l(ll11         ) (l1=l1l)->
+      lll[l1l->lll[1-1]     =1]=l11l;ll1(l11         =1+1;l11<=l;
+      ++l11){l1=ll11;         lll1 = (ll1l=(         ll11=l1l))->
+      lll; lllll =(            l1l=l1)->lll;         ll=(l1ll=1-1
+      );ll1(;ll1l->             lll1l||l11l!=        *lll1;){l1ll
+      +=l11**lll1++             ;l1ll1 ll111         (++ll>llll){
+      l1lll lll1=(              ll1l =ll1l->         lll1l)->lll;
+      }}ll1(;l1ll;              ){l1ll1 ll111        (++ll>=llll)
+      { l1lll} } *              lllll=l11l;}
+      ll1(l=(ll=1-              1);(l<llll)&&
+      (l1->lll[ l]              !=l11l);++l);        ll1 (;l1;l1=
+      l1->ll1l1,l=              llll){ll1(--l        ;l>=1-1;--l,
+      ++ll)printf(              (ll)?((ll%19)        ?"%04d":(ll=
+      19,"\n%04d")              ):"%4d",l1->         lll[l] ) ; }
+                                                     ll1ll(10); }