Merge pull request #7709 from pauloscustodio/master

Add Perl, C, C++ and Forth solutions

2 files changed, 105 insertions, 0 deletions

diff --git a/challenge-201/paulo-custodio/cpp/ch-1.cpp b/challenge-201/paulo-custodio/cpp/ch-1.cpp
new file mode 100644
index 0000000000..88557d44f7
--- /dev/null
+++ b/challenge-201/paulo-custodio/cpp/ch-1.cpp
@@ -0,0 +1,53 @@
+/*
+Challenge 201
+
+Task 1: Missing Numbers
+Submitted by: Mohammad S Anwar
+
+You are given an array of unique numbers.
+
+Write a script to find out all missing numbers in the range 0..$n where $n
+is the array size.
+
+Example 1
+
+Input: @array = (0,1,3)
+Output: 2
+
+The array size i.e. total element count is 3, so the range is 0..3.
+The missing number is 2 in the given array.
+
+Example 2
+
+Input: @array = (0,1)
+Output: 2
+
+The array size is 2, therefore the range is 0..2.
+The missing number is 2.
+*/
+
+#include <algorithm>
+#include <iostream>
+#include <vector>
+
+void print_missing(std::vector<int>& nums) {
+    std::sort(nums.begin(), nums.end());
+    for (size_t i = 0; i <= nums.size(); i++) {     // check 0..N
+        if (!std::binary_search(nums.begin(), nums.end(), i))
+            std::cout << i << " ";
+    }
+    std::cout << std::endl;
+}
+
+int main(int argc, char* argv[]) {
+    argv++; argc--;
+    if (argc == 0) {
+        std::cerr << "usage: ch-1 nums..." << std::endl;
+        exit(EXIT_FAILURE);
+    }
+
+    std::vector<int> nums;
+    for (int i = 0; i < argc; i++)
+        nums.push_back(atoi(argv[i]));
+    print_missing(nums);
+}
diff --git a/challenge-201/paulo-custodio/cpp/ch-2.cpp b/challenge-201/paulo-custodio/cpp/ch-2.cpp
new file mode 100644
index 0000000000..9eb7e7a8e7
--- /dev/null
+++ b/challenge-201/paulo-custodio/cpp/ch-2.cpp
@@ -0,0 +1,52 @@
+/*
+Challenge 201
+
+Task 2: Penny Piles
+Submitted by: Robbie Hatley
+
+You are given an integer, $n > 0.
+
+Write a script to determine the number of ways of putting $n pennies in a row
+of piles of ascending heights from left to right.
+Example
+
+Input: $n = 5
+Output: 7
+
+Since $n=5, there are 7 ways of stacking 5 pennies in ascending piles:
+
+    1 1 1 1 1
+    1 1 1 2
+    1 2 2
+    1 1 3
+    2 3
+    1 4
+    5
+*/
+
+#include <iostream>
+
+int make_piles1(int prev, int n) {
+    int count = 0;
+    if (n == 0)
+        count++;
+    else if (n > 0) {
+        int max = (prev < 0) ? n : prev;
+        for (int i = 1; i <= max; i++)
+            count += make_piles1(i, n-i);
+    }
+    return count;
+}
+
+int make_piles(int n) {
+    return make_piles1(-1, n);
+}
+
+int main(int argc, char* argv[]) {
+    if (argc != 2) {
+        std::cerr << "usage: ch-2 N" << std::endl;
+        exit(EXIT_FAILURE);
+    }
+
+    std::cout << make_piles(atoi(argv[1])) << std::endl;
+}