title: Efficient Way Check Whether N Th Fibonacci Number Multiple 10
signature: function efficient_way_check_whether_n_th_fibonacci_number_multiple_10(n)
test_code: using Printf
  
  # SOLUTION CODE
  # ============================================
  PLACEHOLDER_CODE_BODY
  
  # TESTING CODE 
  # ============================================
  function validate_solution(actual, expected)
      return actual == expected
  end
  
  function driver(n, expected)
      try
  
          if validate_solution(PLACEHOLDER_FN_NAME(n), expected)
              return "PASSED";
          end
          return "FAILED";
      catch exception_obj
          return string(Base.typename(typeof(exception_obj)).wrapper);
      end
  end
  
  function main()
      
      result = driver(30, true);
      @printf("TEST-0...%s\n",result);
      
      result = driver(-30, true);
      @printf("TEST-1...%s\n",result);
      
      result = driver(60, true);
      @printf("TEST-2...%s\n",result);
      
      result = driver(90, true);
      @printf("TEST-3...%s\n",result);
      
      result = driver(99, false);
      @printf("TEST-4...%s\n",result);
      
      result = driver(32, false);
      @printf("TEST-5...%s\n",result);
      
      result = driver(21, false);
      @printf("TEST-6...%s\n",result);
      
      result = driver(65, false);
      @printf("TEST-7...%s\n",result);
      
      result = driver(21, false);
      @printf("TEST-8...%s\n",result);
      
      result = driver(99, false);
      @printf("TEST-9...%s\n",result);
      
  end
  
  main()
source_py: def efficient_way_check_whether_n_th_fibonacci_number_multiple_10(n):
      return ((n % 15) == 0)
source_cpp: bool efficient_way_check_whether_n_th_fibonacci_number_multiple_10(int n) {
    return ( n % 15 == 0 );
  }