title: Minimize The Sum Of Digits Of A And B Such That A B N
signature: function minimize_the_sum_of_digits_of_a_and_b_such_that_a_b_n(n)
test_code: using Printf
  
  # SOLUTION CODE
  # ============================================
  PLACEHOLDER_CODE_BODY
  
  # TESTING CODE 
  # ============================================
  function validate_solution(actual, expected)
      return actual == expected
  end
  
  function driver(n, expected)
      try
  
          if validate_solution(PLACEHOLDER_FN_NAME(n), expected)
              return "PASSED";
          end
          return "FAILED";
      catch exception_obj
          return string(Base.typename(typeof(exception_obj)).wrapper);
      end
  end
  
  function main()
      
      result = driver(2, 2);
      @printf("TEST-0...%s\n",result);
      
      result = driver(39, 12);
      @printf("TEST-1...%s\n",result);
      
      result = driver(31, 4);
      @printf("TEST-2...%s\n",result);
      
      result = driver(45, 9);
      @printf("TEST-3...%s\n",result);
      
      result = driver(35, 8);
      @printf("TEST-4...%s\n",result);
      
      result = driver(94, 13);
      @printf("TEST-5...%s\n",result);
      
      result = driver(67, 13);
      @printf("TEST-6...%s\n",result);
      
      result = driver(50, 5);
      @printf("TEST-7...%s\n",result);
      
      result = driver(4, 4);
      @printf("TEST-8...%s\n",result);
      
      result = driver(63, 9);
      @printf("TEST-9...%s\n",result);
      
  end
  
  main()
source_py: def minimize_the_sum_of_digits_of_a_and_b_such_that_a_b_n(n):
      sum = 0
      while (n > 0):
          sum += (n % 10)
          n //= 10
      if (sum == 1):
          return 10
      return sum
source_cpp: int minimize_the_sum_of_digits_of_a_and_b_such_that_a_b_n(int n) {
    int sum = 0;
    while ( n > 0 ) {
      sum += ( n % 10 );
      n /= 10;
    }
    if ( sum == 1 ) return 10;
    return sum;
  }