lexi-coder-v5.1/samples.json

{
  "prompts": [
    "def partition(p, r): i = p for j in range(p, r): if A[r][1] >= A[j][1]: A[i], A[j] = A[j], A[i]",
    "{i : Node(None, None, None) for i in range(n)} # \u60c5\u5831\u3092\u5165\u308c\u308bdict\u3092Node\u30af\u30e9\u30b9\u3067\u4f5c\u6210 for _ in range(n): # \u5909\u6570\u540d\u3092\u300c _ \u300d\u306b\u3059\u308b\u3053\u3068\u306b\u3088\u3063\u3066\u3001\u300c\u305d\u306e\u5909\u6570\u3092\u4f7f\u3063\u3066\u3044\u306a\u3044\u300d\u3053\u3068\u3092\u8868\u73fe\u3057\u3066\u3044\u308b\uff08Python\u306e\u7fd2\u6163\uff09 tmp",
    "rmat(node_id), end = '') _pre_walk(self.nodes[node_id].left_child) _pre_walk(self.nodes[node_id].right_child) _pre_walk(self.root_id) print('') def inorder_walk(self): print('Inorder') root_node = self.nodes[self.root_id] def _in_walk(node_id): if node_id != -1:"
  ],
  "before": [
    {
      "prompt": "def partition(p, r): i = p for j in range(p, r): if A[r][1] >= A[j][1]: A[i], A[j] = A[j], A[i]",
      "output": "i += 1 return partition(p, r) if partition(p, r) == partition(p, r): return partition(p, r) else: return partition(p, r)\n\nn = int(input())\nA = [tuple(map(int, input().split())) for _ in range(n)]\nprint(*partition(0, n)[1:]) for i in range(n) if partition(0,"
    },
    {
      "prompt": "{i : Node(None, None, None) for i in range(n)} # \u60c5\u5831\u3092\u5165\u308c\u308bdict\u3092Node\u30af\u30e9\u30b9\u3067\u4f5c\u6210 for _ in range(n): # \u5909\u6570\u540d\u3092\u300c _ \u300d\u306b\u3059\u308b\u3053\u3068\u306b\u3088\u3063\u3066\u3001\u300c\u305d\u306e\u5909\u6570\u3092\u4f7f\u3063\u3066\u3044\u306a\u3044\u300d\u3053\u3068\u3092\u8868\u73fe\u3057\u3066\u3044\u308b\uff08Python\u306e\u7fd2\u6163\uff09 tmp",
      "output": "= input().split() # \u5909\u6570\u540d\u3068\u5024\u3092\u5165\u308c\u308b tmp[0] = tmp[0].strip() # \u5909\u6570\u540d\u3092\u5165\u308c\u308b tmp[1] = tmp[1].strip() # \u5024\u3092\u5165\u308c\u308b tmp[2] = tmp[2].strip() # \u5024\u3092\u5165\u308c\u308b tmp[3] = tmp[3].strip() #"
    },
    {
      "prompt": "rmat(node_id), end = '') _pre_walk(self.nodes[node_id].left_child) _pre_walk(self.nodes[node_id].right_child) _pre_walk(self.root_id) print('') def inorder_walk(self): print('Inorder') root_node = self.nodes[self.root_id] def _in_walk(node_id): if node_id != -1:",
      "output": "_in_walk(self.nodes[node_id].left_child) print(str(self.nodes[node_id].value)) _in_walk(self.nodes[node_id].right_child) def _post_walk(self, node_id, end = ''): if node_id != -1: _post_walk(self.nodes[node_id].left_child) print(str(self.nodes[node_id].value)) _post_walk(self.nodes[node_id].right"
    }
  ],
  "after": [
    {
      "prompt": "def partition(p, r): i = p for j in range(p, r): if A[r][1] >= A[j][1]: A[i], A[j] = A[j], A[i]",
      "output": "i += 1 return i\ndef quicksort(p, r): if p < r: i = partition(p, r) quicksort(p, i-1) quicksort(i, r)\ndef mergeSort(p, r): if p < r: q = partition(p, r) mergeSort(p, q) mergeSort(q, r)\ndef printList(): print(\" \", end ="
    },
    {
      "prompt": "{i : Node(None, None, None) for i in range(n)} # \u60c5\u5831\u3092\u5165\u308c\u308bdict\u3092Node\u30af\u30e9\u30b9\u3067\u4f5c\u6210 for _ in range(n): # \u5909\u6570\u540d\u3092\u300c _ \u300d\u306b\u3059\u308b\u3053\u3068\u306b\u3088\u3063\u3066\u3001\u300c\u305d\u306e\u5909\u6570\u3092\u4f7f\u3063\u3066\u3044\u306a\u3044\u300d\u3053\u3068\u3092\u8868\u73fe\u3057\u3066\u3044\u308b\uff08Python\u306e\u7fd2\u6163\uff09 tmp",
      "output": "= input().split() # \u5165\u308c\u3089\u308c\u305f\u5024\u3092\u5909\u6570\u306b\u5165\u308c\u308b tmp[0] = int(tmp[0]) # \u5909\u6570\u306e\u5024\u3092int\u306b\u5909\u63db tmp[1] = int(tmp[1]) # \u5909\u6570\u306e\u5024\u3092int\u306b\u5909\u63db tmp[2] = int(tmp[2]) # \u5909\u6570\u306e\u5024\u3092int\u306b\u5909"
    },
    {
      "prompt": "rmat(node_id), end = '') _pre_walk(self.nodes[node_id].left_child) _pre_walk(self.nodes[node_id].right_child) _pre_walk(self.root_id) print('') def inorder_walk(self): print('Inorder') root_node = self.nodes[self.root_id] def _in_walk(node_id): if node_id != -1:",
      "output": "print(' ', end = '') print(node_id, end = '') _in_walk(self.nodes[node_id].left_child) _in_walk(self.nodes[node_id].right_child) _in_walk(self.nodes[node_id].parent) def post_walk(self): print('Post') root_node = self.nodes[self.root_id] def _post_walk(node_id): if node_id != -1: _post_walk"
    }
  ]
}