Add Perl, C, C++ and Forth solutions

2 files changed, 18 insertions, 2 deletions

diff --git a/challenge-202/paulo-custodio/c/ch-1.c b/challenge-202/paulo-custodio/c/ch-1.c
index dc8f770f46..fc85e22ae3 100644
--- a/challenge-202/paulo-custodio/c/ch-1.c
+++ b/challenge-202/paulo-custodio/c/ch-1.c
@@ -34,6 +34,14 @@ Output: 1
 #include <stdlib.h>
 #include <stdbool.h>
 
+void* check_mem(void* p) {
+    if (!p) {
+        fputs("Out of memory", stderr);
+        exit(EXIT_FAILURE);
+    }
+    return p;
+}
+
 bool is_odd(int n) {
     return n%2==1;
 }
@@ -53,7 +61,7 @@ int main(int argc, char* argv[]) {
     }
 
     int nums_size = argc;
-    int* nums = malloc(nums_size * sizeof(int));
+    int* nums = check_mem(malloc(nums_size * sizeof(int)));
     for (int i = 0; i < nums_size; i++)
         nums[i] = atoi(argv[i]);
 
diff --git a/challenge-202/paulo-custodio/c/ch-2.c b/challenge-202/paulo-custodio/c/ch-2.c
index 09e61bdefe..424b418810 100644
--- a/challenge-202/paulo-custodio/c/ch-2.c
+++ b/challenge-202/paulo-custodio/c/ch-2.c
@@ -39,6 +39,14 @@ Output: 3, 3, 2, 1, 2, 3, 3
 #include <stdlib.h>
 #include <string.h>
 
+void* check_mem(void* p) {
+    if (!p) {
+        fputs("Out of memory", stderr);
+        exit(EXIT_FAILURE);
+    }
+    return p;
+}
+
 int largest_valey(int heights[], int heights_size) {
     int l1 = 0, r1 = -1;        // initial interval
 
@@ -72,7 +80,7 @@ int main(int argc, char* argv[]) {
     }
 
     int heights_size = argc;
-    int* heights = malloc(heights_size * sizeof(int));
+    int* heights = check_mem(malloc(heights_size * sizeof(int)));
     for (int i = 0; i < heights_size; i++)
         heights[i] = atoi(argv[i]);