title: Fast Multiplication Method Without Using Multiplication Operator Russian Peasants Algorithm
signature: int fastMultiplicationMethodWithoutUsingMultiplicationOperatorRussianPeasantsAlgorithm(int a, int b) {
test_code: #include <algorithm>
  #include <assert.h>
  #include <cstdlib>
  #include <iostream>
  #include <map>
  #include <set>
  #include <string>
  #include <tuple> 
  #include <unordered_map>
  #include <vector>
  #include <math.h>
  #include <cmath>
  #include <bits/stdc++.h>
  #include <numeric>
  #include <functional>
  
  using namespace std;
  
  // SOLUTION CODE
  // ============================================
  PLACEHOLDER_CODE_BODY
  
  // TESTING CODE 
  // ============================================
  bool validateSolution(int actual, int expected){
      return actual == expected;
  }
  
  string driver(int a, int b, int expected){
      try
      {
          if (validateSolution(PLACEHOLDER_FN_NAME(a, b), expected)){
              return "PASSED";
          }
          return "FAILED";
      }
      catch (const std::overflow_error& exception_obj)
      {
          return typeid(exception_obj).name();
      }
      catch (const std::runtime_error& exception_obj)
      {
          return typeid(exception_obj).name();
      }
      catch (const std::exception& exception_obj)
      {
          return typeid(exception_obj).name();
      }
      catch (...)
      {
          return "UNK_ERROR";
      }
  }
  
  int main() {
      string result = "";
  
      result = driver(4, 33, 132); 
      cout << "TEST-" << 0 << "..."
           <<  result
           << "\n";
  
      result = driver(36, 67, 2412); 
      cout << "TEST-" << 1 << "..."
           <<  result
           << "\n";
  
      result = driver(65, 52, 3380); 
      cout << "TEST-" << 2 << "..."
           <<  result
           << "\n";
  
      result = driver(55, 37, 2035); 
      cout << "TEST-" << 3 << "..."
           <<  result
           << "\n";
  
      result = driver(35, 76, 2660); 
      cout << "TEST-" << 4 << "..."
           <<  result
           << "\n";
  
      result = driver(69, 98, 6762); 
      cout << "TEST-" << 5 << "..."
           <<  result
           << "\n";
  
      result = driver(84, 62, 5208); 
      cout << "TEST-" << 6 << "..."
           <<  result
           << "\n";
  
      result = driver(5, 80, 400); 
      cout << "TEST-" << 7 << "..."
           <<  result
           << "\n";
  
      result = driver(15, 36, 540); 
      cout << "TEST-" << 8 << "..."
           <<  result
           << "\n";
  
      result = driver(67, 84, 5628); 
      cout << "TEST-" << 9 << "..."
           <<  result
           << "\n";
  
      return 0;
  }
source_py: def fast_multiplication_method_without_using_multiplication_operator_russian_peasants_algorithm(a, b):
      res = 0
      while (b > 0):
          if (b & 1):
              res = (res + a)
          a = (a << 1)
          b = (b >> 1)
      return res
source_cpp: unsigned int fast_multiplication_method_without_using_multiplication_operator_russian_peasants_algorithm(unsigned int a, unsigned int b) {
    int res = 0;
    while ( b > 0 ) {
      if ( b & 1 ) res = res + a;
      a = a << 1;
      b = b >> 1;
    }
    return res;
  }