Archer2.0
Collection
5 items • Updated • 1
prompt string | ground_truth string | ability string |
|---|---|---|
You will be given a question (problem specification) and will generate a correct Python program that matches the specification and passes all tests. You will NOT return anything except for the program.
Question: A triangle is called an equable triangle if its area equals its perimeter. Return `true`, if it is an equab... | {"functional": "\ndef check(candidate):\n assert candidate(5, 12, 13) == True\n assert candidate(2, 3, 4) == False\n assert candidate(6, 8, 10) == True\n assert candidate(7, 15, 20) == True\n assert candidate(17, 17, 30) == False\n assert candidate(7, 10, 12) == False\n assert candidate(6, 11, 12) ... | code |
You will be given a question (problem specification) and will generate a correct Python program that matches the specification and passes all tests. You will NOT return anything except for the program.
Question: As you might remember from our previous rounds, Vova really likes computer games. Now he is playing a strat... | {"inputs": ["5 1\n10 7 6 6 6\n8\n5 2\n4 5\n2 1\n5 2\n3 1\n3 1\n4 1\n5 2\n", "1 1\n1\n1\n1 1\n", "5 5\n2 1 2 4 1\n5\n5 3\n1 1\n5 1\n2 1\n2 3\n", "100 5\n45 51 23 10 62 69 48 47 47 59 58 14 54 34 66 78 92 66 42 25 96 68 35 50 58 77 87 100 57 42 43 76 24 70 26 98 33 11 41 9 17 65 53 23 45 5 24 98 73 91 92 73 51 68 82 95 2... | code |
You will be given a question (problem specification) and will generate a correct Python program that matches the specification and passes all tests. You will NOT return anything except for the program.
Question: A parking lot in the City consists of n parking spaces, standing in a line. The parking spaces are numbered... | {"inputs": ["1 10\n1 362993\n2 362993\n1 220493\n2 220493\n1 46839\n2 46839\n1 962005\n2 962005\n1 706377\n2 706377\n", "4001 20\n1 219922\n1 784162\n1 150653\n1 49911\n1 600728\n1 808982\n1 71325\n1 78738\n1 275888\n1 789813\n1 877804\n1 293963\n1 209422\n1 285112\n1 788602\n1 627009\n1 624772\n1 332910\n1 921117\n1 6... | code |
You will be given a question (problem specification) and will generate a correct Python program that matches the specification and passes all tests. You will NOT return anything except for the program.
Question: Xenny had N boxes with an integer printed on each of the boxes.
He wanted to find out how many distinct pa... | {"inputs": ["10 1\n1 0 3 4 5 6 7 8 9 10\n\nSAMPLE", "2 1\n1 0 3 4 5 6 13 8 6 10\n\nSAMPLE", "10 2\n1 0 3 4 5 6 4 8 9 10\n\nTAMPLE", "2 2\n1 0 3 4 4 11 13 1 6 10\n\nSAMPLE", "10 2\n1 0 3 5 5 6 4 8 9 10\n\nTAMPLE", "3 1\n-1 1 3 5 4 11 24 9 6 10\n\nSAMPLE", "6 1\n0 1 3 1 3 6 8 5 5 10\n\nSAMPLE", "4 1\n1 2 1 4 5 6 13 8 6 7... | code |
You will be given a question (problem specification) and will generate a correct Python program that matches the specification and passes all tests. You will NOT return anything except for the program.
Question: A string is beautiful if:
It consists of the first k letters of the English lowercase alphabet.
It does no... | {"functional": "def check(candidate):\n assert candidate(s = \"abcz\", k = 26) == \"abda\"\n assert candidate(s = \"dc\", k = 4) == \"\"\n\n\ncheck(Solution().smallestBeautifulString)"} | code |
You will be given a question (problem specification) and will generate a correct Python program that matches the specification and passes all tests. You will NOT return anything except for the program.
Question: There are N persons called Person 1 through Person N.
You are given M facts that "Person A_i and Person B_i... | {"inputs": ["5 3\n1 2\n3 4\n5 1\n", "4 10\n1 2\n2 1\n1 2\n2 1\n1 2\n1 3\n1 4\n2 3\n2 4\n3 4\n", "10 4\n3 1\n4 1\n5 9\n2 6\n", "10 4\n3 1\n3 1\n5 9\n2 6", "4 10\n1 1\n2 1\n1 2\n2 1\n1 2\n1 3\n1 4\n2 3\n2 4\n3 4", "2 0\n1 1\n2 1\n1 6\n2 1\n1 2\n1 3\n1 4\n3 3\n2 4\n4 4", "10 4\n6 1\n3 1\n5 6\n2 6", "5 2\n1 4\n3 4\n3 1", "... | code |
You will be given a question (problem specification) and will generate a correct Python program that matches the specification and passes all tests. You will NOT return anything except for the program.
Question: You are given a board of size n × n, where n is odd (not divisible by 2). Initially, each cell of the board... | {"inputs": ["3\n5\n3005\n3005\n", "1\n69791\n", "1\n214541\n", "1\n499999\n", "1\n214145\n", "3\n5\n3005\n1983\n", "1\n203317\n", "3\n7\n3005\n3005\n", "1\n288977\n", "1\n254785\n", "1\n54111\n", "3\n7\n3005\n5103\n", "1\n151107\n", "1\n188269\n", "1\n39575\n", "3\n11\n3005\n5103\n", "1\n345015\n", "3\n11\n3005\n5405\n... | code |
You will be given a question (problem specification) and will generate a correct Python program that matches the specification and passes all tests. You will NOT return anything except for the program.
Question: John is developing a system to report fuel usage but needs help with the coding.
First, he needs you to wr... | {"functional": "\ndef check(candidate):\n assert candidate(10, 60) == 600\n assert candidate(8, 0) == 0\n assert candidate(6.4, 54) == 843.75\n assert candidate(9.3, 87.3) == 938.71\n assert candidate(11.7, 63.4) == 541.88\n\ncheck(total_kilometers)\n "} | code |
You will be given a question (problem specification) and will generate a correct Python program that matches the specification and passes all tests. You will NOT return anything except for the program.
Question: The palindrome is a string that can be read the same way from left to right and from right to left. For exa... | {"inputs": ["2\n2\n0", "2\n4\n0", "2\n8\n0", "2\n10\n0", "2\n15\n0", "2\n0\n0", "2\n24\n0", "2\n6\n1", "2\n0\n2", "2\n10\n2", "2\n6\n2", "2\n2\n2", "2\n9\n2", "2\n6\n4", "2\n1\n4", "2\n6\n7", "2\n12\n1", "2\n12\n2", "2\n6\n10", "2\n12\n4", "2\n4\n3", "2\n19\n0", "2\n3\n4", "2\n23\n0", "2\n17\n2", "2\n35\n0", "2\n1\n6",... | code |
You will be given a question (problem specification) and will generate a correct Python program that matches the specification and passes all tests. You will NOT return anything except for the program.
Question: Our Friend Monk has finally found the Temple of Programming secrets. However, the door of the temple is fir... | {"inputs": ["10\n97654 99999\n97655 99998\n97656 99997\n97657 99996\n97658 99995\n97659 99994\n97660 99993\n97661 99992\n97662 99991\n97663 99990", "10\n23 100000\n24 99999\n25 99998\n26 99997\n27 99996\n28 99995\n29 99994\n30 99993\n31 99992\n32 99991", "10\n23 100000\n24 99999\n25 99998\n26 99997\n27 99996\n28 99995\... | code |
End of preview. Expand in Data Studio
README.md exists but content is empty.
- Downloads last month
- 46