| {"messages": [{"role": "system", "content": "You are Kumo, an expert Python programmer. Solve the task. Put the complete, runnable solution in a single ```python code block. Do not include tests or example usage in the code block."}, {"role": "user", "content": "Write a Python function that solves this task:\n\nWrite a python function to remove first and last occurrence of a given character from the string.\n\nIt must satisfy these tests:\n```python\nassert remove_Occ(\"hello\",\"l\") == \"heo\"\nassert remove_Occ(\"abcda\",\"a\") == \"bcd\"\nassert remove_Occ(\"PHP\",\"P\") == \"H\"\n```"}, {"role": "assistant", "content": "```python\ndef remove_Occ(s,ch): \r\n for i in range(len(s)): \r\n if (s[i] == ch): \r\n s = s[0 : i] + s[i + 1:] \r\n break\r\n for i in range(len(s) - 1,-1,-1): \r\n if (s[i] == ch): \r\n s = s[0 : i] + s[i + 1:] \r\n break\r\n return s\n```"}], "source": "mbpp_train", "hash": "fa9b9c0cd2b536ed2ee7ca339163795a62c25325", "meta": {"id": "mbpp/11"}} | |
| {"messages": [{"role": "system", "content": "You are Kumo, an expert Python programmer. Solve the task. Put the complete, runnable solution in a single ```python code block. Do not include tests or example usage in the code block."}, {"role": "user", "content": "Complete the following Python function. Return the full function (signature, docstring and body) in a ```python code block.\n\n```python\ndef remove_Occ(s,ch):\n \"\"\"Write a python function to remove first and last occurrence of a given character from the string.\"\"\"\n```"}, {"role": "assistant", "content": "```python\ndef remove_Occ(s,ch): \r\n for i in range(len(s)): \r\n if (s[i] == ch): \r\n s = s[0 : i] + s[i + 1:] \r\n break\r\n for i in range(len(s) - 1,-1,-1): \r\n if (s[i] == ch): \r\n s = s[0 : i] + s[i + 1:] \r\n break\r\n return s\n```"}], "source": "mbpp_train_he", "hash": "10f1d3978f765c3b2a9ee95c6bb9e602ff2bb4bc", "meta": {"id": "mbpp/11"}} | |
| {"messages": [{"role": "system", "content": "You are Kumo, an expert Python programmer. Solve the task. Put the complete, runnable solution in a single ```python code block. Do not include tests or example usage in the code block."}, {"role": "user", "content": "Write a Python function that solves this task:\n\nWrite a function to sort a given matrix in ascending order according to the sum of its rows.\n\nIt must satisfy these tests:\n```python\nassert sort_matrix([[1, 2, 3], [2, 4, 5], [1, 1, 1]])==[[1, 1, 1], [1, 2, 3], [2, 4, 5]]\nassert sort_matrix([[1, 2, 3], [-2, 4, -5], [1, -1, 1]])==[[-2, 4, -5], [1, -1, 1], [1, 2, 3]]\nassert sort_matrix([[5,8,9],[6,4,3],[2,1,4]])==[[2, 1, 4], [6, 4, 3], [5, 8, 9]]\n```"}, {"role": "assistant", "content": "```python\ndef sort_matrix(M):\r\n result = sorted(M, key=sum)\r\n return result\n```"}], "source": "mbpp_train", "hash": "ba66b3bb4a48834f79cd328b1bdce675042b31a6", "meta": {"id": "mbpp/12"}} | |
| {"messages": [{"role": "system", "content": "You are Kumo, an expert Python programmer. Solve the task. Put the complete, runnable solution in a single ```python code block. Do not include tests or example usage in the code block."}, {"role": "user", "content": "Complete the following Python function. Return the full function (signature, docstring and body) in a ```python code block.\n\n```python\ndef sort_matrix(M):\n \"\"\"Write a function to sort a given matrix in ascending order according to the sum of its rows.\"\"\"\n```"}, {"role": "assistant", "content": "```python\ndef sort_matrix(M):\r\n result = sorted(M, key=sum)\r\n return result\n```"}], "source": "mbpp_train_he", "hash": "76478a5c0a9d994155a3d453f8bb7ec33319ba54", "meta": {"id": "mbpp/12"}} | |
| {"messages": [{"role": "system", "content": "You are Kumo, an expert Python programmer. Solve the task. Put the complete, runnable solution in a single ```python code block. Do not include tests or example usage in the code block."}, {"role": "user", "content": "Write a Python function that solves this task:\n\nWrite a function to count the most common words in a dictionary.\n\nIt must satisfy these tests:\n```python\nassert count_common(['red','green','black','pink','black','white','black','eyes','white','black','orange','pink','pink','red','red','white','orange','white',\"black\",'pink','green','green','pink','green','pink','white','orange',\"orange\",'red']) == [('pink', 6), ('black', 5), ('white', 5), ('red', 4)]\nassert count_common(['one', 'two', 'three', 'four', 'five', 'one', 'two', 'one', 'three', 'one']) == [('one', 4), ('two', 2), ('three', 2), ('four', 1)]\nassert count_common(['Facebook', 'Apple', 'Amazon', 'Netflix', 'Google', 'Apple', 'Netflix', 'Amazon']) == [('Apple', 2), ('Amazon', 2), ('Netflix', 2), ('Facebook', 1)]\n```"}, {"role": "assistant", "content": "```python\nfrom collections import Counter\r\ndef count_common(words):\r\n word_counts = Counter(words)\r\n top_four = word_counts.most_common(4)\r\n return (top_four)\n```"}], "source": "mbpp_train", "hash": "bd8689f85ad6b60f0e771c97dd1f28cdc695193f", "meta": {"id": "mbpp/13"}} | |
| {"messages": [{"role": "system", "content": "You are Kumo, an expert Python programmer. Solve the task. Put the complete, runnable solution in a single ```python code block. Do not include tests or example usage in the code block."}, {"role": "user", "content": "Complete the following Python function. Return the full function (signature, docstring and body) in a ```python code block.\n\n```python\ndef count_common(words):\n \"\"\"Write a function to count the most common words in a dictionary.\"\"\"\n```"}, {"role": "assistant", "content": "```python\nfrom collections import Counter\r\ndef count_common(words):\r\n word_counts = Counter(words)\r\n top_four = word_counts.most_common(4)\r\n return (top_four)\n```"}], "source": "mbpp_train_he", "hash": "d3ee369782748cb7594af9dc818a38a4c63b0b1d", "meta": {"id": "mbpp/13"}} | |
| {"messages": [{"role": "system", "content": "You are Kumo, an expert Python programmer. Solve the task. Put the complete, runnable solution in a single ```python code block. Do not include tests or example usage in the code block."}, {"role": "user", "content": "Write a Python function that solves this task:\n\nWrite a python function to find the volume of a triangular prism.\n\nIt must satisfy these tests:\n```python\nassert find_Volume(10,8,6) == 240\nassert find_Volume(3,2,2) == 6\nassert find_Volume(1,2,1) == 1\n```"}, {"role": "assistant", "content": "```python\ndef find_Volume(l,b,h) : \r\n return ((l * b * h) / 2)\n```"}], "source": "mbpp_train", "hash": "928087844489f7b68e983a7511ad045bf3d29158", "meta": {"id": "mbpp/14"}} | |
| {"messages": [{"role": "system", "content": "You are Kumo, an expert Python programmer. Solve the task. Put the complete, runnable solution in a single ```python code block. Do not include tests or example usage in the code block."}, {"role": "user", "content": "Complete the following Python function. Return the full function (signature, docstring and body) in a ```python code block.\n\n```python\ndef find_Volume(l,b,h) :\n \"\"\"Write a python function to find the volume of a triangular prism.\"\"\"\n```"}, {"role": "assistant", "content": "```python\ndef find_Volume(l,b,h) : \r\n return ((l * b * h) / 2)\n```"}], "source": "mbpp_train_he", "hash": "571ac0e4e4bcf35e57b8a3deba4216567feeb3eb", "meta": {"id": "mbpp/14"}} | |
| {"messages": [{"role": "system", "content": "You are Kumo, an expert Python programmer. Solve the task. Put the complete, runnable solution in a single ```python code block. Do not include tests or example usage in the code block."}, {"role": "user", "content": "Write a Python function that solves this task:\n\nWrite a function to split a string at lowercase letters.\n\nIt must satisfy these tests:\n```python\nassert split_lowerstring(\"AbCd\")==['bC','d']\nassert split_lowerstring(\"Python\")==['y', 't', 'h', 'o', 'n']\nassert split_lowerstring(\"Programming\")==['r', 'o', 'g', 'r', 'a', 'm', 'm', 'i', 'n', 'g']\n```"}, {"role": "assistant", "content": "```python\nimport re\r\ndef split_lowerstring(text):\r\n return (re.findall('[a-z][^a-z]*', text))\n```"}], "source": "mbpp_train", "hash": "5c0799c09654b330275c982e8409ab6b91d635e0", "meta": {"id": "mbpp/15"}} | |
| {"messages": [{"role": "system", "content": "You are Kumo, an expert Python programmer. Solve the task. Put the complete, runnable solution in a single ```python code block. Do not include tests or example usage in the code block."}, {"role": "user", "content": "Complete the following Python function. Return the full function (signature, docstring and body) in a ```python code block.\n\n```python\ndef split_lowerstring(text):\n \"\"\"Write a function to split a string at lowercase letters.\"\"\"\n```"}, {"role": "assistant", "content": "```python\nimport re\r\ndef split_lowerstring(text):\r\n return (re.findall('[a-z][^a-z]*', text))\n```"}], "source": "mbpp_train_he", "hash": "2e481306b30101c56597e9f97dc5fd7c77b888c5", "meta": {"id": "mbpp/15"}} | |
| {"messages": [{"role": "system", "content": "You are Kumo, an expert Python programmer. Solve the task. Put the complete, runnable solution in a single ```python code block. Do not include tests or example usage in the code block."}, {"role": "user", "content": "Write a Python function that solves this task:\n\nWrite a function to find sequences of lowercase letters joined with an underscore.\n\nIt must satisfy these tests:\n```python\nassert text_lowercase_underscore(\"aab_cbbbc\")==('Found a match!')\nassert text_lowercase_underscore(\"aab_Abbbc\")==('Not matched!')\nassert text_lowercase_underscore(\"Aaab_abbbc\")==('Not matched!')\n```"}, {"role": "assistant", "content": "```python\nimport re\r\ndef text_lowercase_underscore(text):\r\n patterns = '^[a-z]+_[a-z]+$'\r\n if re.search(patterns, text):\r\n return 'Found a match!'\r\n else:\r\n return('Not matched!')\n```"}], "source": "mbpp_train", "hash": "93f225d73c3630caa55bab88237b1e31d1659c58", "meta": {"id": "mbpp/16"}} | |
| {"messages": [{"role": "system", "content": "You are Kumo, an expert Python programmer. Solve the task. Put the complete, runnable solution in a single ```python code block. Do not include tests or example usage in the code block."}, {"role": "user", "content": "Complete the following Python function. Return the full function (signature, docstring and body) in a ```python code block.\n\n```python\ndef text_lowercase_underscore(text):\n \"\"\"Write a function to find sequences of lowercase letters joined with an underscore.\"\"\"\n```"}, {"role": "assistant", "content": "```python\nimport re\r\ndef text_lowercase_underscore(text):\r\n patterns = '^[a-z]+_[a-z]+$'\r\n if re.search(patterns, text):\r\n return 'Found a match!'\r\n else:\r\n return('Not matched!')\n```"}], "source": "mbpp_train_he", "hash": "04f31b4ebc8559b2e2468f74e1ff31e4f9cd8694", "meta": {"id": "mbpp/16"}} | |
| {"messages": [{"role": "system", "content": "You are Kumo, an expert Python programmer. Solve the task. Put the complete, runnable solution in a single ```python code block. Do not include tests or example usage in the code block."}, {"role": "user", "content": "Write a Python function that solves this task:\n\nWrite a function to find the perimeter of a square.\n\nIt must satisfy these tests:\n```python\nassert square_perimeter(10)==40\nassert square_perimeter(5)==20\nassert square_perimeter(4)==16\n```"}, {"role": "assistant", "content": "```python\ndef square_perimeter(a):\r\n perimeter=4*a\r\n return perimeter\n```"}], "source": "mbpp_train", "hash": "9921b58235cf76ae7fa153d2fdcbb40c5a2056f0", "meta": {"id": "mbpp/17"}} | |
| {"messages": [{"role": "system", "content": "You are Kumo, an expert Python programmer. Solve the task. Put the complete, runnable solution in a single ```python code block. Do not include tests or example usage in the code block."}, {"role": "user", "content": "Complete the following Python function. Return the full function (signature, docstring and body) in a ```python code block.\n\n```python\ndef square_perimeter(a):\n \"\"\"Write a function to find the perimeter of a square.\"\"\"\n```"}, {"role": "assistant", "content": "```python\ndef square_perimeter(a):\r\n perimeter=4*a\r\n return perimeter\n```"}], "source": "mbpp_train_he", "hash": "10883db00c1b1a706bb82748e2237c65d2c477d4", "meta": {"id": "mbpp/17"}} | |
| {"messages": [{"role": "system", "content": "You are Kumo, an expert Python programmer. Solve the task. Put the complete, runnable solution in a single ```python code block. Do not include tests or example usage in the code block."}, {"role": "user", "content": "Write a Python function that solves this task:\n\nWrite a function to remove characters from the first string which are present in the second string.\n\nIt must satisfy these tests:\n```python\nassert remove_dirty_chars(\"probasscurve\", \"pros\") == 'bacuve'\nassert remove_dirty_chars(\"digitalindia\", \"talent\") == 'digiidi'\nassert remove_dirty_chars(\"exoticmiles\", \"toxic\") == 'emles' \n```"}, {"role": "assistant", "content": "```python\nNO_OF_CHARS = 256\r\ndef str_to_list(string): \r\n\ttemp = [] \r\n\tfor x in string: \r\n\t\ttemp.append(x) \r\n\treturn temp \r\ndef lst_to_string(List): \r\n\treturn ''.join(List) \r\ndef get_char_count_array(string): \r\n\tcount = [0] * NO_OF_CHARS \r\n\tfor i in string: \r\n\t\tcount[ord(i)] += 1\r\n\treturn count \r\ndef remove_dirty_chars(string, second_string): \r\n\tcount = get_char_count_array(second_string) \r\n\tip_ind = 0\r\n\tres_ind = 0\r\n\ttemp = '' \r\n\tstr_list = str_to_list(string) \r\n\twhile ip_ind != len(str_list): \r\n\t\ttemp = str_list[ip_ind] \r\n\t\tif count[ord(temp)] == 0: \r\n\t\t\tstr_list[res_ind] = str_list[ip_ind] \r\n\t\t\tres_ind += 1\r\n\t\tip_ind+=1\r\n\treturn lst_to_string(str_list[0:res_ind])\n```"}], "source": "mbpp_train", "hash": "ead5b31b8e71187d6991525d7012eaece34df17a", "meta": {"id": "mbpp/18"}} | |
| {"messages": [{"role": "system", "content": "You are Kumo, an expert Python programmer. Solve the task. Put the complete, runnable solution in a single ```python code block. Do not include tests or example usage in the code block."}, {"role": "user", "content": "Complete the following Python function. Return the full function (signature, docstring and body) in a ```python code block.\n\n```python\ndef str_to_list(string):\n \"\"\"Write a function to remove characters from the first string which are present in the second string.\"\"\"\n```"}, {"role": "assistant", "content": "```python\nNO_OF_CHARS = 256\r\ndef str_to_list(string): \r\n\ttemp = [] \r\n\tfor x in string: \r\n\t\ttemp.append(x) \r\n\treturn temp \r\ndef lst_to_string(List): \r\n\treturn ''.join(List) \r\ndef get_char_count_array(string): \r\n\tcount = [0] * NO_OF_CHARS \r\n\tfor i in string: \r\n\t\tcount[ord(i)] += 1\r\n\treturn count \r\ndef remove_dirty_chars(string, second_string): \r\n\tcount = get_char_count_array(second_string) \r\n\tip_ind = 0\r\n\tres_ind = 0\r\n\ttemp = '' \r\n\tstr_list = str_to_list(string) \r\n\twhile ip_ind != len(str_list): \r\n\t\ttemp = str_list[ip_ind] \r\n\t\tif count[ord(temp)] == 0: \r\n\t\t\tstr_list[res_ind] = str_list[ip_ind] \r\n\t\t\tres_ind += 1\r\n\t\tip_ind+=1\r\n\treturn lst_to_string(str_list[0:res_ind])\n```"}], "source": "mbpp_train_he", "hash": "daf926d735ebfd6b32fe4106294b42bef31e97e6", "meta": {"id": "mbpp/18"}} | |
| {"messages": [{"role": "system", "content": "You are Kumo, an expert Python programmer. Solve the task. Put the complete, runnable solution in a single ```python code block. Do not include tests or example usage in the code block."}, {"role": "user", "content": "Write a Python function that solves this task:\n\nWrite a function to find whether a given array of integers contains any duplicate element.\n\nIt must satisfy these tests:\n```python\nassert test_duplicate(([1,2,3,4,5]))==False\nassert test_duplicate(([1,2,3,4, 4]))==True\nassert test_duplicate([1,1,2,2,3,3,4,4,5])==True\n```"}, {"role": "assistant", "content": "```python\ndef test_duplicate(arraynums):\r\n nums_set = set(arraynums) \r\n return len(arraynums) != len(nums_set)\n```"}], "source": "mbpp_train", "hash": "1b28feefbe4143badbd7fdb5d12bb68e3ad09dc7", "meta": {"id": "mbpp/19"}} | |
| {"messages": [{"role": "system", "content": "You are Kumo, an expert Python programmer. Solve the task. Put the complete, runnable solution in a single ```python code block. Do not include tests or example usage in the code block."}, {"role": "user", "content": "Complete the following Python function. Return the full function (signature, docstring and body) in a ```python code block.\n\n```python\ndef test_duplicate(arraynums):\n \"\"\"Write a function to find whether a given array of integers contains any duplicate element.\"\"\"\n```"}, {"role": "assistant", "content": "```python\ndef test_duplicate(arraynums):\r\n nums_set = set(arraynums) \r\n return len(arraynums) != len(nums_set)\n```"}], "source": "mbpp_train_he", "hash": "e6c7bc79f56bd1d753c88cc10a88dcb65758db06", "meta": {"id": "mbpp/19"}} | |
| {"messages": [{"role": "system", "content": "You are Kumo, an expert Python programmer. Solve the task. Put the complete, runnable solution in a single ```python code block. Do not include tests or example usage in the code block."}, {"role": "user", "content": "Write a Python function that solves this task:\n\nWrite a function to check if the given number is woodball or not.\n\nIt must satisfy these tests:\n```python\nassert is_woodall(383) == True\nassert is_woodall(254) == False\nassert is_woodall(200) == False\n```"}, {"role": "assistant", "content": "```python\ndef is_woodall(x): \r\n\tif (x % 2 == 0): \r\n\t\treturn False\r\n\tif (x == 1): \r\n\t\treturn True\r\n\tx = x + 1 \r\n\tp = 0\r\n\twhile (x % 2 == 0): \r\n\t\tx = x/2\r\n\t\tp = p + 1\r\n\t\tif (p == x): \r\n\t\t\treturn True\r\n\treturn False\n```"}], "source": "mbpp_train", "hash": "bb57c6935f9c600ac7ea0a12f68e98b5a1bb7b85", "meta": {"id": "mbpp/20"}} | |
| {"messages": [{"role": "system", "content": "You are Kumo, an expert Python programmer. Solve the task. Put the complete, runnable solution in a single ```python code block. Do not include tests or example usage in the code block."}, {"role": "user", "content": "Complete the following Python function. Return the full function (signature, docstring and body) in a ```python code block.\n\n```python\ndef is_woodall(x):\n \"\"\"Write a function to check if the given number is woodball or not.\"\"\"\n```"}, {"role": "assistant", "content": "```python\ndef is_woodall(x): \r\n\tif (x % 2 == 0): \r\n\t\treturn False\r\n\tif (x == 1): \r\n\t\treturn True\r\n\tx = x + 1 \r\n\tp = 0\r\n\twhile (x % 2 == 0): \r\n\t\tx = x/2\r\n\t\tp = p + 1\r\n\t\tif (p == x): \r\n\t\t\treturn True\r\n\treturn False\n```"}], "source": "mbpp_train_he", "hash": "c9bc567dfa2d4f1e2253cf46eb0f0a507901afdb", "meta": {"id": "mbpp/20"}} | |
| {"messages": [{"role": "system", "content": "You are Kumo, an expert Python programmer. Solve the task. Put the complete, runnable solution in a single ```python code block. Do not include tests or example usage in the code block."}, {"role": "user", "content": "Write a Python function that solves this task:\n\nWrite a function to find m number of multiples of n.\n\nIt must satisfy these tests:\n```python\nassert multiples_of_num(4,3)== [3,6,9,12]\nassert multiples_of_num(2,5)== [5,10]\nassert multiples_of_num(9,2)== [2,4,6,8,10,12,14,16,18]\n```"}, {"role": "assistant", "content": "```python\ndef multiples_of_num(m,n): \r\n multiples_of_num= list(range(n,(m+1)*n, n)) \r\n return list(multiples_of_num)\n```"}], "source": "mbpp_train", "hash": "f773eb271d430f330c532b0717c9f7a69494af13", "meta": {"id": "mbpp/21"}} | |
| {"messages": [{"role": "system", "content": "You are Kumo, an expert Python programmer. Solve the task. Put the complete, runnable solution in a single ```python code block. Do not include tests or example usage in the code block."}, {"role": "user", "content": "Complete the following Python function. Return the full function (signature, docstring and body) in a ```python code block.\n\n```python\ndef multiples_of_num(m,n):\n \"\"\"Write a function to find m number of multiples of n.\"\"\"\n```"}, {"role": "assistant", "content": "```python\ndef multiples_of_num(m,n): \r\n multiples_of_num= list(range(n,(m+1)*n, n)) \r\n return list(multiples_of_num)\n```"}], "source": "mbpp_train_he", "hash": "9f9f0271e7ae145a29d4bb5aec12f89cf0d17606", "meta": {"id": "mbpp/21"}} | |
| {"messages": [{"role": "system", "content": "You are Kumo, an expert Python programmer. Solve the task. Put the complete, runnable solution in a single ```python code block. Do not include tests or example usage in the code block."}, {"role": "user", "content": "Write a Python function that solves this task:\n\nWrite a function to find the first duplicate element in a given array of integers.\n\nIt must satisfy these tests:\n```python\nassert find_first_duplicate(([1, 2, 3, 4, 4, 5]))==4\nassert find_first_duplicate([1, 2, 3, 4])==-1\nassert find_first_duplicate([1, 1, 2, 3, 3, 2, 2])==1\n```"}, {"role": "assistant", "content": "```python\ndef find_first_duplicate(nums):\r\n num_set = set()\r\n no_duplicate = -1\r\n\r\n for i in range(len(nums)):\r\n\r\n if nums[i] in num_set:\r\n return nums[i]\r\n else:\r\n num_set.add(nums[i])\r\n\r\n return no_duplicate\n```"}], "source": "mbpp_train", "hash": "54f87036a3b89cc3ffeea2925429866a2e9c3e2f", "meta": {"id": "mbpp/22"}} | |
| {"messages": [{"role": "system", "content": "You are Kumo, an expert Python programmer. Solve the task. Put the complete, runnable solution in a single ```python code block. Do not include tests or example usage in the code block."}, {"role": "user", "content": "Complete the following Python function. Return the full function (signature, docstring and body) in a ```python code block.\n\n```python\ndef find_first_duplicate(nums):\n \"\"\"Write a function to find the first duplicate element in a given array of integers.\"\"\"\n```"}, {"role": "assistant", "content": "```python\ndef find_first_duplicate(nums):\r\n num_set = set()\r\n no_duplicate = -1\r\n\r\n for i in range(len(nums)):\r\n\r\n if nums[i] in num_set:\r\n return nums[i]\r\n else:\r\n num_set.add(nums[i])\r\n\r\n return no_duplicate\n```"}], "source": "mbpp_train_he", "hash": "9e41f36d58a3c7d67bee66f94d12b079eb7b9473", "meta": {"id": "mbpp/22"}} | |
| {"messages": [{"role": "system", "content": "You are Kumo, an expert Python programmer. Solve the task. Put the complete, runnable solution in a single ```python code block. Do not include tests or example usage in the code block."}, {"role": "user", "content": "Write a Python function that solves this task:\n\nWrite a python function to find the maximum sum of elements of list in a list of lists.\n\nIt must satisfy these tests:\n```python\nassert maximum_Sum([[1,2,3],[4,5,6],[10,11,12],[7,8,9]]) == 33\nassert maximum_Sum([[0,1,1],[1,1,2],[3,2,1]]) == 6\nassert maximum_Sum([[0,1,3],[1,2,1],[9,8,2],[0,1,0],[6,4,8]]) == 19\n```"}, {"role": "assistant", "content": "```python\ndef maximum_Sum(list1): \r\n maxi = -100000\r\n for x in list1: \r\n sum = 0 \r\n for y in x: \r\n sum+= y \r\n maxi = max(sum,maxi) \r\n return maxi\n```"}], "source": "mbpp_train", "hash": "ced13d41059da10ceb54e4d94d96d3b285d7f488", "meta": {"id": "mbpp/23"}} | |
| {"messages": [{"role": "system", "content": "You are Kumo, an expert Python programmer. Solve the task. Put the complete, runnable solution in a single ```python code block. Do not include tests or example usage in the code block."}, {"role": "user", "content": "Complete the following Python function. Return the full function (signature, docstring and body) in a ```python code block.\n\n```python\ndef maximum_Sum(list1):\n \"\"\"Write a python function to find the maximum sum of elements of list in a list of lists.\"\"\"\n```"}, {"role": "assistant", "content": "```python\ndef maximum_Sum(list1): \r\n maxi = -100000\r\n for x in list1: \r\n sum = 0 \r\n for y in x: \r\n sum+= y \r\n maxi = max(sum,maxi) \r\n return maxi\n```"}], "source": "mbpp_train_he", "hash": "519037f737d71458256e9677ee2caea3526e76aa", "meta": {"id": "mbpp/23"}} | |
| {"messages": [{"role": "system", "content": "You are Kumo, an expert Python programmer. Solve the task. Put the complete, runnable solution in a single ```python code block. Do not include tests or example usage in the code block."}, {"role": "user", "content": "Write a Python function that solves this task:\n\nWrite a function to convert the given binary number to its decimal equivalent.\n\nIt must satisfy these tests:\n```python\nassert binary_to_decimal(100) == 4\nassert binary_to_decimal(1011) == 11\nassert binary_to_decimal(1101101) == 109\n```"}, {"role": "assistant", "content": "```python\ndef binary_to_decimal(binary): \r\n binary1 = binary \r\n decimal, i, n = 0, 0, 0\r\n while(binary != 0): \r\n dec = binary % 10\r\n decimal = decimal + dec * pow(2, i) \r\n binary = binary//10\r\n i += 1\r\n return (decimal)\n```"}], "source": "mbpp_train", "hash": "eec8fd3af1dba392472a2935ab404e8311d93e18", "meta": {"id": "mbpp/24"}} | |
| {"messages": [{"role": "system", "content": "You are Kumo, an expert Python programmer. Solve the task. Put the complete, runnable solution in a single ```python code block. Do not include tests or example usage in the code block."}, {"role": "user", "content": "Complete the following Python function. Return the full function (signature, docstring and body) in a ```python code block.\n\n```python\ndef binary_to_decimal(binary):\n \"\"\"Write a function to convert the given binary number to its decimal equivalent.\"\"\"\n```"}, {"role": "assistant", "content": "```python\ndef binary_to_decimal(binary): \r\n binary1 = binary \r\n decimal, i, n = 0, 0, 0\r\n while(binary != 0): \r\n dec = binary % 10\r\n decimal = decimal + dec * pow(2, i) \r\n binary = binary//10\r\n i += 1\r\n return (decimal)\n```"}], "source": "mbpp_train_he", "hash": "dcdda6f58eb164fc55c9ff8d48dc4387c31ccbac", "meta": {"id": "mbpp/24"}} | |
| {"messages": [{"role": "system", "content": "You are Kumo, an expert Python programmer. Solve the task. Put the complete, runnable solution in a single ```python code block. Do not include tests or example usage in the code block."}, {"role": "user", "content": "Write a Python function that solves this task:\n\nWrite a python function to find the product of non-repeated elements in a given array.\n\nIt must satisfy these tests:\n```python\nassert find_Product([1,1,2,3],4) == 6\nassert find_Product([1,2,3,1,1],5) == 6\nassert find_Product([1,1,4,5,6],5) == 120\n```"}, {"role": "assistant", "content": "```python\ndef find_Product(arr,n): \r\n arr.sort() \r\n prod = 1\r\n for i in range(0,n,1): \r\n if (arr[i - 1] != arr[i]): \r\n prod = prod * arr[i] \r\n return prod;\n```"}], "source": "mbpp_train", "hash": "9483a5e4b750f4287c4d5de627bc931ccbcbf158", "meta": {"id": "mbpp/25"}} | |
| {"messages": [{"role": "system", "content": "You are Kumo, an expert Python programmer. Solve the task. Put the complete, runnable solution in a single ```python code block. Do not include tests or example usage in the code block."}, {"role": "user", "content": "Complete the following Python function. Return the full function (signature, docstring and body) in a ```python code block.\n\n```python\ndef find_Product(arr,n):\n \"\"\"Write a python function to find the product of non-repeated elements in a given array.\"\"\"\n```"}, {"role": "assistant", "content": "```python\ndef find_Product(arr,n): \r\n arr.sort() \r\n prod = 1\r\n for i in range(0,n,1): \r\n if (arr[i - 1] != arr[i]): \r\n prod = prod * arr[i] \r\n return prod;\n```"}], "source": "mbpp_train_he", "hash": "a10ea3a9bf795bfaa09edcb7ba8b3a0abfc2a6bf", "meta": {"id": "mbpp/25"}} | |
| {"messages": [{"role": "system", "content": "You are Kumo, an expert Python programmer. Solve the task. Put the complete, runnable solution in a single ```python code block. Do not include tests or example usage in the code block."}, {"role": "user", "content": "Solve the following programming problem in Python. Read the input from standard input and print the answer to standard output, unless the statement says otherwise. Put the complete solution in a ```python code block.\n\nThere are N cities in Republic of AtCoder. The size of the i-th city is A_{i}. Takahashi would like to build N-1 bidirectional roads connecting two cities so that any city can be reached from any other city by using these roads.\n\nAssume that the cost of building a road connecting the i-th city and the j-th city is |i-j| \\times D + A_{i} + A_{j}. For Takahashi, find the minimum possible total cost to achieve the objective.\n\nConstraints\n\n* 1 \\leq N \\leq 2 \\times 10^5\n* 1 \\leq D \\leq 10^9\n* 1 \\leq A_{i} \\leq 10^9\n* A_{i} and D are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\n\nN D\nA_1 A_2 ... A_N\n\n\nOutput\n\nPrint the minimum possible total cost.\n\nExamples\n\nInput\n\n3 1\n1 100 1\n\n\nOutput\n\n106\n\n\nInput\n\n3 1000\n1 100 1\n\n\nOutput\n\n2202\n\n\nInput\n\n6 14\n25 171 7 1 17 162\n\n\nOutput\n\n497\n\n\nInput\n\n12 5\n43 94 27 3 69 99 56 25 8 15 46 8\n\n\nOutput\n\n658"}, {"role": "assistant", "content": "```python\ndef main():\n import sys\n from collections import defaultdict\n input = sys.stdin.readline\n\n class UnionFind():\n def __init__(self, n):\n self.n = n\n self.root = [-1] * (n + 1)\n self.rnk = [0] * (n + 1)\n\n def find_root(self, x):\n if self.root[x] < 0:\n return x\n else:\n self.root[x] = self.find_root(self.root[x])\n return self.root[x]\n\n def unite(self, x, y):\n x = self.find_root(x)\n y = self.find_root(y)\n if x == y:\n return\n elif self.rnk[x] > self.rnk[y]:\n self.root[x] += self.root[y]\n self.root[y] = x\n else:\n self.root[y] += self.root[x]\n self.root[x] = y\n if self.rnk[x] == self.rnk[y]:\n self.rnk[y] += 1\n\n def isSameGroup(self, x, y):\n return self.find_root(x) == self.find_root(y)\n\n def size(self, x):\n return -self.root[self.find_root(x)]\n\n class Bit:\n def __init__(self, n):\n self.size = n\n self.inf = 10 ** 15\n self.tree = [self.inf] * (n + 1)\n\n def query(self, i):\n s = self.inf\n while i > 0:\n s = min(self.tree[i], s)\n i -= i & -i\n return s\n\n def update(self, i, x):\n while i <= self.size:\n self.tree[i] = min(self.tree[i], x)\n i += i & -i\n\n N, D = map(int, input().split())\n A = list(map(int, input().split()))\n\n tmp = [(a, i+1) for i, a in enumerate(A)]\n tmp.sort(key=lambda x: x[0])\n segtree_plus = Bit(N+5)\n segtree_minus = Bit(N+5)\n edge = []\n val2idx_plus = defaultdict(int)\n val2idx_minus = defaultdict(lambda: N+3)\n edge_append = edge.append\n inf = 10**15\n for a, i in tmp:\n val_plus = a+D*i\n val_minus = a-D*i\n segtree_plus.update(N+1-i, val_plus)\n segtree_minus.update(i, val_minus)\n i_ori = val2idx_plus[val_plus]\n if i > i_ori:\n val2idx_plus[val_plus] = i\n i_ori = val2idx_minus[val_minus]\n if i < i_ori:\n val2idx_minus[val_minus] = i\n plus_min = segtree_plus.query(N-i)\n if plus_min < inf:\n j_plus = val2idx_plus[plus_min]\n edge_append((i, j_plus, A[i-1] + A[j_plus-1] + D*(j_plus - i)))\n minus_min = segtree_minus.query(i-1)\n if minus_min < inf:\n j_minus = val2idx_minus[minus_min]\n edge_append((i, j_minus, A[i-1] + A[j_minus-1] + D * (i - j_minus)))\n\n edge.sort(key=lambda x: x[2])\n UF = UnionFind(N + 1)\n ans = 0\n for u, v, cost in edge:\n if UF.isSameGroup(u, v):\n continue\n ans += cost\n UF.unite(u, v)\n print(ans)\n\n\nif __name__ == '__main__':\n main()\n```"}], "source": "codecontests", "hash": "0539af55d5882d24a72439279eddee4604f3a912", "meta": {"id": "cc/692c73c23776", "difficulty": 0}} | |
| {"messages": [{"role": "system", "content": "You are Kumo, an expert Python programmer. Solve the task. Put the complete, runnable solution in a single ```python code block. Do not include tests or example usage in the code block."}, {"role": "user", "content": "Solve the following programming problem in Python. Read the input from standard input and print the answer to standard output, unless the statement says otherwise. Put the complete solution in a ```python code block.\n\nThere is a 120 minute videotape with standard recording. When I set the VCR counter to 00:00:00 with the tape completely rewound and recorded in standard recording mode, I got a certain counter value. Enter this counter value (hours, minutes, seconds), find the length of the remaining tape (recordable time), and create a program that outputs in the format of hours: minutes: seconds.\n\nHowever, the input must be within 2 hours (120 minutes). The remaining amount of tape is calculated in two ways, standard recording mode and triple recording mode, and outputs two digits each for hours, minutes, and seconds as shown in the output example. If the tens digit is 0, such as \"05\", add \"0\".\n\n\n\ninput\n\nGiven multiple datasets. Each dataset is as follows.\n\n\nT H S\n\n\nT, H, and S are integers that represent hours, minutes, and seconds, respectively.\n\nInput ends when T, H, and S are all -1. The number of datasets does not exceed 50.\n\noutput\n\nFor each dataset\nOn the first line, the hours, minutes, and seconds of the recordable time when the rest of the tape is recorded as standard, separated by half-width colons.\nOn the second line, the hours, minutes, and seconds of the recordable time when the rest of the tape is recorded three times are separated by half-width colons.\nPlease output.\n\nExample\n\nInput\n\n1 30 0\n-1 -1 -1\n\n\nOutput\n\n00:30:00\n01:30:00"}, {"role": "assistant", "content": "```python\n#!/usr/bin/env python\n# -*- coding: utf-8 -*-\nfrom __future__ import (division, absolute_import, print_function,\n unicode_literals)\nfrom sys import stdin\n\n\ndef print_time_lefts(seconds):\n h, remain = divmod(seconds, 3600)\n m, s = divmod(remain, 60)\n print('{:02d}:{:02d}:{:02d}'.format(h, m, s))\n\nfor line in stdin:\n h, m, s = (int(s) for s in line.split())\n if h == -1 and m == -1 and s == -1:\n break\n std_time_lefts = 7200 - h * 3600 - m * 60 - s\n print_time_lefts(std_time_lefts)\n print_time_lefts(std_time_lefts * 3)\n```"}], "source": "codecontests", "hash": "0cb04c6dc6283e3a3357f2017936fe8565c0f6d0", "meta": {"id": "cc/9a33f09df768", "difficulty": 0}} | |
| {"messages": [{"role": "system", "content": "You are Kumo, an expert Python programmer. Solve the task. Put the complete, runnable solution in a single ```python code block. Do not include tests or example usage in the code block."}, {"role": "user", "content": "Solve the following programming problem in Python. Read the input from standard input and print the answer to standard output, unless the statement says otherwise. Put the complete solution in a ```python code block.\n\nYou are given a square with 'n' points on each side of the square. None of these points co-incide with the corners of this square. You have to compute the total number of triangles that can be formed using these '4n' points (n points on each side of the square) as vertices of the triangle.\n\n\nInput\n\nFirst line contains the integer 'T', the number of test cases. This is followed by 'T' lines with a single integer 'n' on each line n ≤ 100.\n\n\nOutput\n\nThe total number of triangles that can be formed.\n\n\nExample\n\nInput:\n1\n1\n\nOutput:\n4"}, {"role": "assistant", "content": "```python\nt = int(input())\nfor i in range(t):\n n = int(input())\n print(int(10 * n * n * n - 6 * n * n))\n```"}], "source": "codecontests", "hash": "6bb4b49dc725ad09013e5f14b46930a453949765", "meta": {"id": "cc/284130cdc4db", "difficulty": 6}} | |
| {"messages": [{"role": "system", "content": "You are Kumo, an expert Python programmer. Solve the task. Put the complete, runnable solution in a single ```python code block. Do not include tests or example usage in the code block."}, {"role": "user", "content": "Solve the following programming problem in Python. Read the input from standard input and print the answer to standard output, unless the statement says otherwise. Put the complete solution in a ```python code block.\n\nComputation of the date either previous or forthcoming dates is quiet easy. But it is quiet difficult to calculate the day from a particular given date. \nYou are required to find a day from a particular date given to you.\n\n\nInput\nIt consists of a single line entry consisting of date in format dd mm yyyy.\ni.e. the input line consists of the three numbers written in order followed by spaces.\nEg. Input for 18-12-1990 is be written as 18 12 1990\n\nOutput\nIt consists of single line output showing the day for that particular date.\n\n\nExample\n\nInput:\n14 3 2012\n\nOutput:\nWednesday"}, {"role": "assistant", "content": "```python\nimport datetime\ndt='21/03/2012'\nday, month, year = (int(x) for x in dt.split('/')) \nans=datetime.date(year,month,day)\nprint (ans.strftime(\"%A\"))\n```"}], "source": "codecontests", "hash": "4ad56978099ff2b106925b30825d9e3d9a42dc9c", "meta": {"id": "cc/50cc0d1acb35", "difficulty": 6}} | |
| {"messages": [{"role": "system", "content": "You are Kumo, an expert Python programmer. Solve the task. Put the complete, runnable solution in a single ```python code block. Do not include tests or example usage in the code block."}, {"role": "user", "content": "Solve the following programming problem in Python. Read the input from standard input and print the answer to standard output, unless the statement says otherwise. Put the complete solution in a ```python code block.\n\nYou have a sequence A composed of N positive integers: A_{1}, A_{2}, \\cdots, A_{N}.\n\nYou will now successively do the following Q operations:\n\n* In the i-th operation, you replace every element whose value is B_{i} with C_{i}.\n\n\n\nFor each i (1 \\leq i \\leq Q), find S_{i}: the sum of all elements in A just after the i-th operation.\n\nConstraints\n\n* All values in input are integers.\n* 1 \\leq N, Q, A_{i}, B_{i}, C_{i} \\leq 10^{5}\n* B_{i} \\neq C_{i}\n\nInput\n\nInput is given from Standard Input in the following format:\n\n\nN\nA_{1} A_{2} \\cdots A_{N}\nQ\nB_{1} C_{1}\nB_{2} C_{2}\n\\vdots\nB_{Q} C_{Q}\n\n\nOutput\n\nPrint Q integers S_{i} to Standard Output in the following format:\n\n\nS_{1}\nS_{2}\n\\vdots\nS_{Q}\n\n\nNote that S_{i} may not fit into a 32-bit integer.\n\nExamples\n\nInput\n\n4\n1 2 3 4\n3\n1 2\n3 4\n2 4\n\n\nOutput\n\n11\n12\n16\n\n\nInput\n\n4\n1 1 1 1\n3\n1 2\n2 1\n3 5\n\n\nOutput\n\n8\n4\n4\n\n\nInput\n\n2\n1 2\n3\n1 100\n2 100\n100 1000\n\n\nOutput\n\n102\n200\n2000"}, {"role": "assistant", "content": "```python\n#!/usr/bin/env python\nfrom __future__ import division, print_function\n\nimport os\nimport sys\nfrom collections import Counter\nfrom io import BytesIO, IOBase\n\nif sys.version_info[0] < 3:\n from __builtin__ import xrange as range\n from future_builtins import ascii, filter, hex, map, oct, zip\n\n\ndef main():\n n = int(input())\n a = [int(ai) for ai in input().split()]\n ca = Counter(a)\n\n s = sum(a)\n\n q = int(input())\n for _ in range(q):\n b, c = map(int, input().split())\n s = (s - b * ca[b]) + (c * ca[b])\n print(s)\n ca[c] += ca[b]\n ca[b] = 0\n\n\n# region fastio\n\nBUFSIZE = 8192\n\n\nclass FastIO(IOBase):\n newlines = 0\n\n def __init__(self, file):\n self._fd = file.fileno()\n self.buffer = BytesIO()\n self.writable = \"x\" in file.mode or \"r\" not in file.mode\n self.write = self.buffer.write if self.writable else None\n\n def read(self):\n while True:\n b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))\n if not b:\n break\n ptr = self.buffer.tell()\n self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)\n self.newlines = 0\n return self.buffer.read()\n\n def readline(self):\n while self.newlines == 0:\n b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))\n self.newlines = b.count(b\"\\n\") + (not b)\n ptr = self.buffer.tell()\n self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)\n self.newlines -= 1\n return self.buffer.readline()\n\n def flush(self):\n if self.writable:\n os.write(self._fd, self.buffer.getvalue())\n self.buffer.truncate(0), self.buffer.seek(0)\n\n\nclass IOWrapper(IOBase):\n def __init__(self, file):\n self.buffer = FastIO(file)\n self.flush = self.buffer.flush\n self.writable = self.buffer.writable\n self.write = lambda s: self.buffer.write(s.encode(\"ascii\"))\n self.read = lambda: self.buffer.read().decode(\"ascii\")\n self.readline = lambda: self.buffer.readline().decode(\"ascii\")\n\n\ndef print(*args, **kwargs):\n \"\"\"Prints the values to a stream, or to sys.stdout by default.\"\"\"\n sep, file = kwargs.pop(\"sep\", \" \"), kwargs.pop(\"file\", sys.stdout)\n at_start = True\n for x in args:\n if not at_start:\n file.write(sep)\n file.write(str(x))\n at_start = False\n file.write(kwargs.pop(\"end\", \"\\n\"))\n if kwargs.pop(\"flush\", False):\n file.flush()\n\n\nif sys.version_info[0] < 3:\n sys.stdin, sys.stdout = FastIO(sys.stdin), FastIO(sys.stdout)\nelse:\n sys.stdin, sys.stdout = IOWrapper(sys.stdin), IOWrapper(sys.stdout)\n\ninput = lambda: sys.stdin.readline().rstrip(\"\\r\\n\")\n\n# endregion\n\nif __name__ == \"__main__\":\n main()\n```"}], "source": "codecontests", "hash": "ed9a6f9ff6868885993f873b4cfecedc7226dee9", "meta": {"id": "cc/e74f7aaed9f6", "difficulty": 0}} | |
| {"messages": [{"role": "system", "content": "You are Kumo, an expert Python programmer. Solve the task. Put the complete, runnable solution in a single ```python code block. Do not include tests or example usage in the code block."}, {"role": "user", "content": "Solve the following programming problem in Python. Read the input from standard input and print the answer to standard output, unless the statement says otherwise. Put the complete solution in a ```python code block.\n\nYou have a pot and N ingredients. Each ingredient has a real number parameter called value, and the value of the i-th ingredient (1 \\leq i \\leq N) is v_i.\n\nWhen you put two ingredients in the pot, they will vanish and result in the formation of a new ingredient. The value of the new ingredient will be (x + y) / 2 where x and y are the values of the ingredients consumed, and you can put this ingredient again in the pot.\n\nAfter you compose ingredients in this way N-1 times, you will end up with one ingredient. Find the maximum possible value of this ingredient.\n\nConstraints\n\n* 2 \\leq N \\leq 50\n* 1 \\leq v_i \\leq 1000\n* All values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\n\nN\nv_1 v_2 \\ldots v_N\n\n\nOutput\n\nPrint a decimal number (or an integer) representing the maximum possible value of the last ingredient remaining.\n\nYour output will be judged correct when its absolute or relative error from the judge's output is at most 10^{-5}.\n\nExamples\n\nInput\n\n2\n3 4\n\n\nOutput\n\n3.5\n\n\nInput\n\n3\n500 300 200\n\n\nOutput\n\n375\n\n\nInput\n\n5\n138 138 138 138 138\n\n\nOutput\n\n138"}, {"role": "assistant", "content": "```python\n# template by 3xC and starkizard.\n# contributors: \n\n#####################################################################################\nfrom __future__ import division, print_function \n\nimport sys\nimport os\nfrom collections import Counter, deque, defaultdict\nimport itertools\nimport math\nimport io\n\n\n\"\"\"Uncomment modules according to your need\"\"\"\n\n\n# from bisect import bisect_left, bisect_right, insort\n# from heapq import heappop, heapify, heappush\n# from random import randint as rn\n# from Queue import Queue as Q\n# from copy import deepcopy\n# from decimal import *\n# import re\n# import operator\n\n#####################################################################################\n# this enables you to write python3 code with PyPy2 (Python 2)\nif sys.version_info[0] < 3:\n input = raw_input\n range = xrange\n\n filter = itertools.ifilter\n map = itertools.imap\n zip = itertools.izip\n\n#####################################################################################\n\n\"\"\"value of mod\"\"\"\nMOD = 998244353\nmod = 10**9 + 7\n\n\"\"\"Uncomment next 4 lines if doing huge recursion\"\"\"\n# import threading\n# threading.stack_size(1<<27)\n# sys.setrecursionlimit(10000\n\ndef prepare_factorial(mod=mod):\n \"\"\" returns two lists, factorial and inverse factorial modulo argument by default 10**9 +7 \"\"\"\n # Comment code out when you don't need inverse factorial or vice versa\n fact = [1]\n for i in range(1, 200005):\n fact.append((fact[-1] * i) % mod)\n\n ifact = [0] * 200005\n ifact[200004] = pow(fact[200004], mod - 2, mod)\n for i in range(200004, 0, -1):\n ifact[i - 1] = (i * ifact[i]) % mod\n\n return fact, ifact\n\ndef modinv(n, p):\n \"\"\" returns N inverse modulo p \"\"\"\n return pow(n, p - 2, p)\n\ndef ncr(n, r, fact, ifact):\n \"\"\" takes 4 arguments: n , r and factorial and inverse factorial lists\"\"\"\n t = (fact[n] * (ifact[r]*ifact[n-r]) % MOD)% MOD\n return t\n\n\ndef get_n(Sum): \n \"\"\"this function returns the maximum n for which Summation(n) <= Sum\"\"\"\n ans = (-1 + sqrt(1 + 8*Sum))//2\n return ans\n\ndef sieve(n):\n \"\"\" returns a list of prime numbers till n \"\"\"\n if n < 2: return list()\n prime = [True for _ in range(n + 1)]\n p = 3\n while p * p <= n:\n if prime[p]:\n for i in range(p * 2, n + 1, p):\n prime[i] = False\n p += 2\n r = [2]\n for p in range(3, n + 1, 2):\n if prime[p]:\n r.append(p)\n return r\n\n\n\ndef divs(n, start=1):\n \"\"\" returns a list of all divisors till n \"\"\"\n divisors = []\n for i in range(start, int(math.sqrt(n) + 1)):\n if n % i == 0:\n if n / i == i:\n divisors.append(i)\n else:\n divisors.extend([i, n // i])\n return divisors\n\n\n\ndef divn(n, primes):\n \"\"\" returns the number of divisors, two arguments n and the sieve till n \"\"\"\n divs_number = 1\n for i in primes:\n if n == 1:\n return divs_number\n t = 1\n while n % i == 0:\n t += 1\n n //= i\n divs_number *= t\n\n\n\ndef lrfind(d, x, default=-1):\n \"\"\" Takes 2 arguments an iterable and an element. returns a tuple (firstoccurence,lastoccurence) -1 if not found \"\"\"\n left = right = -1\n for i in range(len(d)):\n if d[i] == x:\n if left == -1: left = i\n right = i\n if left == -1:\n return default, default\n else:\n return left, right\n\ndef gcd(x, y): # math.gcd is slower\n \"\"\" returns greatest common divisor of x and y \"\"\"\n while y:\n x, y = y, x % y\n return x\n\ndef check_sorted(a):\n ''' returns True/False '''\n for i in range(len(a)-1):\n if a[i]>a[i+1]:\n return False\n return True\ndef ceil(n, k=1): return n // k + (n % k != 0) #returns math.ceil but protecting against floating inconsistencies\ndef input(): return sys.stdin.readline().strip()\ndef ii(): return int(input()) #inputs integer\ndef mi(): return map(int, input().split()) # inputting space seperated variables for example x,y,z\ndef li(): return list(map(int, input().split())) #inputting a space seperated list of integers\ndef lw(): return input().split() #inputting a space seperated list of strings\ndef lcm(a, b): return abs(a * b) // gcd(a, b) #returns LCM of two arguments\ndef prr(a, sep=' ', end='\\n'): print(sep.join(map(str, a)), end=end) #For printing an iterable with seperator sep as optional second argument (default : \" \"), ending character (default: \"\\n\") as optional third\ndef dd(): return defaultdict(int) #returns a dictionary with values defaulted to 0\ndef ddl(): return defaultdict(list) #returns a dictionary with values defaulted to []\ndef write(s): return sys.stdout.write(s)\n\n\n\n\n\n\n\n\n\n\n\n\n###################################################################\ndef main():\n #CODE GOES HERE:\n n=ii()\n v=li()\n v.sort()\n answer=v[0]\n for i in range(1,n):\n answer+=v[i]\n answer/=2\n print(answer)\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n \n\"\"\" -------- Python 2 and 3 footer by Pajenegod and c1729 ---------\"\"\"\n\npy2 = round(0.5)\nif py2:\n from future_builtins import ascii, filter, hex, map, oct, zip\n range = xrange\n\nimport os, sys\nfrom io import IOBase, BytesIO\n\nBUFSIZE = 8192\n\nclass FastIO(BytesIO):\n newlines = 0\n\n def __init__(self, file):\n self._file = file\n self._fd = file.fileno()\n self.writable = \"x\" in file.mode or \"w\" in file.mode\n self.write = super(FastIO, self).write if self.writable else None\n\n def _fill(self):\n s = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))\n self.seek((self.tell(), self.seek(0, 2), super(FastIO, self).write(s))[0])\n return s\n\n def read(self):\n while self._fill(): pass\n return super(FastIO, self).read()\n\n def readline(self):\n while self.newlines == 0:\n s = self._fill();\n self.newlines = s.count(b\"\\n\") + (not s)\n self.newlines -= 1\n return super(FastIO, self).readline()\n\n def flush(self):\n if self.writable:\n os.write(self._fd, self.getvalue())\n self.truncate(0), self.seek(0)\n\n\nclass IOWrapper(IOBase):\n\n def __init__(self, file):\n self.buffer = FastIO(file)\n self.flush = self.buffer.flush\n self.writable = self.buffer.writable\n if py2:\n self.write = self.buffer.write\n self.read = self.buffer.read\n self.readline = self.buffer.readline\n else:\n self.write = lambda s: self.buffer.write(s.encode('ascii'))\n self.read = lambda: self.buffer.read().decode('ascii')\n self.readline = lambda: self.buffer.readline().decode('ascii')\n\n\nsys.stdin, sys.stdout = IOWrapper(sys.stdin), IOWrapper(sys.stdout)\ninput = lambda: sys.stdin.readline().rstrip('\\r\\n')\n# sys.stdin = open('input.txt', 'r')\n# sys.stdout = open('output.txt', 'w')\n\n\"\"\" main function\"\"\"\n\nif __name__ == '__main__':\n main()\n # threading.Thread(target=main).start()\n```"}], "source": "codecontests", "hash": "2b9321fbfa2cf184e04e1b9f0c42d8e6a63836f7", "meta": {"id": "cc/c4fc5c19b4cb", "difficulty": 0}} | |
| {"messages": [{"role": "system", "content": "You are Kumo, an expert Python programmer. Solve the task. Put the complete, runnable solution in a single ```python code block. Do not include tests or example usage in the code block."}, {"role": "user", "content": "Solve the following programming problem in Python. Read the input from standard input and print the answer to standard output, unless the statement says otherwise. Put the complete solution in a ```python code block.\n\nLittle Raju recently learnt about binary numbers. After spending some time with it, he decided to count in how many ways he can make N digit numbers that is formed by ones and zeroes. But zeroes can not be next to each other. Help him finding in how many different numbers can he make?\n\nExample: There 5 possible ways of making different numbers using 3 digit numbers i.e. 101,010,111,110,011\n\nInput\n\nFirst line of input contains the total number of test cases T.\nNext T lines contain N as explained above.\n\nOutput\n\nFor each test case print in newline as explained above.\n\nConstraints\n\n1 ≤ t ≤ 10\n1 ≤ n ≤ 10^4\n\nSAMPLE INPUT\n2\n3\n7\n\nSAMPLE OUTPUT\n5\n34"}, {"role": "assistant", "content": "```python\n'''\n# Read input from stdin and provide input before running code\n\nname = raw_input('What is your name?\\n')\nprint 'Hi, %s.' % name\n\nprint 'Hello World!'\n'''\nt=int(input())\nfor i in range(t):\n\tn=int(input())\n\tif n==1:\n\t\tprint(2)\n\telse:\n\t\ta=1\n\t\tb=2\n\t\tfor i in range(2,n+1):\n\t\t\ta,b=b,a+b\n\t\tprint(b)\n```"}], "source": "codecontests", "hash": "dc9c94535a70ad9e080b8af024dca27b22506995", "meta": {"id": "cc/c07b50d4419b", "difficulty": 0}} | |
| {"messages": [{"role": "system", "content": "You are Kumo, an expert Python programmer. Solve the task. Put the complete, runnable solution in a single ```python code block. Do not include tests or example usage in the code block."}, {"role": "user", "content": "Solve the following programming problem in Python. Read the input from standard input and print the answer to standard output, unless the statement says otherwise. Put the complete solution in a ```python code block.\n\nDifference of Big Integers\n\nGiven two integers $A$ and $B$, compute the difference, $A - B$.\n\nInput\n\nTwo integers $A$ and $B$ separated by a space character are given in a line.\n\nOutput\n\nPrint the difference in a line.\n\nConstraints\n\n* $-1 \\times 10^{100000} \\leq A, B \\leq 10^{100000}$\n\n\n\nSample Input 1\n\n\n5 8\n\n\nSample Output 1\n\n\n-3\n\n\nSample Input 2\n\n\n100 25\n\n\nSample Output 2\n\n\n75\n\n\nSample Input 3\n\n\n-1 -1\n\n\nSample Output 3\n\n\n0\n\n\nSample Input 4\n\n\n12 -3\n\n\nSample Output 4\n\n\n15\n\n\n\n\n\n\nExample\n\nInput\n\n5 8\n\n\nOutput\n\n-3"}, {"role": "assistant", "content": "```python\nimport sys\na,b=map(int,sys.stdin.readline().split())\nprint(a-b)\n```"}], "source": "codecontests", "hash": "1b0438930f51d34cebc16d516f9245e262c57641", "meta": {"id": "cc/8338b7691d1a", "difficulty": 0}} | |
| {"messages": [{"role": "system", "content": "You are Kumo, an expert Python programmer. Solve the task. Put the complete, runnable solution in a single ```python code block. Do not include tests or example usage in the code block."}, {"role": "user", "content": "Solve the following programming problem in Python. Read the input from standard input and print the answer to standard output, unless the statement says otherwise. Put the complete solution in a ```python code block.\n\nThere are N squares in a row. The leftmost square contains the integer A, and the rightmost contains the integer B. The other squares are empty.\n\nAohashi would like to fill the empty squares with integers so that the following condition is satisfied:\n\n* For any two adjacent squares, the (absolute) difference of the two integers in those squares is between C and D (inclusive).\n\n\n\nAs long as the condition is satisfied, it is allowed to use arbitrarily large or small integers to fill the squares. Determine whether it is possible to fill the squares under the condition.\n\nConstraints\n\n* 3 \\leq N \\leq 500000\n* 0 \\leq A \\leq 10^9\n* 0 \\leq B \\leq 10^9\n* 0 \\leq C \\leq D \\leq 10^9\n* All input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\n\nN A B C D\n\n\nOutput\n\nPrint `YES` if it is possible to fill the squares under the condition; print `NO` otherwise.\n\nExamples\n\nInput\n\n5 1 5 2 4\n\n\nOutput\n\nYES\n\n\nInput\n\n4 7 6 4 5\n\n\nOutput\n\nNO\n\n\nInput\n\n48792 105960835 681218449 90629745 90632170\n\n\nOutput\n\nNO\n\n\nInput\n\n491995 412925347 825318103 59999126 59999339\n\n\nOutput\n\nYES"}, {"role": "assistant", "content": "```python\n#!/usr/bin/env python\n# -*- coding: utf-8 -*-\n\nfrom __future__ import division, print_function\nimport sys\n\n\ndef main():\n n, a, b, c, d = map(int, sys.stdin.readline().strip().split(\" \"))\n m = n - 1\n diff = b - a\n\n for i in range(m):\n j = m - i\n plus_min = c * i\n plus_max = d * i\n minus_min = -c * j\n minus_max = -d * j\n minimum = plus_min + minus_max\n maximum = plus_max + minus_min\n if minimum <= diff <= maximum:\n print(\"YES\")\n break\n else:\n print(\"NO\")\n\n\nif __name__ == '__main__':\n main()\n```"}], "source": "codecontests", "hash": "7f9b8c38561e7909d91b902807b9851c7b76072a", "meta": {"id": "cc/2535fa750cc3", "difficulty": 0}} | |
| {"messages": [{"role": "system", "content": "You are Kumo, an expert Python programmer. Solve the task. Put the complete, runnable solution in a single ```python code block. Do not include tests or example usage in the code block."}, {"role": "user", "content": "Solve the following programming problem in Python. Read the input from standard input and print the answer to standard output, unless the statement says otherwise. Put the complete solution in a ```python code block.\n\nWhen a boy was cleaning up after his grand father passing, he found an old paper:\n\n<image>\n\n\n\nIn addition, other side of the paper says that \"go ahead a number of steps equivalent to the first integer, and turn clockwise by degrees equivalent to the second integer\".\n\nHis grand mother says that Sanbonmatsu was standing at the center of town. However, now buildings are crammed side by side and people can not walk along exactly what the paper says in. Your task is to write a program which hunts for the treature on the paper.\n\nFor simplicity, 1 step is equivalent to 1 meter. Input consists of several pairs of two integers d (the first integer) and t (the second integer) separated by a comma. Input ends with \"0, 0\". Your program should print the coordinate (x, y) of the end point. There is the treature where x meters to the east and y meters to the north from the center of town.\n\nYou can assume that d ≤ 100 and -180 ≤ t ≤ 180.\n\n\n\nInput\n\nA sequence of pairs of integers d and t which end with \"0,0\".\n\nOutput\n\nPrint the integer portion of x and y in a line respectively.\n\nExample\n\nInput\n\n56,65\n97,54\n64,-4\n55,76\n42,-27\n43,80\n87,-86\n55,-6\n89,34\n95,5\n0,0\n\n\nOutput\n\n171\n-302"}, {"role": "assistant", "content": "```python\nfrom __future__ import (absolute_import, division, print_function,\n unicode_literals)\nfrom sys import stdin\nfrom math import radians\nfrom cmath import rect\n\np = 0+0j\nprev_angle = radians(-90)\nfor line in stdin:\n m, next_angle = (int(i) for i in line.split(','))\n if not (m or next_angle):\n break\n p += rect(m, -prev_angle)\n prev_angle += radians(next_angle)\nprint('{}\\n{}'.format(int(p.real), int(p.imag)))\n```"}], "source": "codecontests", "hash": "ac286f7101c2ebf911e1df55943dfade00b2fba0", "meta": {"id": "cc/b9633f1c57fb", "difficulty": 0}} | |
| {"messages": [{"role": "system", "content": "You are Kumo, an expert Python programmer. Solve the task. Put the complete, runnable solution in a single ```python code block. Do not include tests or example usage in the code block."}, {"role": "user", "content": "Solve the following programming problem in Python. Read the input from standard input and print the answer to standard output, unless the statement says otherwise. Put the complete solution in a ```python code block.\n\nIt is known that the area of a regular dodecagon inscribed in a circle of radius a is 3a^2.\n\nGiven an integer r, find the area of a regular dodecagon inscribed in a circle of radius r.\n\nConstraints\n\n* 1 \\leq r \\leq 100\n* r is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\n\nr\n\n\nOutput\n\nPrint an integer representing the area of the regular dodecagon.\n\nExamples\n\nInput\n\n4\n\n\nOutput\n\n48\n\n\nInput\n\n15\n\n\nOutput\n\n675\n\n\nInput\n\n80\n\n\nOutput\n\n19200"}, {"role": "assistant", "content": "```python\n#!/usr/bin/env python\nfrom __future__ import division, print_function\n\nimport os\nimport sys\nfrom io import BytesIO, IOBase\n\nif sys.version_info[0] < 3:\n from __builtin__ import xrange as range\n from future_builtins import ascii, filter, hex, map, oct, zip\n\n\ndef main():\n r = int(input())\n\n print(3 * (r ** 2))\n\n\n# region fastio\n\nBUFSIZE = 8192\n\n\nclass FastIO(IOBase):\n newlines = 0\n\n def __init__(self, file):\n self._fd = file.fileno()\n self.buffer = BytesIO()\n self.writable = \"x\" in file.mode or \"r\" not in file.mode\n self.write = self.buffer.write if self.writable else None\n\n def read(self):\n while True:\n b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))\n if not b:\n break\n ptr = self.buffer.tell()\n self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)\n self.newlines = 0\n return self.buffer.read()\n\n def readline(self):\n while self.newlines == 0:\n b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))\n self.newlines = b.count(b\"\\n\") + (not b)\n ptr = self.buffer.tell()\n self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)\n self.newlines -= 1\n return self.buffer.readline()\n\n def flush(self):\n if self.writable:\n os.write(self._fd, self.buffer.getvalue())\n self.buffer.truncate(0), self.buffer.seek(0)\n\n\nclass IOWrapper(IOBase):\n def __init__(self, file):\n self.buffer = FastIO(file)\n self.flush = self.buffer.flush\n self.writable = self.buffer.writable\n self.write = lambda s: self.buffer.write(s.encode(\"ascii\"))\n self.read = lambda: self.buffer.read().decode(\"ascii\")\n self.readline = lambda: self.buffer.readline().decode(\"ascii\")\n\n\ndef print(*args, **kwargs):\n \"\"\"Prints the values to a stream, or to sys.stdout by default.\"\"\"\n sep, file = kwargs.pop(\"sep\", \" \"), kwargs.pop(\"file\", sys.stdout)\n at_start = True\n for x in args:\n if not at_start:\n file.write(sep)\n file.write(str(x))\n at_start = False\n file.write(kwargs.pop(\"end\", \"\\n\"))\n if kwargs.pop(\"flush\", False):\n file.flush()\n\n\nif sys.version_info[0] < 3:\n sys.stdin, sys.stdout = FastIO(sys.stdin), FastIO(sys.stdout)\nelse:\n sys.stdin, sys.stdout = IOWrapper(sys.stdin), IOWrapper(sys.stdout)\n\ninput = lambda: sys.stdin.readline().rstrip(\"\\r\\n\")\n\n# endregion\n\nif __name__ == \"__main__\":\n main()\n```"}], "source": "codecontests", "hash": "23c7e3257200d7bf2eb07e34e14c1c54e2d1007a", "meta": {"id": "cc/a8a23384b04a", "difficulty": 0}} | |
| {"messages": [{"role": "system", "content": "You are Kumo, an expert Python programmer. Solve the task. Put the complete, runnable solution in a single ```python code block. Do not include tests or example usage in the code block."}, {"role": "user", "content": "Solve the following programming problem in Python. Read the input from standard input and print the answer to standard output, unless the statement says otherwise. Put the complete solution in a ```python code block.\n\nJoy is a short and lazy guy, he uses elevator to reach his flat. But unfortunately elevator is not working today and he became sad. Suddenly God came and made the stairs magical, such that he can jump on it in a magical way. Initially he can take 1 or 2 steps. If he jumps x steps at a time then in the next step he can climb either x or x+1 steps depending on his choice and he must reach exactly on n'th step. Help him find the minimum number of jumps to be made.\n\nINPUT\n\nFirst line will contain t, total number of test case\nNext t lines contains n (total number of steps).\n\n0<t ≤ 100\n\n0<n ≤ 10^5\n\nOUTPUT\n\nMinimum steps to reach the stairs.SAMPLE INPUT\n2\n2\n3\n\nSAMPLE OUTPUT\n1\n2"}, {"role": "assistant", "content": "```python\ntest = int(input())\nwhile(test>0):\n stairs = int(input())\n steps = 0\n size_of_step = 2\n while(stairs > 0):\n steps +=1\n stairs = stairs - size_of_step\n size_of_step+=1\n test-=1\n print(steps)\n```"}], "source": "codecontests", "hash": "48a229ce43d93cee5ec831bc99299493e3b2082b", "meta": {"id": "cc/a59f3b8f52dc", "difficulty": 0}} | |
| {"messages": [{"role": "system", "content": "You are Kumo, an expert Python programmer. Solve the task. Put the complete, runnable solution in a single ```python code block. Do not include tests or example usage in the code block."}, {"role": "user", "content": "Solve the following programming problem in Python. Read the input from standard input and print the answer to standard output, unless the statement says otherwise. Put the complete solution in a ```python code block.\n\nE869120 found a chest which is likely to contain treasure.\nHowever, the chest is locked. In order to open it, he needs to enter a string S consisting of lowercase English letters.\nHe also found a string S', which turns out to be the string S with some of its letters (possibly all or none) replaced with `?`.\n\nOne more thing he found is a sheet of paper with the following facts written on it:\n\n* Condition 1: The string S contains a string T as a contiguous substring.\n* Condition 2: S is the lexicographically smallest string among the ones that satisfy Condition 1.\n\n\n\nPrint the string S.\nIf such a string does not exist, print `UNRESTORABLE`.\n\nConstraints\n\n* 1 \\leq |S'|, |T| \\leq 50\n* S' consists of lowercase English letters and `?`.\n* T consists of lowercase English letters.\n\nInput\n\nInput is given from Standard Input in the following format:\n\n\nS\nT'\n\n\nOutput\n\nPrint the string S.\nIf such a string does not exist, print `UNRESTORABLE` instead.\n\nExamples\n\nInput\n\n?tc????\ncoder\n\n\nOutput\n\natcoder\n\n\nInput\n\n??p??d??\nabc\n\n\nOutput\n\nUNRESTORABLE"}, {"role": "assistant", "content": "```python\nimport sys\ninput = sys.stdin.readline\ns = input().rstrip(\"\\n\")\nt = input().rstrip(\"\\n\")\nflg = False\n\nfor i in range(len(s)-len(t)+1):\n cnt = 0\n for j in range(len(t)):\n #print(s[i+j],t[j])\n if s[i+j] == t[j] or s[i+j] == '?':\n cnt+=1\n #print(cnt,len(t))\n if cnt == len(t):\n temp=i\n flg = True\n #print(cnt)\n \nif not flg:\n print(\"UNRESTORABLE\")\nelse:\n li = list(s.replace(\"?\",\"a\"))\n #print(li)\n for j in range(len(t)):\n #print(li[cnt+j], t[j])\n li[temp+j] = t[j]\n print(\"\".join(li))\n```"}], "source": "codecontests", "hash": "dc66ef2ceb5c7b1d346d918ef70fd5a2ee268867", "meta": {"id": "cc/40bf3c95cac3", "difficulty": 0}} | |
| {"messages": [{"role": "system", "content": "You are Kumo, an expert Python programmer. Solve the task. Put the complete, runnable solution in a single ```python code block. Do not include tests or example usage in the code block."}, {"role": "user", "content": "Solve the following programming problem in Python. Read the input from standard input and print the answer to standard output, unless the statement says otherwise. Put the complete solution in a ```python code block.\n\nYou are given an integer K. Print the string obtained by repeating the string `ACL` K times and concatenating them.\n\nFor example, if K = 3, print `ACLACLACL`.\n\nConstraints\n\n* 1 \\leq K \\leq 5\n* All values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\n\nK\n\n\nOutput\n\nPrint the string obtained by repeating the string `ACL` K times and concatenating them.\n\nExample\n\nInput\n\n3\n\n\nOutput\n\nACLACLACL"}, {"role": "assistant", "content": "```python\nimport sys\ninput = lambda : sys.stdin.readline().rstrip()\n\nk = int(input())\nout = \"ACL\" * k\nprint(out)\n```"}], "source": "codecontests", "hash": "65746a08cbb50c1424f340d9afb397c0027901ec", "meta": {"id": "cc/efd953f78c9c", "difficulty": 0}} | |
| {"messages": [{"role": "system", "content": "You are Kumo, an expert Python programmer. Solve the task. Put the complete, runnable solution in a single ```python code block. Do not include tests or example usage in the code block."}, {"role": "user", "content": "Solve the following programming problem in Python. Read the input from standard input and print the answer to standard output, unless the statement says otherwise. Put the complete solution in a ```python code block.\n\nThere are N cards placed on a grid with H rows and W columns of squares.\n\nThe i-th card has an integer A_i written on it, and it is placed on the square at the R_i-th row from the top and the C_i-th column from the left.\n\nMultiple cards may be placed on the same square.\n\nYou will first pick up at most one card from each row.\n\nThen, you will pick up at most one card from each column.\n\nFind the maximum possible sum of the integers written on the picked cards.\n\nConstraints\n\n* All values are integers.\n* 1 \\leq N \\leq 10^5\n* 1 \\leq H, W \\leq 10^5\n* 1 \\leq A_i \\leq 10^5\n* 1 \\leq R_i \\leq H\n* 1 \\leq C_i \\leq W\n\nInput\n\nInput is given from Standard Input in the following format:\n\n\nN H W\nR_1 C_1 A_1\nR_2 C_2 A_2\n\\vdots\nR_N C_N A_N\n\n\nOutput\n\nPrint the maximum possible sum of the integers written on the picked cards.\n\nExamples\n\nInput\n\n6 2 2\n2 2 2\n1 1 8\n1 1 5\n1 2 9\n1 2 7\n2 1 4\n\n\nOutput\n\n28\n\n\nInput\n\n13 5 6\n1 3 35902\n4 6 19698\n4 6 73389\n3 6 3031\n3 1 4771\n1 4 4784\n2 1 36357\n2 1 24830\n5 6 50219\n4 6 22645\n1 2 30739\n1 4 68417\n1 5 78537\n\n\nOutput\n\n430590\n\n\nInput\n\n1 100000 100000\n1 1 1\n\n\nOutput\n\n1"}, {"role": "assistant", "content": "```python\nimport sys\ninput = sys.stdin.readline\nsys.setrecursionlimit(10**6)\n\ndef par(a):\n if P[a] < 0: return a\n t = par(P[a])\n P[a] = t\n return t\ndef unite(a, b):\n if par(a) == par(b): return 0\n C[par(a)], C[par(b)] = C[par(a)] + C[par(b)], C[par(a)] + C[par(b)]\n if P[par(b)] == P[par(a)]:\n P[par(b)] = par(a)\n P[par(a)] -= 1\n elif P[par(b)] > P[par(a)]:\n P[par(b)] = par(a)\n else:\n P[par(a)] = par(b)\nN, H, W = map(int, input().split())\nP = [-1 for i in range(H+W)]\nC = [1] * (H+W)\nX = []\nfor _ in range(N):\n r, c, a = map(int, input().split())\n X.append((a, r-1, c+H-1))\nX = sorted(X)\nans = 0\nwhile X:\n a, r, c = X.pop()\n unite(r, c)\n if C[par(r)]:\n ans += a\n C[par(r)] -= 1\nprint(ans)\n```"}], "source": "codecontests", "hash": "f4572d7ecb1b5ffaf1a72c7d1c9883da783b6e5e", "meta": {"id": "cc/5a1562ff4fee", "difficulty": 0}} | |