title: K Th Prime Factor Given Number
signature: function k_th_prime_factor_given_number(n, k)
test_code: using Printf
  
  # SOLUTION CODE
  # ============================================
  PLACEHOLDER_CODE_BODY
  
  # TESTING CODE 
  # ============================================
  function validate_solution(actual, expected)
      return abs(actual - expected) < 1e-06
  end
  
  function driver(n, k, expected)
      try
  
          if validate_solution(PLACEHOLDER_FN_NAME(n, k), expected)
              return "PASSED";
          end
          return "FAILED";
      catch exception_obj
          return string(Base.typename(typeof(exception_obj)).wrapper);
      end
  end
  
  function main()
      
      result = driver(94, 0, -1.0);
      @printf("TEST-0...%s\n",result);
      
      result = driver(99, 1, 3.0);
      @printf("TEST-1...%s\n",result);
      
      result = driver(64, 3, 2.0);
      @printf("TEST-2...%s\n",result);
      
      result = driver(27, 3, 3.0);
      @printf("TEST-3...%s\n",result);
      
      result = driver(24, 4, 3.0);
      @printf("TEST-4...%s\n",result);
      
      result = driver(84, 6, -1.0);
      @printf("TEST-5...%s\n",result);
      
      result = driver(69, 98, -1.0);
      @printf("TEST-6...%s\n",result);
      
      result = driver(69, 39, -1.0);
      @printf("TEST-7...%s\n",result);
      
      result = driver(22, 60, -1.0);
      @printf("TEST-8...%s\n",result);
      
      result = driver(39, 57, -1.0);
      @printf("TEST-9...%s\n",result);
      
  end
  
  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;
  }