update to branch

6 files changed, 77 insertions, 0 deletions

diff --git a/challenge-141/adam-russell/blog.txt b/challenge-141/adam-russell/blog.txt
new file mode 100644
index 0000000000..e69de29bb2
--- /dev/null
+++ b/challenge-141/adam-russell/blog.txt
diff --git a/challenge-141/adam-russell/blog1.txt b/challenge-141/adam-russell/blog1.txt
new file mode 100644
index 0000000000..e69de29bb2
--- /dev/null
+++ b/challenge-141/adam-russell/blog1.txt
diff --git a/challenge-141/adam-russell/cxx/ch-1.cxx b/challenge-141/adam-russell/cxx/ch-1.cxx
new file mode 100644
index 0000000000..3c69fb930f
--- /dev/null
+++ b/challenge-141/adam-russell/cxx/ch-1.cxx
@@ -0,0 +1,43 @@
+#include<cmath>
+#include<vector>
+#include<iostream>
+
+class NumberDivisors{
+    private:
+        std::vector<int> factor(int);
+    public:
+        std::vector<int> first_ten_with_eight(); 
+};  
+
+std::vector<int> NumberDivisors::factor(int n){
+    std::vector<int> factors;
+    factors.push_back(1);
+    factors.push_back(n);
+    for(int i = 2; i <= std::sqrt(n); i++){
+        if(n % i == 0)
+            factors.push_back(i);
+        if(n % i == 0 && std::lround(std::pow(i,2)) != n)
+            factors.push_back(n / i); 
+    }  
+    return factors;
+}
+
+std::vector<int> NumberDivisors::first_ten_with_eight(){
+    int i = 0;
+    std::vector<int> divisible;
+    do{
+        std::vector<int> factors = this->factor(i);
+        if(factors.size() == 8) 
+            divisible.push_back(i);
+        i++;   
+    }while(divisible.size() < 10);    
+    return divisible;  
+}
+
+int main(int argc, char** argv){
+    NumberDivisors divisorator;
+    std::vector<int> first_ten = divisorator.first_ten_with_eight();
+    for(int i : first_ten)
+        std::cout << i << " "; 
+    std::cout << std::endl;  
+}
diff --git a/challenge-141/adam-russell/cxx/ch-2.cxx b/challenge-141/adam-russell/cxx/ch-2.cxx
new file mode 100644
index 0000000000..02b29df17d
--- /dev/null
+++ b/challenge-141/adam-russell/cxx/ch-2.cxx
@@ -0,0 +1,34 @@
+#include<vector>
+#include<iostream>
+#include<algorithm>
+
+class LikeNumbers{
+    public:
+        std::vector<int> like_numbers(int, int);  
+    private:
+        std::vector<int> int2digits(int);
+};
+
+std::vector<int> LikeNumbers::int2digits(int i){
+    std::vector<int> digits;
+    do{
+        int digit = i % 10;
+        digits.push_back(digit);
+        i = i / 10;  
+    }while(i != 0); 
+    std::reverse(digits.begin(), digits.end()); 
+    return digits;  
+}
+
+std::vector<int> LikeNumbers::like_numbers(int i, int j){
+    std::vector<int> digits = this->int2digits(i);  
+    for(int digit : digits)
+        std::cout << digit << " "; 
+    std::cout << std::endl; 
+    return digits;
+}
+
+int main(int argc, char** argv){
+    LikeNumbers ln;
+    ln.like_numbers(1234, 2);  
+} 
diff --git a/challenge-141/adam-russell/prolog/ch-1.p b/challenge-141/adam-russell/prolog/ch-1.p
new file mode 100644
index 0000000000..e69de29bb2
--- /dev/null
+++ b/challenge-141/adam-russell/prolog/ch-1.p
diff --git a/challenge-141/adam-russell/prolog/ch-2.p b/challenge-141/adam-russell/prolog/ch-2.p
new file mode 100644
index 0000000000..e69de29bb2
--- /dev/null
+++ b/challenge-141/adam-russell/prolog/ch-2.p