data_source stringclasses 3
values | prompt listlengths 2 2 | ability stringclasses 1
value | reward_model dict | extra_info dict |
|---|---|---|---|---|
code_contests_competition | [
{
"content": "You are an expert competitive programming assistant. You have access to a `code_interpreter` tool. You MUST use this tool to write small Python scripts to test your understanding, verify logic, or simulate example inputs BEFORE submitting your final code. Your final answer must contain the complet... | coding | {
"difficulty": "competition",
"ground_truth": {
"fn_name": null,
"inputs": [
"3\n((()))\n(())()\n()(()",
"3\n((()))\n(())()\n()())",
"3\n((()()\n(())()\n()(()",
"3\n((()))\n(())))\n()())",
"3\n)))(((\n(())))\n()())",
"3\n((()))\n(())()\n))(((",
"3\n((()()\n(())()\n... | {
"description_preview": "Problem description.\nVipul is a hardworking super-hero who maintains the bracket ratio of all the strings in the world. Recently he indulged himself in saving the string population so much that he lost his ability for checking brackets (luckily, not permanently ).Being his super-hero friend... |
code_contests_introductory | [
{
"content": "You are an expert competitive programming assistant. You have access to a `code_interpreter` tool. You MUST use this tool to write small Python scripts to test your understanding, verify logic, or simulate example inputs BEFORE submitting your final code. Your final answer must contain the complet... | coding | {
"difficulty": "introductory",
"ground_truth": {
"fn_name": null,
"inputs": [
"3\n1\n0 1\n0 0\n1 0\n2\n0 1\n0 0\n1 0\n2\n0 0\n0 2\n2 1",
"3\n1\n0 1\n0 -1\n1 0\n2\n0 1\n0 0\n1 0\n2\n0 0\n0 2\n2 1",
"3\n2\n0 1\n0 -1\n1 0\n2\n0 1\n0 0\n1 0\n2\n0 0\n0 2\n2 1",
"3\n2\n0 -1\n0 -1\n1 0\n2\... | {
"description_preview": "The Chef likes to stay in touch with his staff. So, the Chef, the head server, and the sous-chef all carry two-way transceivers so they can stay in constant contact. Of course, these transceivers have a limited range so if two are too far apart, they cannot communicate directly.\n\n\nThe Che... |
code_contests_interview | [
{
"content": "You are an expert competitive programming assistant. You have access to a `code_interpreter` tool. You MUST use this tool to write small Python scripts to test your understanding, verify logic, or simulate example inputs BEFORE submitting your final code. Your final answer must contain the complet... | coding | {
"difficulty": "interview",
"ground_truth": {
"fn_name": null,
"inputs": [
"2\n2 6\n10 11",
"2\n3 6\n10 11",
"2\n1 3\n10 11",
"2\n0 6\n10 11",
"2\n0 6\n0 11",
"2\n3 6\n8 22",
"2\n3 6\n8 4",
"2\n5 2\n10 2",
"2\n4 10\n8 6",
"2\n7 14\n8 6",
"2\... | {
"description_preview": "Frank explained its friend Felman the algorithm of Euclides to calculate the GCD \nof two numbers. Then Felman implements it algorithm \n\n\nint gcd(int a, int b)\n{\n\tif (b==0)\n\t\treturn a;\n\telse\n\t\treturn gcd(b,a%b);\n}\n\nand it proposes to Frank that makes it \nbut with a little i... |
code_contests_interview | [
{
"content": "You are an expert competitive programming assistant. You have access to a `code_interpreter` tool. You MUST use this tool to write small Python scripts to test your understanding, verify logic, or simulate example inputs BEFORE submitting your final code. Your final answer must contain the complet... | coding | {
"difficulty": "interview",
"ground_truth": {
"fn_name": null,
"inputs": [
"4\n47\n74\n477\n4747477",
"4\n47\n47\n477\n4747477",
"4\n7\n47\n477\n4747477",
"4\n4\n47\n477\n4747477",
"4\n7\n7\n477\n4747477",
"4\n7\n44\n477\n4747477",
"4\n44\n74\n477\n4747477",
... | {
"description_preview": "A Little Elephant from the Zoo of Lviv likes lucky strings, i.e., the strings that consist only of the lucky digits 4 and 7.\nThe Little Elephant calls some string T of the length M balanced if there exists at least one integer X (1 ≤ X ≤ M) such that the number of digits 4 in the substring ... |
code_contests_interview | [
{
"content": "You are an expert competitive programming assistant. You have access to a `code_interpreter` tool. You MUST use this tool to write small Python scripts to test your understanding, verify logic, or simulate example inputs BEFORE submitting your final code. Your final answer must contain the complet... | coding | {
"difficulty": "interview",
"ground_truth": {
"fn_name": null,
"inputs": [
"4\naaa\nabc\nabdbca\nabba",
"4\naaa\nabc\nabdbca\nabca",
"4\naaa\nabc\nabdbc`\naaca",
"4\naab\nacc\n`bd`cb\naaad",
"4\nbaa\nabc\n`bd`bb\naabd",
"4\nbab\nabb\nbb`db`\naabd",
"4\nbaa\n`aa\nbb... | {
"description_preview": "Given a string s. Can you make it a palindrome by deleting exactly one character? Note that size of the string after deletion would be one less than it was before. \n\nInput\nFirst line of the input contains a single integer T denoting number of test cases.\nFor each test case, you are given... |
code_contests_competition | [
{
"content": "You are an expert competitive programming assistant. You have access to a `code_interpreter` tool. You MUST use this tool to write small Python scripts to test your understanding, verify logic, or simulate example inputs BEFORE submitting your final code. Your final answer must contain the complet... | coding | {
"difficulty": "competition",
"ground_truth": {
"fn_name": null,
"inputs": [
"2\n5 10\n3 4 6 1 9\n3 2\n1 3 4"
],
"outputs": [
"1\n0"
]
},
"style": "prime_code"
} | {
"description_preview": "An established group of scientists are working on finding solution to NP hard problems. They claim Subset Sum as an NP-hard problem. The problem is to determine whether there exists a subset of a given set S whose sum is a given number K. \nYou are a computer engineer and you claim to solv... |
code_contests_competition | [
{
"content": "You are an expert competitive programming assistant. You have access to a `code_interpreter` tool. You MUST use this tool to write small Python scripts to test your understanding, verify logic, or simulate example inputs BEFORE submitting your final code. Your final answer must contain the complet... | coding | {
"difficulty": "competition",
"ground_truth": {
"fn_name": null,
"inputs": [
"5 5\n3 2 3 1 1\n",
"4 3\n2 1 4 3\n",
"2 0\n2 2\n",
"5 0\n884430748 884430748 708433020 708433020 708433020\n",
"2 1\n1 1\n",
"2 0\n2 1\n",
"5 2\n65390026 770505072 65390026 65390026 65390... | {
"description_preview": "You are given an array of n positive integers a_1, a_2, ..., a_n. You can perform the following operation any number of times: select several distinct indices i_1, i_2, ..., i_k (1 ≤ i_j ≤ n) and move the number standing at the position i_1 to the position i_2, the number at the position i_2... |
code_contests_competition | [
{
"content": "You are an expert competitive programming assistant. You have access to a `code_interpreter` tool. You MUST use this tool to write small Python scripts to test your understanding, verify logic, or simulate example inputs BEFORE submitting your final code. Your final answer must contain the complet... | coding | {
"difficulty": "competition",
"ground_truth": {
"fn_name": null,
"inputs": [
"4 4 2\n2 3\n1 2\n1 3\n1 4\n",
"5 8 2\n2 1\n4 2\n5 4\n5 2\n4 3\n5 1\n4 1\n3 2\n",
"5 7 2\n1 5\n3 2\n2 5\n3 4\n1 2\n5 3\n1 3\n",
"16 20 2\n10 3\n5 3\n10 5\n12 7\n7 6\n9 12\n9 6\n1 10\n11 16\n11 1\n16 2\n10 2... | {
"description_preview": "There are n persons who initially don't know each other. On each morning, two of them, who were not friends before, become friends.\n\nWe want to plan a trip for every evening of m days. On each trip, you have to select a group of people that will go on the trip. For every person, one of the... |
code_contests_competition | [
{
"content": "You are an expert competitive programming assistant. You have access to a `code_interpreter` tool. You MUST use this tool to write small Python scripts to test your understanding, verify logic, or simulate example inputs BEFORE submitting your final code. Your final answer must contain the complet... | coding | {
"difficulty": "competition",
"ground_truth": {
"fn_name": null,
"inputs": [
"22\n0011223344556677889988\n",
"11\n00000000008\n",
"11\n31415926535\n",
"51\n882889888888689888850888388887688788888888888858888\n",
"55\n7271714707719515303911625619272900050990324951111943573\n",
... | {
"description_preview": "Let's call a string a phone number if it has length 11 and fits the pattern \"8xxxxxxxxxx\", where each \"x\" is replaced by a digit.\n\nFor example, \"80123456789\" and \"80000000000\" are phone numbers, while \"8012345678\" and \"79000000000\" are not.\n\nYou have n cards with digits, and ... |
code_contests_competition | [
{
"content": "You are an expert competitive programming assistant. You have access to a `code_interpreter` tool. You MUST use this tool to write small Python scripts to test your understanding, verify logic, or simulate example inputs BEFORE submitting your final code. Your final answer must contain the complet... | coding | {
"difficulty": "competition",
"ground_truth": {
"fn_name": null,
"inputs": [
"3 2 998244353\n",
"9 3 998244353\n",
"3 1 998244353\n",
"9 4 998244353\n",
"53812 4 967428361\n",
"7 2 400166453\n",
"75727 16 485722667\n",
"65536 10 802338989\n",
"65535 12 ... | {
"description_preview": "Chouti thought about his very first days in competitive programming. When he had just learned to write merge sort, he thought that the merge sort is too slow, so he restricted the maximum depth of recursion and modified the merge sort to the following:\n\n<image>\n\nChouti found his idea dum... |
End of preview. Expand in Data Studio
README.md exists but content is empty.
- Downloads last month
- 13