title: K Th Prime Factor Given Number
signature: fun kThPrimeFactorGivenNumber(n: Int, k: Int): Float {
test_code: package main
  
  import kotlin.text.*
  import kotlin.math.*
  
  
  // SOLUTION CODE
  // ===================================
  PLACEHOLDER_CODE_BODY
  
  // TESTING CODE
  // ===================================
  fun validateSolution(actual:Float, expected:Float):Boolean{
    return abs(actual - expected) < 1e-06f
  }
  fun driver(n: Int, k: Int, expected:Float):String {
      try{
        if (validateSolution(PLACEHOLDER_FN_NAME(n, k), expected)) {
                return "PASSED"
        }
        return "FAILED"
      } catch (e: Exception){
        return e::class.simpleName as String
      }
  
  }
  
  fun main() {
      var result: String = ""
      result = driver(94, 0, -1.0f)
      println("TEST-0...${result}")
      
      result = driver(99, 1, 3.0f)
      println("TEST-1...${result}")
      
      result = driver(64, 3, 2.0f)
      println("TEST-2...${result}")
      
      result = driver(27, 3, 3.0f)
      println("TEST-3...${result}")
      
      result = driver(24, 4, 3.0f)
      println("TEST-4...${result}")
      
      result = driver(84, 6, -1.0f)
      println("TEST-5...${result}")
      
      result = driver(69, 98, -1.0f)
      println("TEST-6...${result}")
      
      result = driver(69, 39, -1.0f)
      println("TEST-7...${result}")
      
      result = driver(22, 60, -1.0f)
      println("TEST-8...${result}")
      
      result = driver(39, 57, -1.0f)
      println("TEST-9...${result}")
      
          
  }
  
  main()
source_py: def k_th_prime_factor_given_number(n, k):
      while ((n % 2) == 0):
          k = (k - 1)
          n = (n / 2)
          if (k == 0):
              return 2
      i = 3
      while (i <= math.sqrt(n)):
          while ((n % i) == 0):
              if (k == 1):
                  return i
              k = (k - 1)
              n = (n / i)
          i = (i + 2)
      if ((n > 2) and (k == 1)):
          return n
      return (- 1)
source_cpp: int k_th_prime_factor_given_number(int n, int k) {
    while ( n % 2 == 0 ) {
      k --;
      n = n / 2;
      if ( k == 0 ) return 2;
    }
    for ( int i = 3;
    i <= sqrt ( n );
    i = i + 2 ) {
      while ( n % i == 0 ) {
        if ( k == 1 ) return i;
        k --;
        n = n / i;
      }
    }
    if ( n > 2 && k == 1 ) return n;
    return - 1;
  }