From 1879caa1dd80cb11dd62403663917ad4bf7cc68e Mon Sep 17 00:00:00 2001
From: Charles <sircharlesaze@gmail.com>
Date: Sun, 11 Aug 2019 22:41:34 +0200
Subject: rename all file with 3 zero padding

---
 c/005-smallest_multiple.c                  | 23 ++++++++++++++++++++
 c/012-highly_divisible_triangular_number.c | 35 ++++++++++++++++++++++++++++++
 c/12-highly_divisible_triangular_number.c  | 35 ------------------------------
 c/5-smallest_multiple.c                    | 23 --------------------
 4 files changed, 58 insertions(+), 58 deletions(-)
 create mode 100644 c/005-smallest_multiple.c
 create mode 100644 c/012-highly_divisible_triangular_number.c
 delete mode 100644 c/12-highly_divisible_triangular_number.c
 delete mode 100644 c/5-smallest_multiple.c

(limited to 'c')

diff --git a/c/005-smallest_multiple.c b/c/005-smallest_multiple.c
new file mode 100644
index 0000000..4924dd1
--- /dev/null
+++ b/c/005-smallest_multiple.c
@@ -0,0 +1,23 @@
+#include <stdio.h>
+#include <stdbool.h>
+
+int main() {
+    int num = 0, i;
+    bool end = false;
+    while (!end) {
+        num += 2;
+
+        for (i = 1; i <= 20; i++) {
+            if (num % i != 0) {
+                end = false;
+                break;
+            } else {
+                end = true;
+            }
+        }
+    }
+
+    printf("%d", num);
+
+    return 0;
+}
diff --git a/c/012-highly_divisible_triangular_number.c b/c/012-highly_divisible_triangular_number.c
new file mode 100644
index 0000000..4ece373
--- /dev/null
+++ b/c/012-highly_divisible_triangular_number.c
@@ -0,0 +1,35 @@
+#include <stdio.h>
+#include <math.h>
+
+
+int triangle_number(int nb)
+{
+    int i, sum = 0;
+    for (i = 0; i < nb + 1; i++)
+        sum += i;
+    return sum;
+}
+
+int count_divisors(int nb)
+{
+    int i, div_nb = 0;
+    for (i = 1; i <= sqrt(nb); i++) {
+        if (nb % i == 0)
+            div_nb += (i != nb / i ? 2 : 1);
+    }
+    return div_nb;
+}
+
+int main(void)
+{
+    int i, t_nb;
+
+    for (i = 0;; i++) {
+        t_nb = triangle_number(i);
+        if (count_divisors(t_nb) + 2 > 500)
+            break;
+    }
+    printf("%d", t_nb);
+
+    return 0;
+}
diff --git a/c/12-highly_divisible_triangular_number.c b/c/12-highly_divisible_triangular_number.c
deleted file mode 100644
index 4ece373..0000000
--- a/c/12-highly_divisible_triangular_number.c
+++ /dev/null
@@ -1,35 +0,0 @@
-#include <stdio.h>
-#include <math.h>
-
-
-int triangle_number(int nb)
-{
-    int i, sum = 0;
-    for (i = 0; i < nb + 1; i++)
-        sum += i;
-    return sum;
-}
-
-int count_divisors(int nb)
-{
-    int i, div_nb = 0;
-    for (i = 1; i <= sqrt(nb); i++) {
-        if (nb % i == 0)
-            div_nb += (i != nb / i ? 2 : 1);
-    }
-    return div_nb;
-}
-
-int main(void)
-{
-    int i, t_nb;
-
-    for (i = 0;; i++) {
-        t_nb = triangle_number(i);
-        if (count_divisors(t_nb) + 2 > 500)
-            break;
-    }
-    printf("%d", t_nb);
-
-    return 0;
-}
diff --git a/c/5-smallest_multiple.c b/c/5-smallest_multiple.c
deleted file mode 100644
index 4924dd1..0000000
--- a/c/5-smallest_multiple.c
+++ /dev/null
@@ -1,23 +0,0 @@
-#include <stdio.h>
-#include <stdbool.h>
-
-int main() {
-    int num = 0, i;
-    bool end = false;
-    while (!end) {
-        num += 2;
-
-        for (i = 1; i <= 20; i++) {
-            if (num % i != 0) {
-                end = false;
-                break;
-            } else {
-                end = true;
-            }
-        }
-    }
-
-    printf("%d", num);
-
-    return 0;
-}
-- 
cgit