title: Number Jump Required Given Length Reach Point Form D 0 Origin 2D Plane
signature: function numberJumpRequiredGivenLengthReachPointFormD0Origin2DPlane($a, $b, $d) {
test_code: <?php
  
  
  // SOLUTION CODE 
  // ============================================
  PLACEHOLDER_CODE_BODY
  
  // TESTING CODE 
  // ============================================
  function validateSolution($actual, $expected){
      return abs($actual - $expected) < 1e-09;
  }
  
  function driver($a, $b, $d, $expected){
      try{
        if (validateSolution(PLACEHOLDER_FN_NAME($a, $b, $d), $expected)){
          return "PASSED";
        }
        return "FAILED";
      }
      catch (Exception $exception_obj) {
        return get_class($exception_obj);
      }
  }
  
  function main(){
      printf("TEST-0...%s\n",driver(
        35, 8, 77, 
        3.1714285714285713));
      
      printf("TEST-1...%s\n",driver(
        85, 55, 33, 
        2.0));
      
      printf("TEST-2...%s\n",driver(
        22, 23, 64, 
        3.739130434782609));
      
      printf("TEST-3...%s\n",driver(
        8, 43, 29, 
        2.0));
      
      printf("TEST-4...%s\n",driver(
        12, 64, 11, 
        2.0));
      
      printf("TEST-5...%s\n",driver(
        58, 25, 26, 
        2.0));
      
      printf("TEST-6...%s\n",driver(
        65, 4, 28, 
        2.0));
      
      printf("TEST-7...%s\n",driver(
        10, 95, 55, 
        2.0));
      
      printf("TEST-8...%s\n",driver(
        23, 13, 54, 
        3.3043478260869565));
      
      printf("TEST-9...%s\n",driver(
        5, 50, 71, 
        2.4));
      
  }
  
  main();
  ?>
source_py: def number_jump_required_given_length_reach_point_form_d_0_origin_2d_plane(a, b, d):
      temp = a
      a = min(a, b)
      b = max(temp, b)
      if (d >= b):
          return (((d + b) - 1) / b)
      if (d == 0):
          return 0
      if (d == a):
          return 1
      return 2
source_cpp: int number_jump_required_given_length_reach_point_form_d_0_origin_2d_plane(int a, int b, int d) {
    int temp = a;
    a = min ( a, b );
    b = max ( temp, b );
    if ( d >= b ) return ( d + b - 1 ) / b;
    if ( d == 0 ) return 0;
    if ( d == a ) return 1;
    return 2;
  }