id large_stringlengths 16 16 | prompt large_stringlengths 19 179k | domain large_stringclasses 3
values | prompt_source large_stringclasses 4
values | source_id large_stringlengths 1 93 | emb_all_mpnet_base_v2 listlengths 768 768 | ground_truth listlengths 0 6.38k | verifier stringlengths 1 74M | verifier_kind stringclasses 5
values |
|---|---|---|---|---|---|---|---|---|
52bdd830133b46c6 | Given an array $a$, consisting of $n$ integers, find:
$$\max\limits_{1 \le i < j \le n} LCM(a_i,a_j),$$
where $LCM(x, y)$ is the smallest positive integer that is divisible by both $x$ and $y$. For example, $LCM(6, 8) = 24$, $LCM(4, 12) = 12$, $LCM(2, 3) = 6$.
-----Input-----
The first line contains an integer $n$... | code | agentica-org/DeepCoder-Preview-Dataset | agentica-org__DeepCoder-Preview-Dataset_19246 | [
0.005761819891631603,
-0.01828550174832344,
0.015514841303229332,
0.08389157801866531,
0.0074794236570596695,
0.0014422169188037515,
0.0040408954955637455,
-0.011118588969111443,
0.023294497281312943,
-0.007531820330768824,
-0.0042349835857748985,
0.08841400593519211,
-0.0026240639854222536,... | [
"import math\nN = 10 ** 5 + 10\nu = [-1] * N\ndivi = [[] for i in range(N)]\npd = [[] for i in range(N)]\nmark = [0] * N\n\ndef precalc():\n\tfor i in range(1, N):\n\t\tfor j in range(i, N, i):\n\t\t\tdivi[j].append(i)\n\tfor i in range(2, N):\n\t\tif mark[i] == 1:\n\t\t\tcontinue\n\t\tfor j in range(i, N, i):\n\t\... | [{"input": "3\n13 35 77\n", "output": "1001"}, {"input": "6\n1 2 4 8 16 32\n", "output": "32"}, {"input": "2\n2 5\n", "output": "10"}, {"input": "4\n12 9 1 8\n", "output": "72"}, {"input": "4\n15 12 9 10\n", "output": "90"}, {"input": "56\n15 10 44 38 12 7 20 17 16 3 43 10 32 4 31 38 8 15 21 8 37 44 19 21 26 24 22 21 1... | code_stdio |
e30ec3b467019ce7 | You are given a list of integers representing the number of tasks completed by a team over several days. Your task is to implement a function `detect_throttled_tasks` that determines if the team is throttling their performance. Throttling is defined as completing tasks at a rate of less than 5 tasks per day over a cons... | code | allenai/Dolci-RL-Zero-Mix-7B | allenai_Dolci-RL-Zero-Mix-7B_e30ec3b467019ce7f10fd04fb8d7414db3d846038e20a03676549e6ed4abfeff | [
-0.018795764073729515,
-0.0037505177315324545,
-0.049656614661216736,
0.01878812536597252,
-0.0031738204415887594,
-0.02578587271273136,
-0.013225129805505276,
0.029921747744083405,
0.03454010188579559,
-0.013426104560494423,
0.07095877826213837,
0.03944716602563858,
-0.04409307613968849,
... | [
"from typing import List\n\ndef detect_throttled_tasks(tasks: List[int]) -> bool:\n \"\"\"\n Returns True if there exists any window of three consecutive days\n during which the team completed fewer than 5 tasks each day.\n Otherwise, returns False.\n \"\"\"\n # If we have fewer than 3 days, throt... | ["assert detect_throttled_tasks([8, 6, 7, 5, 7, 9]) == False", "assert detect_throttled_tasks([5, 5, 5, 5, 5]) == False", "assert detect_throttled_tasks([2, 2, 2, 2]) == True", "assert detect_throttled_tasks([3, 4, 3, 2, 5]) == True", "assert detect_throttled_tasks([10, 12, 15, 20]) == False", "assert detect_throttled_... | code_asserts |
b08f454a15e211ff | You are given a list of integers representing the heights of a group of people standing in a line. Your task is to determine if there is a person who is taller than all the people to their left and shorter than all the people to their right. Implement a function `find_special_person(heights: List[int]) -> int` that ret... | code | allenai/Dolci-RL-Zero-Mix-7B | allenai_Dolci-RL-Zero-Mix-7B_b08f454a15e211ff342d90787ab41cf540ec6ca138437d09e265a6cd5d5082a5 | [
0.018228968605399132,
-0.022193187847733498,
-0.04343629628419876,
0.07371398061513901,
0.004724045284092426,
-0.016456803306937218,
-0.0038940960075706244,
0.00031457588193006814,
0.05603145807981491,
-0.002453420776873827,
0.05479268729686737,
-0.0278859194368124,
0.008320675231516361,
-... | [
"from typing import List\n\n\ndef find_special_person(heights: List[int]) -> int:\n \"\"\"\n Returns the index of the first person who is\n - taller than everyone to their left, and\n - shorter than everyone to their right.\n \n If no such person exists (or the list is empty) the function\n ret... | ["assert find_special_person([4, 3, 2, 1, 5]) == 4", "assert find_special_person([1, 2, 1, 2, 1]) == -1", "assert find_special_person([]) == -1", "assert find_special_person([3, 3, 3, 3]) == -1", "assert find_special_person([2, 3, 1, 4, 5]) == 3", "assert find_special_person([5, 4, 3, 2, 1]) == -1", "assert find_specia... | code_asserts |
722aabfdaff47172 | Solve the following coding problem using the programming language python:
There are many anime that are about "love triangles": Alice loves Bob, and Charlie loves Bob as well, but Alice hates Charlie. You are thinking about an anime which has n characters. The characters are labeled from 1 to n. Every pair of two char... | code | agentica-org/DeepCoder-Preview-Dataset | agentica-org__DeepCoder-Preview-Dataset_15255 | [
0.05194191634654999,
0.015042007900774479,
-0.020782092586159706,
0.07555598020553589,
-0.0025029382668435574,
0.017572613433003426,
-0.060637135058641434,
0.01200608629733324,
0.012642665766179562,
0.005884762387722731,
0.02137668989598751,
-0.03291347995400429,
-0.004679437726736069,
0.0... | [
"class DSU(object):\n\n\tdef __init__(self, n):\n\t\tself.father = list(range(n))\n\t\tself.size = n\n\n\tdef union(self, x, s):\n\t\tx = self.find(x)\n\t\ts = self.find(s)\n\t\tif x == s:\n\t\t\treturn\n\t\tself.father[s] = x\n\t\tself.size -= 1\n\n\tdef find(self, x):\n\t\txf = self.father[x]\n\t\tif xf != x:\n\t... | [{"input": "4 4\n1 2 0\n2 3 0\n2 4 0\n3 4 0\n", "output": "0"}, {"input": "6 6\n1 2 0\n2 3 1\n3 4 0\n4 5 1\n5 6 0\n6 1 1\n", "output": "0"}, {"input": "5 5\n1 2 0\n2 3 0\n3 4 0\n4 5 0\n1 5 0\n", "output": "0"}, {"input": "9 2\n1 2 0\n2 3 0\n", "output": "64"}, {"input": "28567 13\n28079 24675 1\n18409 26720 1\n980 1081... | code_stdio |
c981b86776fb9e14 | Given a list of documents represented as dictionaries, where each document has an ID as the key and a list of words as the value, implement a function `vocabulary(vec_docs)` that calculates the average document length and constructs a vocabulary dictionary. The vocabulary dictionary should count how many documents cont... | code | allenai/Dolci-RL-Zero-Mix-7B | allenai_Dolci-RL-Zero-Mix-7B_c981b86776fb9e1434e082f1d4013fbfdf7c8f3f047bd152eb02584b2d3b7d47 | [
0.029312146827578545,
-0.0018404775764793158,
-0.01789146102964878,
0.010916191153228283,
0.019560109823942184,
0.010935677215456963,
-0.006697566714137793,
-0.0009798749815672636,
-0.02949952706694603,
-0.04338617995381355,
0.0318804495036602,
-0.02480742707848549,
0.022268719971179962,
0... | [
"def vocabulary(vec_docs):\n \"\"\"\n Calculate the average document length and create a vocabulary dictionary\n that stores, for every unique word, the number of documents it appears in.\n\n Parameters\n ----------\n vec_docs : list[dict]\n A list where each element is a dictionary of the ... | ["assert vocabulary([{1: ['word1', 'word2', 'word3']}, {2: ['word2', 'word3', 'word4']}]) == (3.0, {'word1': 1, 'word2': 2, 'word3': 2, 'word4': 1})", "assert vocabulary([{1: ['hello', 'world']}, {2: ['hello']}, {3: ['world', 'hello', 'python']}]) == (2.0, {'hello': 3, 'world': 2, 'python': 1})", "assert vocabulary([{1... | code_asserts |
a36e4a5e651450e3 | Analyzing the mistakes people make while typing search queries is a complex and an interesting work. As there is no guaranteed way to determine what the user originally meant by typing some query, we have to use different sorts of heuristics.
Polycarp needed to write a code that could, given two words, check whether t... | code | agentica-org/DeepCoder-Preview-Dataset | agentica-org__DeepCoder-Preview-Dataset_20418 | [
0.06976129859685898,
0.01293522771447897,
-0.04331178218126297,
0.01775248907506466,
-0.026922309771180153,
-0.04467075318098068,
-0.049205612391233444,
0.009097174741327763,
-0.0013824696652591228,
-0.047043781727552414,
0.03870803117752075,
-0.027757644653320312,
0.042984843254089355,
0.... | [
"from math import *\nn = int(input())\ns = input()\nt = input()\nl = 0\nr = n - 1\nfor i in range(n):\n\tif s[i] == t[i]:\n\t\tl += 1\n\telse:\n\t\tbreak\nfor i in range(n - 1, -1, -1):\n\tif s[i] == t[i]:\n\t\tr -= 1\n\telse:\n\t\tbreak\nans = 0\nif s[l + 1:r + 1] == t[l:r]:\n\tans += 1\nif s[l:r] == t[l + 1:r + 1... | [{"input": "4\nabcc\nbcab\n", "output": "0\n"}, {"input": "4\nacca\nbabb\n", "output": "0\n"}, {"input": "4\naabc\naacb\n", "output": "2\n"}, {"input": "100\naaabaabbbababbbaabbbbbaaababbabbaaabbabaabbabbabbbbbabbaaabbbbbbbbbbbbbbbababaaababbaaabeabbabaabbab\naaabaabbbababbbaabbbbbaaababbabbaaabbabaabbabbabbbbbabbaaabb... | code_stdio |
c9a51d85c3a1e95f | "Solve the following coding problem using the programming language python:\n\nBob is travelling from(...TRUNCATED) | code | agentica-org/DeepCoder-Preview-Dataset | agentica-org__DeepCoder-Preview-Dataset_15192 | [0.02547115832567215,0.007902653887867928,-0.03812868893146515,0.043370045721530914,-0.0056413682177(...TRUNCATED) | ["t=eval(input(''))\ncnt=0\n\n\nwhile int(t)>int(cnt):\n\ts=input('')\n\tl=[]\n\tfor i in range(int((...TRUNCATED) | "[{\"input\": \"100\\n4\\nlrbbmqb\\ncd\\nr\\nowkk\\n7\\nid\\nqscdxrjmow\\nrxsjybldbe\\nsarcbyne\\ndy(...TRUNCATED) | code_stdio |
a480317082d81fee | "Valera the horse lives on a plane. The Cartesian coordinate system is defined on this plane. Also a(...TRUNCATED) | code | agentica-org/DeepCoder-Preview-Dataset | agentica-org__DeepCoder-Preview-Dataset_17564 | [-0.015229963697493076,0.023058723658323288,-0.05797955021262169,0.05535634979605675,-0.015685120597(...TRUNCATED) | ["def main():\n\t(a, b) = list(map(int, input().split()))\n\tif a == 0 and b == 0:\n\t\treturn 0\n\t(...TRUNCATED) | "[{\"input\": \"0 0\\n\", \"output\": \"0\\n\"}, {\"input\": \"1 0\\n\", \"output\": \"0\\n\"}, {\"i(...TRUNCATED) | code_stdio |
717fc1b5314de59d | "Baby is getting his frst tooth. This means more sleepless nights, but with the fun of feeling round(...TRUNCATED) | code | agentica-org/DeepCoder-Preview-Dataset | agentica-org__DeepCoder-Preview-Dataset_21815 | [0.011169230565428734,-0.058192986994981766,-0.05104486644268036,0.06026908755302429,-0.057188466191(...TRUNCATED) | ["def first_tooth(lst):\n\tgums = lst[:1] + lst + lst[-1:]\n\tdiff = [gums[i + 1] * 2 - gums[i] - gu(...TRUNCATED) | "{\"fn_name\": \"first_tooth\", \"inputs\": [[[1, 2, 3, 4]], [[1, 2, 6, 4]], [[1, 2, 5, 7, 1, 0, 9]](...TRUNCATED) | code_fn_call |
087f7a8db8ae1190 | "Two people are playing a game with a string $s$, consisting of lowercase latin letters. \n\nOn a pl(...TRUNCATED) | code | agentica-org/DeepCoder-Preview-Dataset | agentica-org__DeepCoder-Preview-Dataset_19441 | [0.057610053569078445,0.025841036811470985,-0.0451875776052475,0.08890049159526825,-0.04873375967144(...TRUNCATED) | ["b = []\np = 0\nfor s in input():\n\tif len(b) == 0:\n\t\tb = [s]\n\telif b[-1] == s:\n\t\tp = 1 - (...TRUNCATED) | "[{\"input\": \"abacaba\\n\", \"output\": \"No\\n\"}, {\"input\": \"iiq\\n\", \"output\": \"Yes\\n\"(...TRUNCATED) | code_stdio |
End of preview. Expand in Data Studio
README.md exists but content is empty.
- Downloads last month
- 192