title: Minimize The Sum Of Digits Of A And B Such That A B N
signature: func minimizeTheSumOfDigitsOfAAndBSuchThatABN(n int) int {
test_code: package main
  
  import (
      "fmt"
      "reflect"
      "math"
      "sort"
  )
  
  // SOLUTION CODE
  // ===================================
  PLACEHOLDER_CODE_BODY
  
  // TESTING CODE
  // ===================================
  func validateSolution(actual int, expected int) bool {
      return reflect.DeepEqual(actual,expected)
  }
  
  func driver(n int, expected int) string {
      if validateSolution(PLACEHOLDER_FN_NAME(n),expected) {
              return "PASSED"
      }
      return "FAILED"
  
  }
  
  func main() {
  
      // Use imports to avoid undefined errors
      var _ = reflect.DeepEqual
      _ = math.Abs
      _ = sort.Sort
      result := ""
      result = driver(2, 2)
      fmt.Printf("TEST-0...%s\n", result)
      
      result = driver(39, 12)
      fmt.Printf("TEST-1...%s\n", result)
      
      result = driver(31, 4)
      fmt.Printf("TEST-2...%s\n", result)
      
      result = driver(45, 9)
      fmt.Printf("TEST-3...%s\n", result)
      
      result = driver(35, 8)
      fmt.Printf("TEST-4...%s\n", result)
      
      result = driver(94, 13)
      fmt.Printf("TEST-5...%s\n", result)
      
      result = driver(67, 13)
      fmt.Printf("TEST-6...%s\n", result)
      
      result = driver(50, 5)
      fmt.Printf("TEST-7...%s\n", result)
      
      result = driver(4, 4)
      fmt.Printf("TEST-8...%s\n", result)
      
      result = driver(63, 9)
      fmt.Printf("TEST-9...%s\n", result)
      
          
  }
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;
  }