title: Paper Cut Minimum Number Squares
signature: def paperCutMinimumNumberSquares(a: Int, b: Int) = {
test_code: import scala.collection.mutable.HashMap
  import scala.collection.immutable.HashSet
  
  
  // SOLUTION CODE
  // ============================================
  PLACEHOLDER_CODE_BODY
  
  
  // TESTING CODE 
  // ============================================
  def validateSolution(actual: Int , expected: Int): Boolean = {
      actual.toString == expected.toString
  }
  
  def driver(a: Int, b: Int, expected: Int): String = {
      try {
          if (validateSolution(PLACEHOLDER_FN_NAME(a, b),expected)) {
              "PASSED"
          } else{
              "FAILED"
          }
      }catch{
          case e: Exception => {e.getClass.getName}
      }
  
  }
  object QuestionEvaluator extends App {
  
      println(s"TEST-0...${driver(
        87, 60, 
        9    
      )}")   
  
  
      println(s"TEST-1...${driver(
        18, 35, 
        19    
      )}")   
  
  
      println(s"TEST-2...${driver(
        68, 93, 
        11    
      )}")   
  
  
      println(s"TEST-3...${driver(
        80, 20, 
        4    
      )}")   
  
  
      println(s"TEST-4...${driver(
        87, 69, 
        10    
      )}")   
  
  
      println(s"TEST-5...${driver(
        64, 29, 
        12    
      )}")   
  
  
      println(s"TEST-6...${driver(
        64, 1, 
        64    
      )}")   
  
  
      println(s"TEST-7...${driver(
        65, 95, 
        9    
      )}")   
  
  
      println(s"TEST-8...${driver(
        43, 72, 
        18    
      )}")   
  
  
      println(s"TEST-9...${driver(
        97, 41, 
        11    
      )}")   
  
  }
  
source_py: def paper_cut_minimum_number_squares(a, b):
      result = 0
      rem = 0
      if (a < b):
          (a, b) = (b, a)
      while (b > 0):
          result += int((a / b))
          rem = int((a % b))
          a = b
          b = rem
      return result
source_cpp: int paper_cut_minimum_number_squares(int a, int b) {
    long long result = 0, rem = 0;
    if ( a < b ) swap ( a, b );
    while ( b > 0 ) {
      result += a / b;
      long long rem = a % b;
      a = b;
      b = rem;
    }
    return result;
  }