title: Smallest Power Of 2 Greater Than Or Equal To N
signature: int smallestPowerOf2GreaterThanOrEqualToN(int n) {
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 n, int expected){
      try
      {
          if (validateSolution(PLACEHOLDER_FN_NAME(n), 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(13, 16); 
      cout << "TEST-" << 0 << "..."
           <<  result
           << "\n";
  
      result = driver(27, 32); 
      cout << "TEST-" << 1 << "..."
           <<  result
           << "\n";
  
      result = driver(1, 1); 
      cout << "TEST-" << 2 << "..."
           <<  result
           << "\n";
  
      result = driver(24, 32); 
      cout << "TEST-" << 3 << "..."
           <<  result
           << "\n";
  
      result = driver(98, 128); 
      cout << "TEST-" << 4 << "..."
           <<  result
           << "\n";
  
      result = driver(94, 128); 
      cout << "TEST-" << 5 << "..."
           <<  result
           << "\n";
  
      result = driver(36, 64); 
      cout << "TEST-" << 6 << "..."
           <<  result
           << "\n";
  
      result = driver(41, 64); 
      cout << "TEST-" << 7 << "..."
           <<  result
           << "\n";
  
      result = driver(74, 128); 
      cout << "TEST-" << 8 << "..."
           <<  result
           << "\n";
  
      result = driver(39, 64); 
      cout << "TEST-" << 9 << "..."
           <<  result
           << "\n";
  
      return 0;
  }
source_py: def smallest_power_of_2_greater_than_or_equal_to_n(n):
      count = 0
      if (n and (not (n & (n - 1)))):
          return n
      while (n != 0):
          n >>= 1
          count += 1
      return (1 << count)
source_cpp: unsigned int smallest_power_of_2_greater_than_or_equal_to_n(unsigned int n) {
    unsigned count = 0;
    if ( n && ! ( n & ( n - 1 ) ) ) return n;
    while ( n != 0 ) {
      n >>= 1;
      count += 1;
    }
    return 1 << count;
  }