title: K Th Prime Factor Given Number
signature: kThPrimeFactorGivenNumber(n, k) {
test_code: import 'dart:convert';
  
  // SOLUTION CODE
  // ============================================
  PLACEHOLDER_CODE_BODY
  
  // TESTING CODE 
  // ============================================
  bool validateSolution(double actual, double expected){
      return (actual - expected).abs() < 1e-06;
  }
  
  String driver(n, k, double expected){
      try
      {
          if (validateSolution(PLACEHOLDER_FN_NAME(n, k), expected)){
              return "PASSED";
          }
          return "FAILED";
      }catch(exception_object){
          return exception_object.runtimeType.toString();
      }
  }
  
  int main() {
  
      print("TEST-0...${driver(
          94, 0, 
          -1.0)
      }");
  
      print("TEST-1...${driver(
          99, 1, 
          3.0)
      }");
  
      print("TEST-2...${driver(
          64, 3, 
          2.0)
      }");
  
      print("TEST-3...${driver(
          27, 3, 
          3.0)
      }");
  
      print("TEST-4...${driver(
          24, 4, 
          3.0)
      }");
  
      print("TEST-5...${driver(
          84, 6, 
          -1.0)
      }");
  
      print("TEST-6...${driver(
          69, 98, 
          -1.0)
      }");
  
      print("TEST-7...${driver(
          69, 39, 
          -1.0)
      }");
  
      print("TEST-8...${driver(
          22, 60, 
          -1.0)
      }");
  
      print("TEST-9...${driver(
          39, 57, 
          -1.0)
      }");
  
      return 0;
  }
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;
  }