data_source stringclasses 1
value | prompt listlengths 2 2 | ability stringclasses 1
value | reward_model dict | extra_info dict |
|---|---|---|---|---|
code_selection | [
{
"content": "You are an expert code evaluation system.",
"role": "system"
},
{
"content": "=== PROGRAMMING PROBLEM ===\n\nTitle: minimum-operations-to-make-the-integer-zero\nPlatform: leetcode\nDifficulty: medium\n\nProblem Statement:\nYou are given two integers num1 and num2.\nIn one operation, yo... | code_verification | {
"ground_truth": "{\"labels\": [false, true], \"num_candidates\": 2}",
"style": "rule"
} | {
"domain_id": 4,
"domain_name": "leetcode_medium",
"judge_context": "{\"problem\": \"=== PROGRAMMING PROBLEM ===\\n\\nTitle: minimum-operations-to-make-the-integer-zero\\nPlatform: leetcode\\nDifficulty: medium\\n\\nProblem Statement:\\nYou are given two integers num1 and num2.\\nIn one operation, you can choose... |
code_selection | [
{
"content": "You are an expert code evaluation system.",
"role": "system"
},
{
"content": "=== PROGRAMMING PROBLEM ===\n\nTitle: minimum-time-to-make-array-sum-at-most-x\nPlatform: leetcode\nDifficulty: hard\n\nProblem Statement:\nYou are given two 0-indexed integer arrays nums1 and nums2 of equal ... | code_verification | {
"ground_truth": "{\"labels\": [true, false], \"num_candidates\": 2}",
"style": "rule"
} | {
"domain_id": 5,
"domain_name": "leetcode_hard",
"judge_context": "{\"problem\": \"=== PROGRAMMING PROBLEM ===\\n\\nTitle: minimum-time-to-make-array-sum-at-most-x\\nPlatform: leetcode\\nDifficulty: hard\\n\\nProblem Statement:\\nYou are given two 0-indexed integer arrays nums1 and nums2 of equal length. Every s... |
code_selection | [
{
"content": "You are an expert code evaluation system.",
"role": "system"
},
{
"content": "=== PROGRAMMING PROBLEM ===\n\nTitle: Pentagon\nPlatform: atcoder\nDifficulty: easy\n\nProblem Statement:\nA regular pentagon P is shown in the figure below.\n\nDetermine whether the length of the line segmen... | code_verification | {
"ground_truth": "{\"labels\": [true, false], \"num_candidates\": 2}",
"style": "rule"
} | {
"domain_id": 0,
"domain_name": "atcoder_easy",
"judge_context": "{\"problem\": \"=== PROGRAMMING PROBLEM ===\\n\\nTitle: Pentagon\\nPlatform: atcoder\\nDifficulty: easy\\n\\nProblem Statement:\\nA regular pentagon P is shown in the figure below.\\n\\nDetermine whether the length of the line segment connecting p... |
code_selection | [
{
"content": "You are an expert code evaluation system.",
"role": "system"
},
{
"content": "=== PROGRAMMING PROBLEM ===\n\nTitle: maximum-total-reward-using-operations-i\nPlatform: leetcode\nDifficulty: medium\n\nProblem Statement:\nYou are given an integer array rewardValues of length n, representi... | code_verification | {
"ground_truth": "{\"labels\": [true, false], \"num_candidates\": 2}",
"style": "rule"
} | {
"domain_id": 4,
"domain_name": "leetcode_medium",
"judge_context": "{\"problem\": \"=== PROGRAMMING PROBLEM ===\\n\\nTitle: maximum-total-reward-using-operations-i\\nPlatform: leetcode\\nDifficulty: medium\\n\\nProblem Statement:\\nYou are given an integer array rewardValues of length n, representing the values... |
code_selection | [
{
"content": "You are an expert code evaluation system.",
"role": "system"
},
{
"content": "=== PROGRAMMING PROBLEM ===\n\nTitle: B. Chemistry\nPlatform: codeforces\nDifficulty: medium\n\nProblem Statement:\nYou are given a string $s$ of length $n$, consisting of lowercase Latin letters, and an inte... | code_verification | {
"ground_truth": "{\"labels\": [true, false], \"num_candidates\": 2}",
"style": "rule"
} | {
"domain_id": 0,
"domain_name": "unknown",
"judge_context": "{\"problem\": \"=== PROGRAMMING PROBLEM ===\\n\\nTitle: B. Chemistry\\nPlatform: codeforces\\nDifficulty: medium\\n\\nProblem Statement:\\nYou are given a string $s$ of length $n$, consisting of lowercase Latin letters, and an integer $k$.\\n\\nYou nee... |
code_selection | [
{
"content": "You are an expert code evaluation system.",
"role": "system"
},
{
"content": "=== PROGRAMMING PROBLEM ===\n\nTitle: most-frequent-ids\nPlatform: leetcode\nDifficulty: medium\n\nProblem Statement:\nThe problem involves tracking the frequency of IDs in a collection that changes over time... | code_verification | {
"ground_truth": "{\"labels\": [false, true], \"num_candidates\": 2}",
"style": "rule"
} | {
"domain_id": 4,
"domain_name": "leetcode_medium",
"judge_context": "{\"problem\": \"=== PROGRAMMING PROBLEM ===\\n\\nTitle: most-frequent-ids\\nPlatform: leetcode\\nDifficulty: medium\\n\\nProblem Statement:\\nThe problem involves tracking the frequency of IDs in a collection that changes over time. You have tw... |
code_selection | [
{
"content": "You are an expert code evaluation system.",
"role": "system"
},
{
"content": "=== PROGRAMMING PROBLEM ===\n\nTitle: construct-string-with-minimum-cost\nPlatform: leetcode\nDifficulty: hard\n\nProblem Statement:\nYou are given a string target, an array of strings words, and an integer a... | code_verification | {
"ground_truth": "{\"labels\": [true, false], \"num_candidates\": 2}",
"style": "rule"
} | {
"domain_id": 5,
"domain_name": "leetcode_hard",
"judge_context": "{\"problem\": \"=== PROGRAMMING PROBLEM ===\\n\\nTitle: construct-string-with-minimum-cost\\nPlatform: leetcode\\nDifficulty: hard\\n\\nProblem Statement:\\nYou are given a string target, an array of strings words, and an integer array costs, bot... |
code_selection | [
{
"content": "You are an expert code evaluation system.",
"role": "system"
},
{
"content": "=== PROGRAMMING PROBLEM ===\n\nTitle: generate-binary-strings-without-adjacent-zeros\nPlatform: leetcode\nDifficulty: medium\n\nProblem Statement:\nYou are given a positive integer n.\nA binary string x is va... | code_verification | {
"ground_truth": "{\"labels\": [false, true], \"num_candidates\": 2}",
"style": "rule"
} | {
"domain_id": 4,
"domain_name": "leetcode_medium",
"judge_context": "{\"problem\": \"=== PROGRAMMING PROBLEM ===\\n\\nTitle: generate-binary-strings-without-adjacent-zeros\\nPlatform: leetcode\\nDifficulty: medium\\n\\nProblem Statement:\\nYou are given a positive integer n.\\nA binary string x is valid if all s... |
code_selection | [
{
"content": "You are an expert code evaluation system.",
"role": "system"
},
{
"content": "=== PROGRAMMING PROBLEM ===\n\nTitle: construct-string-with-minimum-cost\nPlatform: leetcode\nDifficulty: hard\n\nProblem Statement:\nYou are given a string target, an array of strings words, and an integer a... | code_verification | {
"ground_truth": "{\"labels\": [true, false], \"num_candidates\": 2}",
"style": "rule"
} | {
"domain_id": 5,
"domain_name": "leetcode_hard",
"judge_context": "{\"problem\": \"=== PROGRAMMING PROBLEM ===\\n\\nTitle: construct-string-with-minimum-cost\\nPlatform: leetcode\\nDifficulty: hard\\n\\nProblem Statement:\\nYou are given a string target, an array of strings words, and an integer array costs, bot... |
code_selection | [
{
"content": "You are an expert code evaluation system.",
"role": "system"
},
{
"content": "=== PROGRAMMING PROBLEM ===\n\nTitle: Delimiter\nPlatform: atcoder\nDifficulty: easy\n\nProblem Statement:\nYou are given N integers A_1,A_2,\\dots,A_N, one per line, over N lines. However, N is not given in ... | code_verification | {
"ground_truth": "{\"labels\": [false, true], \"num_candidates\": 2}",
"style": "rule"
} | {
"domain_id": 0,
"domain_name": "atcoder_easy",
"judge_context": "{\"problem\": \"=== PROGRAMMING PROBLEM ===\\n\\nTitle: Delimiter\\nPlatform: atcoder\\nDifficulty: easy\\n\\nProblem Statement:\\nYou are given N integers A_1,A_2,\\\\dots,A_N, one per line, over N lines. However, N is not given in the input.\\r\... |
code_selection | [
{
"content": "You are an expert code evaluation system.",
"role": "system"
},
{
"content": "=== PROGRAMMING PROBLEM ===\n\nTitle: Delimiter\nPlatform: atcoder\nDifficulty: easy\n\nProblem Statement:\nYou are given N integers A_1,A_2,\\dots,A_N, one per line, over N lines. However, N is not given in ... | code_verification | {
"ground_truth": "{\"labels\": [true, false], \"num_candidates\": 2}",
"style": "rule"
} | {
"domain_id": 0,
"domain_name": "atcoder_easy",
"judge_context": "{\"problem\": \"=== PROGRAMMING PROBLEM ===\\n\\nTitle: Delimiter\\nPlatform: atcoder\\nDifficulty: easy\\n\\nProblem Statement:\\nYou are given N integers A_1,A_2,\\\\dots,A_N, one per line, over N lines. However, N is not given in the input.\\r\... |
code_selection | [
{
"content": "You are an expert code evaluation system.",
"role": "system"
},
{
"content": "=== PROGRAMMING PROBLEM ===\n\nTitle: Printing Machine\nPlatform: atcoder\nDifficulty: hard\n\nProblem Statement:\nThere are N products labeled 1 to N flowing on a conveyor belt.\r\nA Keyence printer is attac... | code_verification | {
"ground_truth": "{\"labels\": [false, true], \"num_candidates\": 2}",
"style": "rule"
} | {
"domain_id": 2,
"domain_name": "atcoder_hard",
"judge_context": "{\"problem\": \"=== PROGRAMMING PROBLEM ===\\n\\nTitle: Printing Machine\\nPlatform: atcoder\\nDifficulty: hard\\n\\nProblem Statement:\\nThere are N products labeled 1 to N flowing on a conveyor belt.\\r\\nA Keyence printer is attached to the con... |
code_selection | [
{
"content": "You are an expert code evaluation system.",
"role": "system"
},
{
"content": "=== PROGRAMMING PROBLEM ===\n\nTitle: most-frequent-ids\nPlatform: leetcode\nDifficulty: medium\n\nProblem Statement:\nThe problem involves tracking the frequency of IDs in a collection that changes over time... | code_verification | {
"ground_truth": "{\"labels\": [true, false], \"num_candidates\": 2}",
"style": "rule"
} | {
"domain_id": 4,
"domain_name": "leetcode_medium",
"judge_context": "{\"problem\": \"=== PROGRAMMING PROBLEM ===\\n\\nTitle: most-frequent-ids\\nPlatform: leetcode\\nDifficulty: medium\\n\\nProblem Statement:\\nThe problem involves tracking the frequency of IDs in a collection that changes over time. You have tw... |
code_selection | [
{
"content": "You are an expert code evaluation system.",
"role": "system"
},
{
"content": "=== PROGRAMMING PROBLEM ===\n\nTitle: find-maximum-non-decreasing-array-length\nPlatform: leetcode\nDifficulty: hard\n\nProblem Statement:\nYou are given a 0-indexed integer array nums.\nYou can perform any n... | code_verification | {
"ground_truth": "{\"labels\": [true, false], \"num_candidates\": 2}",
"style": "rule"
} | {
"domain_id": 5,
"domain_name": "leetcode_hard",
"judge_context": "{\"problem\": \"=== PROGRAMMING PROBLEM ===\\n\\nTitle: find-maximum-non-decreasing-array-length\\nPlatform: leetcode\\nDifficulty: hard\\n\\nProblem Statement:\\nYou are given a 0-indexed integer array nums.\\nYou can perform any number of opera... |
code_selection | [
{
"content": "You are an expert code evaluation system.",
"role": "system"
},
{
"content": "=== PROGRAMMING PROBLEM ===\n\nTitle: Mex and Update\nPlatform: atcoder\nDifficulty: hard\n\nProblem Statement:\nYou are given a sequence A=(A_1,A_2,\\dots,A_N) of length N.\r\nRespond to the following Q quer... | code_verification | {
"ground_truth": "{\"labels\": [false, true], \"num_candidates\": 2}",
"style": "rule"
} | {
"domain_id": 2,
"domain_name": "atcoder_hard",
"judge_context": "{\"problem\": \"=== PROGRAMMING PROBLEM ===\\n\\nTitle: Mex and Update\\nPlatform: atcoder\\nDifficulty: hard\\n\\nProblem Statement:\\nYou are given a sequence A=(A_1,A_2,\\\\dots,A_N) of length N.\\r\\nRespond to the following Q queries in the o... |
code_selection | [
{
"content": "You are an expert code evaluation system.",
"role": "system"
},
{
"content": "=== PROGRAMMING PROBLEM ===\n\nTitle: Takahashi Gets Lost\nPlatform: atcoder\nDifficulty: medium\n\nProblem Statement:\nThere is a grid with H rows and W columns.\nEach cell of the grid is land or sea, which ... | code_verification | {
"ground_truth": "{\"labels\": [true, false], \"num_candidates\": 2}",
"style": "rule"
} | {
"domain_id": 1,
"domain_name": "atcoder_medium",
"judge_context": "{\"problem\": \"=== PROGRAMMING PROBLEM ===\\n\\nTitle: Takahashi Gets Lost\\nPlatform: atcoder\\nDifficulty: medium\\n\\nProblem Statement:\\nThere is a grid with H rows and W columns.\\nEach cell of the grid is land or sea, which is represente... |
code_selection | [
{
"content": "You are an expert code evaluation system.",
"role": "system"
},
{
"content": "=== PROGRAMMING PROBLEM ===\n\nTitle: LOWER\nPlatform: atcoder\nDifficulty: medium\n\nProblem Statement:\nYou are given a string S of length N consisting of uppercase and lowercase English letters.\nLet us pe... | code_verification | {
"ground_truth": "{\"labels\": [true, false], \"num_candidates\": 2}",
"style": "rule"
} | {
"domain_id": 1,
"domain_name": "atcoder_medium",
"judge_context": "{\"problem\": \"=== PROGRAMMING PROBLEM ===\\n\\nTitle: LOWER\\nPlatform: atcoder\\nDifficulty: medium\\n\\nProblem Statement:\\nYou are given a string S of length N consisting of uppercase and lowercase English letters.\\nLet us perform Q opera... |
code_selection | [
{
"content": "You are an expert code evaluation system.",
"role": "system"
},
{
"content": "=== PROGRAMMING PROBLEM ===\n\nTitle: Isolation\nPlatform: atcoder\nDifficulty: hard\n\nProblem Statement:\nThere is an undirected graph with N vertices numbered 1 through N, and initially with 0 edges.\r\nGi... | code_verification | {
"ground_truth": "{\"labels\": [true, false], \"num_candidates\": 2}",
"style": "rule"
} | {
"domain_id": 2,
"domain_name": "atcoder_hard",
"judge_context": "{\"problem\": \"=== PROGRAMMING PROBLEM ===\\n\\nTitle: Isolation\\nPlatform: atcoder\\nDifficulty: hard\\n\\nProblem Statement:\\nThere is an undirected graph with N vertices numbered 1 through N, and initially with 0 edges.\\r\\nGiven Q queries,... |
code_selection | [
{
"content": "You are an expert code evaluation system.",
"role": "system"
},
{
"content": "=== PROGRAMMING PROBLEM ===\n\nTitle: count-of-sub-multisets-with-bounded-sum\nPlatform: leetcode\nDifficulty: hard\n\nProblem Statement:\nYou are given a 0-indexed array nums of non-negative integers, and tw... | code_verification | {
"ground_truth": "{\"labels\": [false, true], \"num_candidates\": 2}",
"style": "rule"
} | {
"domain_id": 5,
"domain_name": "leetcode_hard",
"judge_context": "{\"problem\": \"=== PROGRAMMING PROBLEM ===\\n\\nTitle: count-of-sub-multisets-with-bounded-sum\\nPlatform: leetcode\\nDifficulty: hard\\n\\nProblem Statement:\\nYou are given a 0-indexed array nums of non-negative integers, and two integers l an... |
code_selection | [
{
"content": "You are an expert code evaluation system.",
"role": "system"
},
{
"content": "=== PROGRAMMING PROBLEM ===\n\nTitle: Takahashi Gets Lost\nPlatform: atcoder\nDifficulty: medium\n\nProblem Statement:\nThere is a grid with H rows and W columns.\nEach cell of the grid is land or sea, which ... | code_verification | {
"ground_truth": "{\"labels\": [true, false], \"num_candidates\": 2}",
"style": "rule"
} | {
"domain_id": 1,
"domain_name": "atcoder_medium",
"judge_context": "{\"problem\": \"=== PROGRAMMING PROBLEM ===\\n\\nTitle: Takahashi Gets Lost\\nPlatform: atcoder\\nDifficulty: medium\\n\\nProblem Statement:\\nThere is a grid with H rows and W columns.\\nEach cell of the grid is land or sea, which is represente... |
code_selection | [
{
"content": "You are an expert code evaluation system.",
"role": "system"
},
{
"content": "=== PROGRAMMING PROBLEM ===\n\nTitle: Joint Two Strings\nPlatform: atcoder\nDifficulty: hard\n\nProblem Statement:\nYou are given N strings S_1, S_2, \\ldots, S_N consisting of lowercase English letters, and ... | code_verification | {
"ground_truth": "{\"labels\": [false, true], \"num_candidates\": 2}",
"style": "rule"
} | {
"domain_id": 2,
"domain_name": "atcoder_hard",
"judge_context": "{\"problem\": \"=== PROGRAMMING PROBLEM ===\\n\\nTitle: Joint Two Strings\\nPlatform: atcoder\\nDifficulty: hard\\n\\nProblem Statement:\\nYou are given N strings S_1, S_2, \\\\ldots, S_N consisting of lowercase English letters, and a string T con... |
code_selection | [
{
"content": "You are an expert code evaluation system.",
"role": "system"
},
{
"content": "=== PROGRAMMING PROBLEM ===\n\nTitle: sum-of-imbalance-numbers-of-all-subarrays\nPlatform: leetcode\nDifficulty: hard\n\nProblem Statement:\nThe imbalance number of a 0-indexed integer array arr of length n i... | code_verification | {
"ground_truth": "{\"labels\": [true, false], \"num_candidates\": 2}",
"style": "rule"
} | {
"domain_id": 5,
"domain_name": "leetcode_hard",
"judge_context": "{\"problem\": \"=== PROGRAMMING PROBLEM ===\\n\\nTitle: sum-of-imbalance-numbers-of-all-subarrays\\nPlatform: leetcode\\nDifficulty: hard\\n\\nProblem Statement:\\nThe imbalance number of a 0-indexed integer array arr of length n is defined as th... |
code_selection | [
{
"content": "You are an expert code evaluation system.",
"role": "system"
},
{
"content": "=== PROGRAMMING PROBLEM ===\n\nTitle: generate-binary-strings-without-adjacent-zeros\nPlatform: leetcode\nDifficulty: medium\n\nProblem Statement:\nYou are given a positive integer n.\nA binary string x is va... | code_verification | {
"ground_truth": "{\"labels\": [true, false], \"num_candidates\": 2}",
"style": "rule"
} | {
"domain_id": 4,
"domain_name": "leetcode_medium",
"judge_context": "{\"problem\": \"=== PROGRAMMING PROBLEM ===\\n\\nTitle: generate-binary-strings-without-adjacent-zeros\\nPlatform: leetcode\\nDifficulty: medium\\n\\nProblem Statement:\\nYou are given a positive integer n.\\nA binary string x is valid if all s... |
code_selection | [
{
"content": "You are an expert code evaluation system.",
"role": "system"
},
{
"content": "=== PROGRAMMING PROBLEM ===\n\nTitle: remove-adjacent-almost-equal-characters\nPlatform: leetcode\nDifficulty: medium\n\nProblem Statement:\nYou are given a 0-indexed string word.\nIn one operation, you can p... | code_verification | {
"ground_truth": "{\"labels\": [true, false], \"num_candidates\": 2}",
"style": "rule"
} | {
"domain_id": 4,
"domain_name": "leetcode_medium",
"judge_context": "{\"problem\": \"=== PROGRAMMING PROBLEM ===\\n\\nTitle: remove-adjacent-almost-equal-characters\\nPlatform: leetcode\\nDifficulty: medium\\n\\nProblem Statement:\\nYou are given a 0-indexed string word.\\nIn one operation, you can pick any inde... |
code_selection | [
{
"content": "You are an expert code evaluation system.",
"role": "system"
},
{
"content": "=== PROGRAMMING PROBLEM ===\n\nTitle: count-of-sub-multisets-with-bounded-sum\nPlatform: leetcode\nDifficulty: hard\n\nProblem Statement:\nYou are given a 0-indexed array nums of non-negative integers, and tw... | code_verification | {
"ground_truth": "{\"labels\": [false, true], \"num_candidates\": 2}",
"style": "rule"
} | {
"domain_id": 5,
"domain_name": "leetcode_hard",
"judge_context": "{\"problem\": \"=== PROGRAMMING PROBLEM ===\\n\\nTitle: count-of-sub-multisets-with-bounded-sum\\nPlatform: leetcode\\nDifficulty: hard\\n\\nProblem Statement:\\nYou are given a 0-indexed array nums of non-negative integers, and two integers l an... |
code_selection | [
{
"content": "You are an expert code evaluation system.",
"role": "system"
},
{
"content": "=== PROGRAMMING PROBLEM ===\n\nTitle: LOWER\nPlatform: atcoder\nDifficulty: medium\n\nProblem Statement:\nYou are given a string S of length N consisting of uppercase and lowercase English letters.\nLet us pe... | code_verification | {
"ground_truth": "{\"labels\": [false, true], \"num_candidates\": 2}",
"style": "rule"
} | {
"domain_id": 1,
"domain_name": "atcoder_medium",
"judge_context": "{\"problem\": \"=== PROGRAMMING PROBLEM ===\\n\\nTitle: LOWER\\nPlatform: atcoder\\nDifficulty: medium\\n\\nProblem Statement:\\nYou are given a string S of length N consisting of uppercase and lowercase English letters.\\nLet us perform Q opera... |
code_selection | [
{
"content": "You are an expert code evaluation system.",
"role": "system"
},
{
"content": "=== PROGRAMMING PROBLEM ===\n\nTitle: LOWER\nPlatform: atcoder\nDifficulty: medium\n\nProblem Statement:\nYou are given a string S of length N consisting of uppercase and lowercase English letters.\nLet us pe... | code_verification | {
"ground_truth": "{\"labels\": [true, false], \"num_candidates\": 2}",
"style": "rule"
} | {
"domain_id": 1,
"domain_name": "atcoder_medium",
"judge_context": "{\"problem\": \"=== PROGRAMMING PROBLEM ===\\n\\nTitle: LOWER\\nPlatform: atcoder\\nDifficulty: medium\\n\\nProblem Statement:\\nYou are given a string S of length N consisting of uppercase and lowercase English letters.\\nLet us perform Q opera... |
code_selection | [
{
"content": "You are an expert code evaluation system.",
"role": "system"
},
{
"content": "=== PROGRAMMING PROBLEM ===\n\nTitle: maximum-total-reward-using-operations-i\nPlatform: leetcode\nDifficulty: medium\n\nProblem Statement:\nYou are given an integer array rewardValues of length n, representi... | code_verification | {
"ground_truth": "{\"labels\": [false, true], \"num_candidates\": 2}",
"style": "rule"
} | {
"domain_id": 4,
"domain_name": "leetcode_medium",
"judge_context": "{\"problem\": \"=== PROGRAMMING PROBLEM ===\\n\\nTitle: maximum-total-reward-using-operations-i\\nPlatform: leetcode\\nDifficulty: medium\\n\\nProblem Statement:\\nYou are given an integer array rewardValues of length n, representing the values... |
code_selection | [
{
"content": "You are an expert code evaluation system.",
"role": "system"
},
{
"content": "=== PROGRAMMING PROBLEM ===\n\nTitle: Range Connect MST\nPlatform: atcoder\nDifficulty: hard\n\nProblem Statement:\nThere is a graph with N + Q vertices, numbered 1, 2, \\ldots, N + Q. Initially, the graph ha... | code_verification | {
"ground_truth": "{\"labels\": [false, true], \"num_candidates\": 2}",
"style": "rule"
} | {
"domain_id": 2,
"domain_name": "atcoder_hard",
"judge_context": "{\"problem\": \"=== PROGRAMMING PROBLEM ===\\n\\nTitle: Range Connect MST\\nPlatform: atcoder\\nDifficulty: hard\\n\\nProblem Statement:\\nThere is a graph with N + Q vertices, numbered 1, 2, \\\\ldots, N + Q. Initially, the graph has no edges.\\n... |
code_selection | [
{
"content": "You are an expert code evaluation system.",
"role": "system"
},
{
"content": "=== PROGRAMMING PROBLEM ===\n\nTitle: Delimiter\nPlatform: atcoder\nDifficulty: easy\n\nProblem Statement:\nYou are given N integers A_1,A_2,\\dots,A_N, one per line, over N lines. However, N is not given in ... | code_verification | {
"ground_truth": "{\"labels\": [true, false], \"num_candidates\": 2}",
"style": "rule"
} | {
"domain_id": 0,
"domain_name": "atcoder_easy",
"judge_context": "{\"problem\": \"=== PROGRAMMING PROBLEM ===\\n\\nTitle: Delimiter\\nPlatform: atcoder\\nDifficulty: easy\\n\\nProblem Statement:\\nYou are given N integers A_1,A_2,\\\\dots,A_N, one per line, over N lines. However, N is not given in the input.\\r\... |
code_selection | [
{
"content": "You are an expert code evaluation system.",
"role": "system"
},
{
"content": "=== PROGRAMMING PROBLEM ===\n\nTitle: Printing Machine\nPlatform: atcoder\nDifficulty: hard\n\nProblem Statement:\nThere are N products labeled 1 to N flowing on a conveyor belt.\r\nA Keyence printer is attac... | code_verification | {
"ground_truth": "{\"labels\": [true, false], \"num_candidates\": 2}",
"style": "rule"
} | {
"domain_id": 2,
"domain_name": "atcoder_hard",
"judge_context": "{\"problem\": \"=== PROGRAMMING PROBLEM ===\\n\\nTitle: Printing Machine\\nPlatform: atcoder\\nDifficulty: hard\\n\\nProblem Statement:\\nThere are N products labeled 1 to N flowing on a conveyor belt.\\r\\nA Keyence printer is attached to the con... |
code_selection | [
{
"content": "You are an expert code evaluation system.",
"role": "system"
},
{
"content": "=== PROGRAMMING PROBLEM ===\n\nTitle: shortest-string-that-contains-three-strings\nPlatform: leetcode\nDifficulty: medium\n\nProblem Statement:\nGiven three strings a, b, and c, your task is to find a string ... | code_verification | {
"ground_truth": "{\"labels\": [true, false], \"num_candidates\": 2}",
"style": "rule"
} | {
"domain_id": 4,
"domain_name": "leetcode_medium",
"judge_context": "{\"problem\": \"=== PROGRAMMING PROBLEM ===\\n\\nTitle: shortest-string-that-contains-three-strings\\nPlatform: leetcode\\nDifficulty: medium\\n\\nProblem Statement:\\nGiven three strings a, b, and c, your task is to find a string that has the ... |
code_selection | [
{
"content": "You are an expert code evaluation system.",
"role": "system"
},
{
"content": "=== PROGRAMMING PROBLEM ===\n\nTitle: B. Chemistry\nPlatform: codeforces\nDifficulty: medium\n\nProblem Statement:\nYou are given a string $s$ of length $n$, consisting of lowercase Latin letters, and an inte... | code_verification | {
"ground_truth": "{\"labels\": [false, true], \"num_candidates\": 2}",
"style": "rule"
} | {
"domain_id": 0,
"domain_name": "unknown",
"judge_context": "{\"problem\": \"=== PROGRAMMING PROBLEM ===\\n\\nTitle: B. Chemistry\\nPlatform: codeforces\\nDifficulty: medium\\n\\nProblem Statement:\\nYou are given a string $s$ of length $n$, consisting of lowercase Latin letters, and an integer $k$.\\n\\nYou nee... |
code_selection | [
{
"content": "You are an expert code evaluation system.",
"role": "system"
},
{
"content": "=== PROGRAMMING PROBLEM ===\n\nTitle: longest-common-suffix-queries\nPlatform: leetcode\nDifficulty: hard\n\nProblem Statement:\nYou are given two arrays of strings wordsContainer and wordsQuery.\nFor each wo... | code_verification | {
"ground_truth": "{\"labels\": [false, true], \"num_candidates\": 2}",
"style": "rule"
} | {
"domain_id": 5,
"domain_name": "leetcode_hard",
"judge_context": "{\"problem\": \"=== PROGRAMMING PROBLEM ===\\n\\nTitle: longest-common-suffix-queries\\nPlatform: leetcode\\nDifficulty: hard\\n\\nProblem Statement:\\nYou are given two arrays of strings wordsContainer and wordsQuery.\\nFor each wordsQuery[i], y... |
code_selection | [
{
"content": "You are an expert code evaluation system.",
"role": "system"
},
{
"content": "=== PROGRAMMING PROBLEM ===\n\nTitle: longest-common-suffix-queries\nPlatform: leetcode\nDifficulty: hard\n\nProblem Statement:\nYou are given two arrays of strings wordsContainer and wordsQuery.\nFor each wo... | code_verification | {
"ground_truth": "{\"labels\": [false, true], \"num_candidates\": 2}",
"style": "rule"
} | {
"domain_id": 5,
"domain_name": "leetcode_hard",
"judge_context": "{\"problem\": \"=== PROGRAMMING PROBLEM ===\\n\\nTitle: longest-common-suffix-queries\\nPlatform: leetcode\\nDifficulty: hard\\n\\nProblem Statement:\\nYou are given two arrays of strings wordsContainer and wordsQuery.\\nFor each wordsQuery[i], y... |
code_selection | [
{
"content": "You are an expert code evaluation system.",
"role": "system"
},
{
"content": "=== PROGRAMMING PROBLEM ===\n\nTitle: Avoid K Palindrome 2\nPlatform: atcoder\nDifficulty: medium\n\nProblem Statement:\nYou are given a string S of length N consisting only of lowercase English letters.\nFin... | code_verification | {
"ground_truth": "{\"labels\": [false, true], \"num_candidates\": 2}",
"style": "rule"
} | {
"domain_id": 1,
"domain_name": "atcoder_medium",
"judge_context": "{\"problem\": \"=== PROGRAMMING PROBLEM ===\\n\\nTitle: Avoid K Palindrome 2\\nPlatform: atcoder\\nDifficulty: medium\\n\\nProblem Statement:\\nYou are given a string S of length N consisting only of lowercase English letters.\\nFind the number ... |
code_selection | [
{
"content": "You are an expert code evaluation system.",
"role": "system"
},
{
"content": "=== PROGRAMMING PROBLEM ===\n\nTitle: Joint Two Strings\nPlatform: atcoder\nDifficulty: hard\n\nProblem Statement:\nYou are given N strings S_1, S_2, \\ldots, S_N consisting of lowercase English letters, and ... | code_verification | {
"ground_truth": "{\"labels\": [true, false], \"num_candidates\": 2}",
"style": "rule"
} | {
"domain_id": 2,
"domain_name": "atcoder_hard",
"judge_context": "{\"problem\": \"=== PROGRAMMING PROBLEM ===\\n\\nTitle: Joint Two Strings\\nPlatform: atcoder\\nDifficulty: hard\\n\\nProblem Statement:\\nYou are given N strings S_1, S_2, \\\\ldots, S_N consisting of lowercase English letters, and a string T con... |
code_selection | [
{
"content": "You are an expert code evaluation system.",
"role": "system"
},
{
"content": "=== PROGRAMMING PROBLEM ===\n\nTitle: minimum-operations-to-make-the-integer-zero\nPlatform: leetcode\nDifficulty: medium\n\nProblem Statement:\nYou are given two integers num1 and num2.\nIn one operation, yo... | code_verification | {
"ground_truth": "{\"labels\": [false, true], \"num_candidates\": 2}",
"style": "rule"
} | {
"domain_id": 4,
"domain_name": "leetcode_medium",
"judge_context": "{\"problem\": \"=== PROGRAMMING PROBLEM ===\\n\\nTitle: minimum-operations-to-make-the-integer-zero\\nPlatform: leetcode\\nDifficulty: medium\\n\\nProblem Statement:\\nYou are given two integers num1 and num2.\\nIn one operation, you can choose... |
code_selection | [
{
"content": "You are an expert code evaluation system.",
"role": "system"
},
{
"content": "=== PROGRAMMING PROBLEM ===\n\nTitle: apply-operations-to-make-string-empty\nPlatform: leetcode\nDifficulty: medium\n\nProblem Statement:\nYou are given a string s.\nConsider performing the following operatio... | code_verification | {
"ground_truth": "{\"labels\": [true, false], \"num_candidates\": 2}",
"style": "rule"
} | {
"domain_id": 4,
"domain_name": "leetcode_medium",
"judge_context": "{\"problem\": \"=== PROGRAMMING PROBLEM ===\\n\\nTitle: apply-operations-to-make-string-empty\\nPlatform: leetcode\\nDifficulty: medium\\n\\nProblem Statement:\\nYou are given a string s.\\nConsider performing the following operation until s be... |
code_selection | [
{
"content": "You are an expert code evaluation system.",
"role": "system"
},
{
"content": "=== PROGRAMMING PROBLEM ===\n\nTitle: sum-of-imbalance-numbers-of-all-subarrays\nPlatform: leetcode\nDifficulty: hard\n\nProblem Statement:\nThe imbalance number of a 0-indexed integer array arr of length n i... | code_verification | {
"ground_truth": "{\"labels\": [true, false], \"num_candidates\": 2}",
"style": "rule"
} | {
"domain_id": 5,
"domain_name": "leetcode_hard",
"judge_context": "{\"problem\": \"=== PROGRAMMING PROBLEM ===\\n\\nTitle: sum-of-imbalance-numbers-of-all-subarrays\\nPlatform: leetcode\\nDifficulty: hard\\n\\nProblem Statement:\\nThe imbalance number of a 0-indexed integer array arr of length n is defined as th... |
code_selection | [
{
"content": "You are an expert code evaluation system.",
"role": "system"
},
{
"content": "=== PROGRAMMING PROBLEM ===\n\nTitle: apply-operations-to-make-string-empty\nPlatform: leetcode\nDifficulty: medium\n\nProblem Statement:\nYou are given a string s.\nConsider performing the following operatio... | code_verification | {
"ground_truth": "{\"labels\": [true, false], \"num_candidates\": 2}",
"style": "rule"
} | {
"domain_id": 4,
"domain_name": "leetcode_medium",
"judge_context": "{\"problem\": \"=== PROGRAMMING PROBLEM ===\\n\\nTitle: apply-operations-to-make-string-empty\\nPlatform: leetcode\\nDifficulty: medium\\n\\nProblem Statement:\\nYou are given a string s.\\nConsider performing the following operation until s be... |
code_selection | [
{
"content": "You are an expert code evaluation system.",
"role": "system"
},
{
"content": "=== PROGRAMMING PROBLEM ===\n\nTitle: remove-adjacent-almost-equal-characters\nPlatform: leetcode\nDifficulty: medium\n\nProblem Statement:\nYou are given a 0-indexed string word.\nIn one operation, you can p... | code_verification | {
"ground_truth": "{\"labels\": [true, false], \"num_candidates\": 2}",
"style": "rule"
} | {
"domain_id": 4,
"domain_name": "leetcode_medium",
"judge_context": "{\"problem\": \"=== PROGRAMMING PROBLEM ===\\n\\nTitle: remove-adjacent-almost-equal-characters\\nPlatform: leetcode\\nDifficulty: medium\\n\\nProblem Statement:\\nYou are given a 0-indexed string word.\\nIn one operation, you can pick any inde... |
code_selection | [
{
"content": "You are an expert code evaluation system.",
"role": "system"
},
{
"content": "=== PROGRAMMING PROBLEM ===\n\nTitle: find-maximum-non-decreasing-array-length\nPlatform: leetcode\nDifficulty: hard\n\nProblem Statement:\nYou are given a 0-indexed integer array nums.\nYou can perform any n... | code_verification | {
"ground_truth": "{\"labels\": [false, true], \"num_candidates\": 2}",
"style": "rule"
} | {
"domain_id": 5,
"domain_name": "leetcode_hard",
"judge_context": "{\"problem\": \"=== PROGRAMMING PROBLEM ===\\n\\nTitle: find-maximum-non-decreasing-array-length\\nPlatform: leetcode\\nDifficulty: hard\\n\\nProblem Statement:\\nYou are given a 0-indexed integer array nums.\\nYou can perform any number of opera... |
code_selection | [
{
"content": "You are an expert code evaluation system.",
"role": "system"
},
{
"content": "=== PROGRAMMING PROBLEM ===\n\nTitle: LOWER\nPlatform: atcoder\nDifficulty: medium\n\nProblem Statement:\nYou are given a string S of length N consisting of uppercase and lowercase English letters.\nLet us pe... | code_verification | {
"ground_truth": "{\"labels\": [false, true], \"num_candidates\": 2}",
"style": "rule"
} | {
"domain_id": 1,
"domain_name": "atcoder_medium",
"judge_context": "{\"problem\": \"=== PROGRAMMING PROBLEM ===\\n\\nTitle: LOWER\\nPlatform: atcoder\\nDifficulty: medium\\n\\nProblem Statement:\\nYou are given a string S of length N consisting of uppercase and lowercase English letters.\\nLet us perform Q opera... |
code_selection | [
{
"content": "You are an expert code evaluation system.",
"role": "system"
},
{
"content": "=== PROGRAMMING PROBLEM ===\n\nTitle: Range Connect MST\nPlatform: atcoder\nDifficulty: hard\n\nProblem Statement:\nThere is a graph with N + Q vertices, numbered 1, 2, \\ldots, N + Q. Initially, the graph ha... | code_verification | {
"ground_truth": "{\"labels\": [true, false], \"num_candidates\": 2}",
"style": "rule"
} | {
"domain_id": 2,
"domain_name": "atcoder_hard",
"judge_context": "{\"problem\": \"=== PROGRAMMING PROBLEM ===\\n\\nTitle: Range Connect MST\\nPlatform: atcoder\\nDifficulty: hard\\n\\nProblem Statement:\\nThere is a graph with N + Q vertices, numbered 1, 2, \\\\ldots, N + Q. Initially, the graph has no edges.\\n... |
code_selection | [
{
"content": "You are an expert code evaluation system.",
"role": "system"
},
{
"content": "=== PROGRAMMING PROBLEM ===\n\nTitle: Isolation\nPlatform: atcoder\nDifficulty: hard\n\nProblem Statement:\nThere is an undirected graph with N vertices numbered 1 through N, and initially with 0 edges.\r\nGi... | code_verification | {
"ground_truth": "{\"labels\": [false, true], \"num_candidates\": 2}",
"style": "rule"
} | {
"domain_id": 2,
"domain_name": "atcoder_hard",
"judge_context": "{\"problem\": \"=== PROGRAMMING PROBLEM ===\\n\\nTitle: Isolation\\nPlatform: atcoder\\nDifficulty: hard\\n\\nProblem Statement:\\nThere is an undirected graph with N vertices numbered 1 through N, and initially with 0 edges.\\r\\nGiven Q queries,... |
code_selection | [
{
"content": "You are an expert code evaluation system.",
"role": "system"
},
{
"content": "=== PROGRAMMING PROBLEM ===\n\nTitle: Max/Min\nPlatform: atcoder\nDifficulty: hard\n\nProblem Statement:\nYou are given a sequence A=(A_1,\\ldots,A_N) of length N.\nFind \\displaystyle \\sum_{i=1}^{N-1}\\sum_... | code_verification | {
"ground_truth": "{\"labels\": [true, false], \"num_candidates\": 2}",
"style": "rule"
} | {
"domain_id": 2,
"domain_name": "atcoder_hard",
"judge_context": "{\"problem\": \"=== PROGRAMMING PROBLEM ===\\n\\nTitle: Max/Min\\nPlatform: atcoder\\nDifficulty: hard\\n\\nProblem Statement:\\nYou are given a sequence A=(A_1,\\\\ldots,A_N) of length N.\\nFind \\\\displaystyle \\\\sum_{i=1}^{N-1}\\\\sum_{j=i+1}... |
code_selection | [
{
"content": "You are an expert code evaluation system.",
"role": "system"
},
{
"content": "=== PROGRAMMING PROBLEM ===\n\nTitle: Sinking Land\nPlatform: atcoder\nDifficulty: hard\n\nProblem Statement:\nThere is an island of size H \\times W, surrounded by the sea.\r\nThe island is divided into H ro... | code_verification | {
"ground_truth": "{\"labels\": [true, false], \"num_candidates\": 2}",
"style": "rule"
} | {
"domain_id": 2,
"domain_name": "atcoder_hard",
"judge_context": "{\"problem\": \"=== PROGRAMMING PROBLEM ===\\n\\nTitle: Sinking Land\\nPlatform: atcoder\\nDifficulty: hard\\n\\nProblem Statement:\\nThere is an island of size H \\\\times W, surrounded by the sea.\\r\\nThe island is divided into H rows and W col... |
code_selection | [
{
"content": "You are an expert code evaluation system.",
"role": "system"
},
{
"content": "=== PROGRAMMING PROBLEM ===\n\nTitle: Joint Two Strings\nPlatform: atcoder\nDifficulty: hard\n\nProblem Statement:\nYou are given N strings S_1, S_2, \\ldots, S_N consisting of lowercase English letters, and ... | code_verification | {
"ground_truth": "{\"labels\": [true, false], \"num_candidates\": 2}",
"style": "rule"
} | {
"domain_id": 2,
"domain_name": "atcoder_hard",
"judge_context": "{\"problem\": \"=== PROGRAMMING PROBLEM ===\\n\\nTitle: Joint Two Strings\\nPlatform: atcoder\\nDifficulty: hard\\n\\nProblem Statement:\\nYou are given N strings S_1, S_2, \\\\ldots, S_N consisting of lowercase English letters, and a string T con... |
code_selection | [
{
"content": "You are an expert code evaluation system.",
"role": "system"
},
{
"content": "=== PROGRAMMING PROBLEM ===\n\nTitle: sum-of-imbalance-numbers-of-all-subarrays\nPlatform: leetcode\nDifficulty: hard\n\nProblem Statement:\nThe imbalance number of a 0-indexed integer array arr of length n i... | code_verification | {
"ground_truth": "{\"labels\": [true, false], \"num_candidates\": 2}",
"style": "rule"
} | {
"domain_id": 5,
"domain_name": "leetcode_hard",
"judge_context": "{\"problem\": \"=== PROGRAMMING PROBLEM ===\\n\\nTitle: sum-of-imbalance-numbers-of-all-subarrays\\nPlatform: leetcode\\nDifficulty: hard\\n\\nProblem Statement:\\nThe imbalance number of a 0-indexed integer array arr of length n is defined as th... |
code_selection | [
{
"content": "You are an expert code evaluation system.",
"role": "system"
},
{
"content": "=== PROGRAMMING PROBLEM ===\n\nTitle: B. Chemistry\nPlatform: codeforces\nDifficulty: medium\n\nProblem Statement:\nYou are given a string $s$ of length $n$, consisting of lowercase Latin letters, and an inte... | code_verification | {
"ground_truth": "{\"labels\": [false, true], \"num_candidates\": 2}",
"style": "rule"
} | {
"domain_id": 0,
"domain_name": "unknown",
"judge_context": "{\"problem\": \"=== PROGRAMMING PROBLEM ===\\n\\nTitle: B. Chemistry\\nPlatform: codeforces\\nDifficulty: medium\\n\\nProblem Statement:\\nYou are given a string $s$ of length $n$, consisting of lowercase Latin letters, and an integer $k$.\\n\\nYou nee... |
code_selection | [
{
"content": "You are an expert code evaluation system.",
"role": "system"
},
{
"content": "=== PROGRAMMING PROBLEM ===\n\nTitle: Mex and Update\nPlatform: atcoder\nDifficulty: hard\n\nProblem Statement:\nYou are given a sequence A=(A_1,A_2,\\dots,A_N) of length N.\r\nRespond to the following Q quer... | code_verification | {
"ground_truth": "{\"labels\": [true, false], \"num_candidates\": 2}",
"style": "rule"
} | {
"domain_id": 2,
"domain_name": "atcoder_hard",
"judge_context": "{\"problem\": \"=== PROGRAMMING PROBLEM ===\\n\\nTitle: Mex and Update\\nPlatform: atcoder\\nDifficulty: hard\\n\\nProblem Statement:\\nYou are given a sequence A=(A_1,A_2,\\\\dots,A_N) of length N.\\r\\nRespond to the following Q queries in the o... |
code_selection | [
{
"content": "You are an expert code evaluation system.",
"role": "system"
},
{
"content": "=== PROGRAMMING PROBLEM ===\n\nTitle: Pentagon\nPlatform: atcoder\nDifficulty: easy\n\nProblem Statement:\nA regular pentagon P is shown in the figure below.\n\nDetermine whether the length of the line segmen... | code_verification | {
"ground_truth": "{\"labels\": [true, false], \"num_candidates\": 2}",
"style": "rule"
} | {
"domain_id": 0,
"domain_name": "atcoder_easy",
"judge_context": "{\"problem\": \"=== PROGRAMMING PROBLEM ===\\n\\nTitle: Pentagon\\nPlatform: atcoder\\nDifficulty: easy\\n\\nProblem Statement:\\nA regular pentagon P is shown in the figure below.\\n\\nDetermine whether the length of the line segment connecting p... |
code_selection | [
{
"content": "You are an expert code evaluation system.",
"role": "system"
},
{
"content": "=== PROGRAMMING PROBLEM ===\n\nTitle: Mex and Update\nPlatform: atcoder\nDifficulty: hard\n\nProblem Statement:\nYou are given a sequence A=(A_1,A_2,\\dots,A_N) of length N.\r\nRespond to the following Q quer... | code_verification | {
"ground_truth": "{\"labels\": [false, true], \"num_candidates\": 2}",
"style": "rule"
} | {
"domain_id": 2,
"domain_name": "atcoder_hard",
"judge_context": "{\"problem\": \"=== PROGRAMMING PROBLEM ===\\n\\nTitle: Mex and Update\\nPlatform: atcoder\\nDifficulty: hard\\n\\nProblem Statement:\\nYou are given a sequence A=(A_1,A_2,\\\\dots,A_N) of length N.\\r\\nRespond to the following Q queries in the o... |
code_selection | [
{
"content": "You are an expert code evaluation system.",
"role": "system"
},
{
"content": "=== PROGRAMMING PROBLEM ===\n\nTitle: Pentagon\nPlatform: atcoder\nDifficulty: easy\n\nProblem Statement:\nA regular pentagon P is shown in the figure below.\n\nDetermine whether the length of the line segmen... | code_verification | {
"ground_truth": "{\"labels\": [false, true], \"num_candidates\": 2}",
"style": "rule"
} | {
"domain_id": 0,
"domain_name": "atcoder_easy",
"judge_context": "{\"problem\": \"=== PROGRAMMING PROBLEM ===\\n\\nTitle: Pentagon\\nPlatform: atcoder\\nDifficulty: easy\\n\\nProblem Statement:\\nA regular pentagon P is shown in the figure below.\\n\\nDetermine whether the length of the line segment connecting p... |
code_selection | [
{
"content": "You are an expert code evaluation system.",
"role": "system"
},
{
"content": "=== PROGRAMMING PROBLEM ===\n\nTitle: Merge Set\nPlatform: atcoder\nDifficulty: hard\n\nProblem Statement:\nOn a blackboard, there are N sets S_1,S_2,\\dots,S_N consisting of integers between 1 and M. Here, S... | code_verification | {
"ground_truth": "{\"labels\": [false, true], \"num_candidates\": 2}",
"style": "rule"
} | {
"domain_id": 2,
"domain_name": "atcoder_hard",
"judge_context": "{\"problem\": \"=== PROGRAMMING PROBLEM ===\\n\\nTitle: Merge Set\\nPlatform: atcoder\\nDifficulty: hard\\n\\nProblem Statement:\\nOn a blackboard, there are N sets S_1,S_2,\\\\dots,S_N consisting of integers between 1 and M. Here, S_i = \\\\lbrac... |
code_selection | [
{
"content": "You are an expert code evaluation system.",
"role": "system"
},
{
"content": "=== PROGRAMMING PROBLEM ===\n\nTitle: Avoid K Palindrome 2\nPlatform: atcoder\nDifficulty: medium\n\nProblem Statement:\nYou are given a string S of length N consisting only of lowercase English letters.\nFin... | code_verification | {
"ground_truth": "{\"labels\": [true, false], \"num_candidates\": 2}",
"style": "rule"
} | {
"domain_id": 1,
"domain_name": "atcoder_medium",
"judge_context": "{\"problem\": \"=== PROGRAMMING PROBLEM ===\\n\\nTitle: Avoid K Palindrome 2\\nPlatform: atcoder\\nDifficulty: medium\\n\\nProblem Statement:\\nYou are given a string S of length N consisting only of lowercase English letters.\\nFind the number ... |
code_selection | [
{
"content": "You are an expert code evaluation system.",
"role": "system"
},
{
"content": "=== PROGRAMMING PROBLEM ===\n\nTitle: Sinking Land\nPlatform: atcoder\nDifficulty: hard\n\nProblem Statement:\nThere is an island of size H \\times W, surrounded by the sea.\r\nThe island is divided into H ro... | code_verification | {
"ground_truth": "{\"labels\": [false, true], \"num_candidates\": 2}",
"style": "rule"
} | {
"domain_id": 2,
"domain_name": "atcoder_hard",
"judge_context": "{\"problem\": \"=== PROGRAMMING PROBLEM ===\\n\\nTitle: Sinking Land\\nPlatform: atcoder\\nDifficulty: hard\\n\\nProblem Statement:\\nThere is an island of size H \\\\times W, surrounded by the sea.\\r\\nThe island is divided into H rows and W col... |
code_selection | [
{
"content": "You are an expert code evaluation system.",
"role": "system"
},
{
"content": "=== PROGRAMMING PROBLEM ===\n\nTitle: find-maximum-non-decreasing-array-length\nPlatform: leetcode\nDifficulty: hard\n\nProblem Statement:\nYou are given a 0-indexed integer array nums.\nYou can perform any n... | code_verification | {
"ground_truth": "{\"labels\": [true, false], \"num_candidates\": 2}",
"style": "rule"
} | {
"domain_id": 5,
"domain_name": "leetcode_hard",
"judge_context": "{\"problem\": \"=== PROGRAMMING PROBLEM ===\\n\\nTitle: find-maximum-non-decreasing-array-length\\nPlatform: leetcode\\nDifficulty: hard\\n\\nProblem Statement:\\nYou are given a 0-indexed integer array nums.\\nYou can perform any number of opera... |
code_selection | [
{
"content": "You are an expert code evaluation system.",
"role": "system"
},
{
"content": "=== PROGRAMMING PROBLEM ===\n\nTitle: find-maximum-non-decreasing-array-length\nPlatform: leetcode\nDifficulty: hard\n\nProblem Statement:\nYou are given a 0-indexed integer array nums.\nYou can perform any n... | code_verification | {
"ground_truth": "{\"labels\": [true, false], \"num_candidates\": 2}",
"style": "rule"
} | {
"domain_id": 5,
"domain_name": "leetcode_hard",
"judge_context": "{\"problem\": \"=== PROGRAMMING PROBLEM ===\\n\\nTitle: find-maximum-non-decreasing-array-length\\nPlatform: leetcode\\nDifficulty: hard\\n\\nProblem Statement:\\nYou are given a 0-indexed integer array nums.\\nYou can perform any number of opera... |
code_selection | [
{
"content": "You are an expert code evaluation system.",
"role": "system"
},
{
"content": "=== PROGRAMMING PROBLEM ===\n\nTitle: generate-binary-strings-without-adjacent-zeros\nPlatform: leetcode\nDifficulty: medium\n\nProblem Statement:\nYou are given a positive integer n.\nA binary string x is va... | code_verification | {
"ground_truth": "{\"labels\": [true, false], \"num_candidates\": 2}",
"style": "rule"
} | {
"domain_id": 4,
"domain_name": "leetcode_medium",
"judge_context": "{\"problem\": \"=== PROGRAMMING PROBLEM ===\\n\\nTitle: generate-binary-strings-without-adjacent-zeros\\nPlatform: leetcode\\nDifficulty: medium\\n\\nProblem Statement:\\nYou are given a positive integer n.\\nA binary string x is valid if all s... |
code_selection | [
{
"content": "You are an expert code evaluation system.",
"role": "system"
},
{
"content": "=== PROGRAMMING PROBLEM ===\n\nTitle: longest-common-suffix-queries\nPlatform: leetcode\nDifficulty: hard\n\nProblem Statement:\nYou are given two arrays of strings wordsContainer and wordsQuery.\nFor each wo... | code_verification | {
"ground_truth": "{\"labels\": [false, true], \"num_candidates\": 2}",
"style": "rule"
} | {
"domain_id": 5,
"domain_name": "leetcode_hard",
"judge_context": "{\"problem\": \"=== PROGRAMMING PROBLEM ===\\n\\nTitle: longest-common-suffix-queries\\nPlatform: leetcode\\nDifficulty: hard\\n\\nProblem Statement:\\nYou are given two arrays of strings wordsContainer and wordsQuery.\\nFor each wordsQuery[i], y... |
code_selection | [
{
"content": "You are an expert code evaluation system.",
"role": "system"
},
{
"content": "=== PROGRAMMING PROBLEM ===\n\nTitle: Printing Machine\nPlatform: atcoder\nDifficulty: hard\n\nProblem Statement:\nThere are N products labeled 1 to N flowing on a conveyor belt.\r\nA Keyence printer is attac... | code_verification | {
"ground_truth": "{\"labels\": [true, false], \"num_candidates\": 2}",
"style": "rule"
} | {
"domain_id": 2,
"domain_name": "atcoder_hard",
"judge_context": "{\"problem\": \"=== PROGRAMMING PROBLEM ===\\n\\nTitle: Printing Machine\\nPlatform: atcoder\\nDifficulty: hard\\n\\nProblem Statement:\\nThere are N products labeled 1 to N flowing on a conveyor belt.\\r\\nA Keyence printer is attached to the con... |
code_selection | [
{
"content": "You are an expert code evaluation system.",
"role": "system"
},
{
"content": "=== PROGRAMMING PROBLEM ===\n\nTitle: shortest-string-that-contains-three-strings\nPlatform: leetcode\nDifficulty: medium\n\nProblem Statement:\nGiven three strings a, b, and c, your task is to find a string ... | code_verification | {
"ground_truth": "{\"labels\": [true, false], \"num_candidates\": 2}",
"style": "rule"
} | {
"domain_id": 4,
"domain_name": "leetcode_medium",
"judge_context": "{\"problem\": \"=== PROGRAMMING PROBLEM ===\\n\\nTitle: shortest-string-that-contains-three-strings\\nPlatform: leetcode\\nDifficulty: medium\\n\\nProblem Statement:\\nGiven three strings a, b, and c, your task is to find a string that has the ... |
code_selection | [
{
"content": "You are an expert code evaluation system.",
"role": "system"
},
{
"content": "=== PROGRAMMING PROBLEM ===\n\nTitle: minimum-time-to-make-array-sum-at-most-x\nPlatform: leetcode\nDifficulty: hard\n\nProblem Statement:\nYou are given two 0-indexed integer arrays nums1 and nums2 of equal ... | code_verification | {
"ground_truth": "{\"labels\": [true, false], \"num_candidates\": 2}",
"style": "rule"
} | {
"domain_id": 5,
"domain_name": "leetcode_hard",
"judge_context": "{\"problem\": \"=== PROGRAMMING PROBLEM ===\\n\\nTitle: minimum-time-to-make-array-sum-at-most-x\\nPlatform: leetcode\\nDifficulty: hard\\n\\nProblem Statement:\\nYou are given two 0-indexed integer arrays nums1 and nums2 of equal length. Every s... |
code_selection | [
{
"content": "You are an expert code evaluation system.",
"role": "system"
},
{
"content": "=== PROGRAMMING PROBLEM ===\n\nTitle: Printing Machine\nPlatform: atcoder\nDifficulty: hard\n\nProblem Statement:\nThere are N products labeled 1 to N flowing on a conveyor belt.\r\nA Keyence printer is attac... | code_verification | {
"ground_truth": "{\"labels\": [false, true], \"num_candidates\": 2}",
"style": "rule"
} | {
"domain_id": 2,
"domain_name": "atcoder_hard",
"judge_context": "{\"problem\": \"=== PROGRAMMING PROBLEM ===\\n\\nTitle: Printing Machine\\nPlatform: atcoder\\nDifficulty: hard\\n\\nProblem Statement:\\nThere are N products labeled 1 to N flowing on a conveyor belt.\\r\\nA Keyence printer is attached to the con... |
code_selection | [
{
"content": "You are an expert code evaluation system.",
"role": "system"
},
{
"content": "=== PROGRAMMING PROBLEM ===\n\nTitle: Avoid K Palindrome 2\nPlatform: atcoder\nDifficulty: medium\n\nProblem Statement:\nYou are given a string S of length N consisting only of lowercase English letters.\nFin... | code_verification | {
"ground_truth": "{\"labels\": [true, false], \"num_candidates\": 2}",
"style": "rule"
} | {
"domain_id": 1,
"domain_name": "atcoder_medium",
"judge_context": "{\"problem\": \"=== PROGRAMMING PROBLEM ===\\n\\nTitle: Avoid K Palindrome 2\\nPlatform: atcoder\\nDifficulty: medium\\n\\nProblem Statement:\\nYou are given a string S of length N consisting only of lowercase English letters.\\nFind the number ... |
code_selection | [
{
"content": "You are an expert code evaluation system.",
"role": "system"
},
{
"content": "=== PROGRAMMING PROBLEM ===\n\nTitle: remove-adjacent-almost-equal-characters\nPlatform: leetcode\nDifficulty: medium\n\nProblem Statement:\nYou are given a 0-indexed string word.\nIn one operation, you can p... | code_verification | {
"ground_truth": "{\"labels\": [false, true], \"num_candidates\": 2}",
"style": "rule"
} | {
"domain_id": 4,
"domain_name": "leetcode_medium",
"judge_context": "{\"problem\": \"=== PROGRAMMING PROBLEM ===\\n\\nTitle: remove-adjacent-almost-equal-characters\\nPlatform: leetcode\\nDifficulty: medium\\n\\nProblem Statement:\\nYou are given a 0-indexed string word.\\nIn one operation, you can pick any inde... |
code_selection | [
{
"content": "You are an expert code evaluation system.",
"role": "system"
},
{
"content": "=== PROGRAMMING PROBLEM ===\n\nTitle: minimum-operations-to-make-the-integer-zero\nPlatform: leetcode\nDifficulty: medium\n\nProblem Statement:\nYou are given two integers num1 and num2.\nIn one operation, yo... | code_verification | {
"ground_truth": "{\"labels\": [true, false], \"num_candidates\": 2}",
"style": "rule"
} | {
"domain_id": 4,
"domain_name": "leetcode_medium",
"judge_context": "{\"problem\": \"=== PROGRAMMING PROBLEM ===\\n\\nTitle: minimum-operations-to-make-the-integer-zero\\nPlatform: leetcode\\nDifficulty: medium\\n\\nProblem Statement:\\nYou are given two integers num1 and num2.\\nIn one operation, you can choose... |
code_selection | [
{
"content": "You are an expert code evaluation system.",
"role": "system"
},
{
"content": "=== PROGRAMMING PROBLEM ===\n\nTitle: count-of-sub-multisets-with-bounded-sum\nPlatform: leetcode\nDifficulty: hard\n\nProblem Statement:\nYou are given a 0-indexed array nums of non-negative integers, and tw... | code_verification | {
"ground_truth": "{\"labels\": [true, false], \"num_candidates\": 2}",
"style": "rule"
} | {
"domain_id": 5,
"domain_name": "leetcode_hard",
"judge_context": "{\"problem\": \"=== PROGRAMMING PROBLEM ===\\n\\nTitle: count-of-sub-multisets-with-bounded-sum\\nPlatform: leetcode\\nDifficulty: hard\\n\\nProblem Statement:\\nYou are given a 0-indexed array nums of non-negative integers, and two integers l an... |
code_selection | [
{
"content": "You are an expert code evaluation system.",
"role": "system"
},
{
"content": "=== PROGRAMMING PROBLEM ===\n\nTitle: Range Connect MST\nPlatform: atcoder\nDifficulty: hard\n\nProblem Statement:\nThere is a graph with N + Q vertices, numbered 1, 2, \\ldots, N + Q. Initially, the graph ha... | code_verification | {
"ground_truth": "{\"labels\": [false, true], \"num_candidates\": 2}",
"style": "rule"
} | {
"domain_id": 2,
"domain_name": "atcoder_hard",
"judge_context": "{\"problem\": \"=== PROGRAMMING PROBLEM ===\\n\\nTitle: Range Connect MST\\nPlatform: atcoder\\nDifficulty: hard\\n\\nProblem Statement:\\nThere is a graph with N + Q vertices, numbered 1, 2, \\\\ldots, N + Q. Initially, the graph has no edges.\\n... |
code_selection | [
{
"content": "You are an expert code evaluation system.",
"role": "system"
},
{
"content": "=== PROGRAMMING PROBLEM ===\n\nTitle: minimum-time-to-make-array-sum-at-most-x\nPlatform: leetcode\nDifficulty: hard\n\nProblem Statement:\nYou are given two 0-indexed integer arrays nums1 and nums2 of equal ... | code_verification | {
"ground_truth": "{\"labels\": [false, true], \"num_candidates\": 2}",
"style": "rule"
} | {
"domain_id": 5,
"domain_name": "leetcode_hard",
"judge_context": "{\"problem\": \"=== PROGRAMMING PROBLEM ===\\n\\nTitle: minimum-time-to-make-array-sum-at-most-x\\nPlatform: leetcode\\nDifficulty: hard\\n\\nProblem Statement:\\nYou are given two 0-indexed integer arrays nums1 and nums2 of equal length. Every s... |
code_selection | [
{
"content": "You are an expert code evaluation system.",
"role": "system"
},
{
"content": "=== PROGRAMMING PROBLEM ===\n\nTitle: shortest-string-that-contains-three-strings\nPlatform: leetcode\nDifficulty: medium\n\nProblem Statement:\nGiven three strings a, b, and c, your task is to find a string ... | code_verification | {
"ground_truth": "{\"labels\": [true, false], \"num_candidates\": 2}",
"style": "rule"
} | {
"domain_id": 4,
"domain_name": "leetcode_medium",
"judge_context": "{\"problem\": \"=== PROGRAMMING PROBLEM ===\\n\\nTitle: shortest-string-that-contains-three-strings\\nPlatform: leetcode\\nDifficulty: medium\\n\\nProblem Statement:\\nGiven three strings a, b, and c, your task is to find a string that has the ... |
code_selection | [
{
"content": "You are an expert code evaluation system.",
"role": "system"
},
{
"content": "=== PROGRAMMING PROBLEM ===\n\nTitle: Merge Set\nPlatform: atcoder\nDifficulty: hard\n\nProblem Statement:\nOn a blackboard, there are N sets S_1,S_2,\\dots,S_N consisting of integers between 1 and M. Here, S... | code_verification | {
"ground_truth": "{\"labels\": [true, false], \"num_candidates\": 2}",
"style": "rule"
} | {
"domain_id": 2,
"domain_name": "atcoder_hard",
"judge_context": "{\"problem\": \"=== PROGRAMMING PROBLEM ===\\n\\nTitle: Merge Set\\nPlatform: atcoder\\nDifficulty: hard\\n\\nProblem Statement:\\nOn a blackboard, there are N sets S_1,S_2,\\\\dots,S_N consisting of integers between 1 and M. Here, S_i = \\\\lbrac... |
code_selection | [
{
"content": "You are an expert code evaluation system.",
"role": "system"
},
{
"content": "=== PROGRAMMING PROBLEM ===\n\nTitle: Max/Min\nPlatform: atcoder\nDifficulty: hard\n\nProblem Statement:\nYou are given a sequence A=(A_1,\\ldots,A_N) of length N.\nFind \\displaystyle \\sum_{i=1}^{N-1}\\sum_... | code_verification | {
"ground_truth": "{\"labels\": [false, true], \"num_candidates\": 2}",
"style": "rule"
} | {
"domain_id": 2,
"domain_name": "atcoder_hard",
"judge_context": "{\"problem\": \"=== PROGRAMMING PROBLEM ===\\n\\nTitle: Max/Min\\nPlatform: atcoder\\nDifficulty: hard\\n\\nProblem Statement:\\nYou are given a sequence A=(A_1,\\\\ldots,A_N) of length N.\\nFind \\\\displaystyle \\\\sum_{i=1}^{N-1}\\\\sum_{j=i+1}... |
code_selection | [
{
"content": "You are an expert code evaluation system.",
"role": "system"
},
{
"content": "=== PROGRAMMING PROBLEM ===\n\nTitle: apply-operations-to-make-string-empty\nPlatform: leetcode\nDifficulty: medium\n\nProblem Statement:\nYou are given a string s.\nConsider performing the following operatio... | code_verification | {
"ground_truth": "{\"labels\": [true, false], \"num_candidates\": 2}",
"style": "rule"
} | {
"domain_id": 4,
"domain_name": "leetcode_medium",
"judge_context": "{\"problem\": \"=== PROGRAMMING PROBLEM ===\\n\\nTitle: apply-operations-to-make-string-empty\\nPlatform: leetcode\\nDifficulty: medium\\n\\nProblem Statement:\\nYou are given a string s.\\nConsider performing the following operation until s be... |
code_selection | [
{
"content": "You are an expert code evaluation system.",
"role": "system"
},
{
"content": "=== PROGRAMMING PROBLEM ===\n\nTitle: maximum-total-reward-using-operations-i\nPlatform: leetcode\nDifficulty: medium\n\nProblem Statement:\nYou are given an integer array rewardValues of length n, representi... | code_verification | {
"ground_truth": "{\"labels\": [true, false], \"num_candidates\": 2}",
"style": "rule"
} | {
"domain_id": 4,
"domain_name": "leetcode_medium",
"judge_context": "{\"problem\": \"=== PROGRAMMING PROBLEM ===\\n\\nTitle: maximum-total-reward-using-operations-i\\nPlatform: leetcode\\nDifficulty: medium\\n\\nProblem Statement:\\nYou are given an integer array rewardValues of length n, representing the values... |
code_selection | [
{
"content": "You are an expert code evaluation system.",
"role": "system"
},
{
"content": "=== PROGRAMMING PROBLEM ===\n\nTitle: most-frequent-ids\nPlatform: leetcode\nDifficulty: medium\n\nProblem Statement:\nThe problem involves tracking the frequency of IDs in a collection that changes over time... | code_verification | {
"ground_truth": "{\"labels\": [true, false], \"num_candidates\": 2}",
"style": "rule"
} | {
"domain_id": 4,
"domain_name": "leetcode_medium",
"judge_context": "{\"problem\": \"=== PROGRAMMING PROBLEM ===\\n\\nTitle: most-frequent-ids\\nPlatform: leetcode\\nDifficulty: medium\\n\\nProblem Statement:\\nThe problem involves tracking the frequency of IDs in a collection that changes over time. You have tw... |
code_selection | [
{
"content": "You are an expert code evaluation system.",
"role": "system"
},
{
"content": "=== PROGRAMMING PROBLEM ===\n\nTitle: Merge Set\nPlatform: atcoder\nDifficulty: hard\n\nProblem Statement:\nOn a blackboard, there are N sets S_1,S_2,\\dots,S_N consisting of integers between 1 and M. Here, S... | code_verification | {
"ground_truth": "{\"labels\": [true, false], \"num_candidates\": 2}",
"style": "rule"
} | {
"domain_id": 2,
"domain_name": "atcoder_hard",
"judge_context": "{\"problem\": \"=== PROGRAMMING PROBLEM ===\\n\\nTitle: Merge Set\\nPlatform: atcoder\\nDifficulty: hard\\n\\nProblem Statement:\\nOn a blackboard, there are N sets S_1,S_2,\\\\dots,S_N consisting of integers between 1 and M. Here, S_i = \\\\lbrac... |
code_selection | [
{
"content": "You are an expert code evaluation system.",
"role": "system"
},
{
"content": "=== PROGRAMMING PROBLEM ===\n\nTitle: Avoid K Palindrome 2\nPlatform: atcoder\nDifficulty: medium\n\nProblem Statement:\nYou are given a string S of length N consisting only of lowercase English letters.\nFin... | code_verification | {
"ground_truth": "{\"labels\": [false, true], \"num_candidates\": 2}",
"style": "rule"
} | {
"domain_id": 1,
"domain_name": "atcoder_medium",
"judge_context": "{\"problem\": \"=== PROGRAMMING PROBLEM ===\\n\\nTitle: Avoid K Palindrome 2\\nPlatform: atcoder\\nDifficulty: medium\\n\\nProblem Statement:\\nYou are given a string S of length N consisting only of lowercase English letters.\\nFind the number ... |
code_selection | [
{
"content": "You are an expert code evaluation system.",
"role": "system"
},
{
"content": "=== PROGRAMMING PROBLEM ===\n\nTitle: Takahashi Gets Lost\nPlatform: atcoder\nDifficulty: medium\n\nProblem Statement:\nThere is a grid with H rows and W columns.\nEach cell of the grid is land or sea, which ... | code_verification | {
"ground_truth": "{\"labels\": [true, false], \"num_candidates\": 2}",
"style": "rule"
} | {
"domain_id": 1,
"domain_name": "atcoder_medium",
"judge_context": "{\"problem\": \"=== PROGRAMMING PROBLEM ===\\n\\nTitle: Takahashi Gets Lost\\nPlatform: atcoder\\nDifficulty: medium\\n\\nProblem Statement:\\nThere is a grid with H rows and W columns.\\nEach cell of the grid is land or sea, which is represente... |
code_selection | [
{
"content": "You are an expert code evaluation system.",
"role": "system"
},
{
"content": "=== PROGRAMMING PROBLEM ===\n\nTitle: Max/Min\nPlatform: atcoder\nDifficulty: hard\n\nProblem Statement:\nYou are given a sequence A=(A_1,\\ldots,A_N) of length N.\nFind \\displaystyle \\sum_{i=1}^{N-1}\\sum_... | code_verification | {
"ground_truth": "{\"labels\": [false, true], \"num_candidates\": 2}",
"style": "rule"
} | {
"domain_id": 2,
"domain_name": "atcoder_hard",
"judge_context": "{\"problem\": \"=== PROGRAMMING PROBLEM ===\\n\\nTitle: Max/Min\\nPlatform: atcoder\\nDifficulty: hard\\n\\nProblem Statement:\\nYou are given a sequence A=(A_1,\\\\ldots,A_N) of length N.\\nFind \\\\displaystyle \\\\sum_{i=1}^{N-1}\\\\sum_{j=i+1}... |
code_selection | [
{
"content": "You are an expert code evaluation system.",
"role": "system"
},
{
"content": "=== PROGRAMMING PROBLEM ===\n\nTitle: Sinking Land\nPlatform: atcoder\nDifficulty: hard\n\nProblem Statement:\nThere is an island of size H \\times W, surrounded by the sea.\r\nThe island is divided into H ro... | code_verification | {
"ground_truth": "{\"labels\": [false, true], \"num_candidates\": 2}",
"style": "rule"
} | {
"domain_id": 2,
"domain_name": "atcoder_hard",
"judge_context": "{\"problem\": \"=== PROGRAMMING PROBLEM ===\\n\\nTitle: Sinking Land\\nPlatform: atcoder\\nDifficulty: hard\\n\\nProblem Statement:\\nThere is an island of size H \\\\times W, surrounded by the sea.\\r\\nThe island is divided into H rows and W col... |
code_selection | [
{
"content": "You are an expert code evaluation system.",
"role": "system"
},
{
"content": "=== PROGRAMMING PROBLEM ===\n\nTitle: Isolation\nPlatform: atcoder\nDifficulty: hard\n\nProblem Statement:\nThere is an undirected graph with N vertices numbered 1 through N, and initially with 0 edges.\r\nGi... | code_verification | {
"ground_truth": "{\"labels\": [false, true], \"num_candidates\": 2}",
"style": "rule"
} | {
"domain_id": 2,
"domain_name": "atcoder_hard",
"judge_context": "{\"problem\": \"=== PROGRAMMING PROBLEM ===\\n\\nTitle: Isolation\\nPlatform: atcoder\\nDifficulty: hard\\n\\nProblem Statement:\\nThere is an undirected graph with N vertices numbered 1 through N, and initially with 0 edges.\\r\\nGiven Q queries,... |
code_selection | [
{
"content": "You are an expert code evaluation system.",
"role": "system"
},
{
"content": "=== PROGRAMMING PROBLEM ===\n\nTitle: construct-string-with-minimum-cost\nPlatform: leetcode\nDifficulty: hard\n\nProblem Statement:\nYou are given a string target, an array of strings words, and an integer a... | code_verification | {
"ground_truth": "{\"labels\": [true, false], \"num_candidates\": 2}",
"style": "rule"
} | {
"domain_id": 5,
"domain_name": "leetcode_hard",
"judge_context": "{\"problem\": \"=== PROGRAMMING PROBLEM ===\\n\\nTitle: construct-string-with-minimum-cost\\nPlatform: leetcode\\nDifficulty: hard\\n\\nProblem Statement:\\nYou are given a string target, an array of strings words, and an integer array costs, bot... |
code_selection | [
{
"content": "You are an expert code evaluation system.",
"role": "system"
},
{
"content": "=== PROGRAMMING PROBLEM ===\n\nTitle: count-of-sub-multisets-with-bounded-sum\nPlatform: leetcode\nDifficulty: hard\n\nProblem Statement:\nYou are given a 0-indexed array nums of non-negative integers, and tw... | code_verification | {
"ground_truth": "{\"labels\": [true, false], \"num_candidates\": 2}",
"style": "rule"
} | {
"domain_id": 5,
"domain_name": "leetcode_hard",
"judge_context": "{\"problem\": \"=== PROGRAMMING PROBLEM ===\\n\\nTitle: count-of-sub-multisets-with-bounded-sum\\nPlatform: leetcode\\nDifficulty: hard\\n\\nProblem Statement:\\nYou are given a 0-indexed array nums of non-negative integers, and two integers l an... |
code_selection | [
{
"content": "You are an expert code evaluation system.",
"role": "system"
},
{
"content": "=== PROGRAMMING PROBLEM ===\n\nTitle: Delimiter\nPlatform: atcoder\nDifficulty: easy\n\nProblem Statement:\nYou are given N integers A_1,A_2,\\dots,A_N, one per line, over N lines. However, N is not given in ... | code_verification | {
"ground_truth": "{\"labels\": [true, false], \"num_candidates\": 2}",
"style": "rule"
} | {
"domain_id": 0,
"domain_name": "atcoder_easy",
"judge_context": "{\"problem\": \"=== PROGRAMMING PROBLEM ===\\n\\nTitle: Delimiter\\nPlatform: atcoder\\nDifficulty: easy\\n\\nProblem Statement:\\nYou are given N integers A_1,A_2,\\\\dots,A_N, one per line, over N lines. However, N is not given in the input.\\r\... |
code_selection | [
{
"content": "You are an expert code evaluation system.",
"role": "system"
},
{
"content": "=== PROGRAMMING PROBLEM ===\n\nTitle: Range Connect MST\nPlatform: atcoder\nDifficulty: hard\n\nProblem Statement:\nThere is a graph with N + Q vertices, numbered 1, 2, \\ldots, N + Q. Initially, the graph ha... | code_verification | {
"ground_truth": "{\"labels\": [true, false], \"num_candidates\": 2}",
"style": "rule"
} | {
"domain_id": 2,
"domain_name": "atcoder_hard",
"judge_context": "{\"problem\": \"=== PROGRAMMING PROBLEM ===\\n\\nTitle: Range Connect MST\\nPlatform: atcoder\\nDifficulty: hard\\n\\nProblem Statement:\\nThere is a graph with N + Q vertices, numbered 1, 2, \\\\ldots, N + Q. Initially, the graph has no edges.\\n... |
code_selection | [
{
"content": "You are an expert code evaluation system.",
"role": "system"
},
{
"content": "=== PROGRAMMING PROBLEM ===\n\nTitle: minimum-deletions-to-make-string-k-special\nPlatform: leetcode\nDifficulty: medium\n\nProblem Statement:\nYou are given a string word and an integer k.\nWe consider word ... | code_verification | {
"ground_truth": "{\"labels\": [true, false], \"num_candidates\": 2}",
"style": "rule"
} | {
"domain_id": 4,
"domain_name": "leetcode_medium",
"judge_context": "{\"problem\": \"=== PROGRAMMING PROBLEM ===\\n\\nTitle: minimum-deletions-to-make-string-k-special\\nPlatform: leetcode\\nDifficulty: medium\\n\\nProblem Statement:\\nYou are given a string word and an integer k.\\nWe consider word to be k-spec... |
code_selection | [
{
"content": "You are an expert code evaluation system.",
"role": "system"
},
{
"content": "=== PROGRAMMING PROBLEM ===\n\nTitle: minimum-size-subarray-in-infinite-array\nPlatform: leetcode\nDifficulty: medium\n\nProblem Statement:\nYou are given a 0-indexed array nums and an integer target.\nA 0-in... | code_verification | {
"ground_truth": "{\"labels\": [false, true], \"num_candidates\": 2}",
"style": "rule"
} | {
"domain_id": 4,
"domain_name": "leetcode_medium",
"judge_context": "{\"problem\": \"=== PROGRAMMING PROBLEM ===\\n\\nTitle: minimum-size-subarray-in-infinite-array\\nPlatform: leetcode\\nDifficulty: medium\\n\\nProblem Statement:\\nYou are given a 0-indexed array nums and an integer target.\\nA 0-indexed array ... |
code_selection | [
{
"content": "You are an expert code evaluation system.",
"role": "system"
},
{
"content": "=== PROGRAMMING PROBLEM ===\n\nTitle: Weak Beats\nPlatform: atcoder\nDifficulty: easy\n\nProblem Statement:\nYou are given a string S of length 16 consisting of 0 and 1.\nIf the i-th character of S is 0 for e... | code_verification | {
"ground_truth": "{\"labels\": [true, false], \"num_candidates\": 2}",
"style": "rule"
} | {
"domain_id": 0,
"domain_name": "atcoder_easy",
"judge_context": "{\"problem\": \"=== PROGRAMMING PROBLEM ===\\n\\nTitle: Weak Beats\\nPlatform: atcoder\\nDifficulty: easy\\n\\nProblem Statement:\\nYou are given a string S of length 16 consisting of 0 and 1.\\nIf the i-th character of S is 0 for every even numbe... |
code_selection | [
{
"content": "You are an expert code evaluation system.",
"role": "system"
},
{
"content": "=== PROGRAMMING PROBLEM ===\n\nTitle: largest-element-in-an-array-after-merge-operations\nPlatform: leetcode\nDifficulty: medium\n\nProblem Statement:\nYou are given a 0-indexed array nums consisting of posit... | code_verification | {
"ground_truth": "{\"labels\": [false, true], \"num_candidates\": 2}",
"style": "rule"
} | {
"domain_id": 4,
"domain_name": "leetcode_medium",
"judge_context": "{\"problem\": \"=== PROGRAMMING PROBLEM ===\\n\\nTitle: largest-element-in-an-array-after-merge-operations\\nPlatform: leetcode\\nDifficulty: medium\\n\\nProblem Statement:\\nYou are given a 0-indexed array nums consisting of positive integers.... |
code_selection | [
{
"content": "You are an expert code evaluation system.",
"role": "system"
},
{
"content": "=== PROGRAMMING PROBLEM ===\n\nTitle: Extended ABC\nPlatform: atcoder\nDifficulty: easy\n\nProblem Statement:\nWe define Extended A strings, Extended B strings, Extended C strings, and Extended ABC strings as... | code_verification | {
"ground_truth": "{\"labels\": [true, false], \"num_candidates\": 2}",
"style": "rule"
} | {
"domain_id": 0,
"domain_name": "atcoder_easy",
"judge_context": "{\"problem\": \"=== PROGRAMMING PROBLEM ===\\n\\nTitle: Extended ABC\\nPlatform: atcoder\\nDifficulty: easy\\n\\nProblem Statement:\\nWe define Extended A strings, Extended B strings, Extended C strings, and Extended ABC strings as follows:\\n\\n-... |
code_selection | [
{
"content": "You are an expert code evaluation system.",
"role": "system"
},
{
"content": "=== PROGRAMMING PROBLEM ===\n\nTitle: make-lexicographically-smallest-array-by-swapping-elements\nPlatform: leetcode\nDifficulty: medium\n\nProblem Statement:\nYou are given a 0-indexed array of positive inte... | code_verification | {
"ground_truth": "{\"labels\": [true, false], \"num_candidates\": 2}",
"style": "rule"
} | {
"domain_id": 4,
"domain_name": "leetcode_medium",
"judge_context": "{\"problem\": \"=== PROGRAMMING PROBLEM ===\\n\\nTitle: make-lexicographically-smallest-array-by-swapping-elements\\nPlatform: leetcode\\nDifficulty: medium\\n\\nProblem Statement:\\nYou are given a 0-indexed array of positive integers nums and... |
code_selection | [
{
"content": "You are an expert code evaluation system.",
"role": "system"
},
{
"content": "=== PROGRAMMING PROBLEM ===\n\nTitle: Christmas Color Grid 1\nPlatform: atcoder\nDifficulty: hard\n\nProblem Statement:\nThis problem has a similar setting to Problem G. Differences in the problem statement a... | code_verification | {
"ground_truth": "{\"labels\": [false, true], \"num_candidates\": 2}",
"style": "rule"
} | {
"domain_id": 2,
"domain_name": "atcoder_hard",
"judge_context": "{\"problem\": \"=== PROGRAMMING PROBLEM ===\\n\\nTitle: Christmas Color Grid 1\\nPlatform: atcoder\\nDifficulty: hard\\n\\nProblem Statement:\\nThis problem has a similar setting to Problem G. Differences in the problem statement are indicated in ... |
code_selection | [
{
"content": "You are an expert code evaluation system.",
"role": "system"
},
{
"content": "=== PROGRAMMING PROBLEM ===\n\nTitle: painting-the-walls\nPlatform: leetcode\nDifficulty: hard\n\nProblem Statement:\nYou are given two 0-indexed integer arrays, cost and time, of size n representing the cost... | code_verification | {
"ground_truth": "{\"labels\": [false, true], \"num_candidates\": 2}",
"style": "rule"
} | {
"domain_id": 5,
"domain_name": "leetcode_hard",
"judge_context": "{\"problem\": \"=== PROGRAMMING PROBLEM ===\\n\\nTitle: painting-the-walls\\nPlatform: leetcode\\nDifficulty: hard\\n\\nProblem Statement:\\nYou are given two 0-indexed integer arrays, cost and time, of size n representing the costs and the time ... |
code_selection | [
{
"content": "You are an expert code evaluation system.",
"role": "system"
},
{
"content": "=== PROGRAMMING PROBLEM ===\n\nTitle: First Player\nPlatform: atcoder\nDifficulty: easy\n\nProblem Statement:\nThere are N people numbered 1, 2, \\ldots, N, sitting in this clockwise order around a round tabl... | code_verification | {
"ground_truth": "{\"labels\": [false, true], \"num_candidates\": 2}",
"style": "rule"
} | {
"domain_id": 0,
"domain_name": "atcoder_easy",
"judge_context": "{\"problem\": \"=== PROGRAMMING PROBLEM ===\\n\\nTitle: First Player\\nPlatform: atcoder\\nDifficulty: easy\\n\\nProblem Statement:\\nThere are N people numbered 1, 2, \\\\ldots, N, sitting in this clockwise order around a round table.\\r\\nIn par... |
code_selection | [
{
"content": "You are an expert code evaluation system.",
"role": "system"
},
{
"content": "=== PROGRAMMING PROBLEM ===\n\nTitle: longest-alternating-subarray\nPlatform: leetcode\nDifficulty: easy\n\nProblem Statement:\nYou are given a 0-indexed integer array nums. A subarray s of length m is called... | code_verification | {
"ground_truth": "{\"labels\": [false, true], \"num_candidates\": 2}",
"style": "rule"
} | {
"domain_id": 3,
"domain_name": "leetcode_easy",
"judge_context": "{\"problem\": \"=== PROGRAMMING PROBLEM ===\\n\\nTitle: longest-alternating-subarray\\nPlatform: leetcode\\nDifficulty: easy\\n\\nProblem Statement:\\nYou are given a 0-indexed integer array nums. A subarray s of length m is called alternating if... |
code_selection | [
{
"content": "You are an expert code evaluation system.",
"role": "system"
},
{
"content": "=== PROGRAMMING PROBLEM ===\n\nTitle: minimum-array-length-after-pair-removals\nPlatform: leetcode\nDifficulty: medium\n\nProblem Statement:\nYou are given a 0-indexed sorted array of integers nums.\nYou can ... | code_verification | {
"ground_truth": "{\"labels\": [false, true], \"num_candidates\": 2}",
"style": "rule"
} | {
"domain_id": 4,
"domain_name": "leetcode_medium",
"judge_context": "{\"problem\": \"=== PROGRAMMING PROBLEM ===\\n\\nTitle: minimum-array-length-after-pair-removals\\nPlatform: leetcode\\nDifficulty: medium\\n\\nProblem Statement:\\nYou are given a 0-indexed sorted array of integers nums.\\nYou can perform the ... |
code_selection | [
{
"content": "You are an expert code evaluation system.",
"role": "system"
},
{
"content": "=== PROGRAMMING PROBLEM ===\n\nTitle: Revenge of \"The Salary of AtCoder Inc.\"\nPlatform: atcoder\nDifficulty: hard\n\nProblem Statement:\nAoki, an employee at AtCoder Inc., has his salary for this month det... | code_verification | {
"ground_truth": "{\"labels\": [false, true], \"num_candidates\": 2}",
"style": "rule"
} | {
"domain_id": 2,
"domain_name": "atcoder_hard",
"judge_context": "{\"problem\": \"=== PROGRAMMING PROBLEM ===\\n\\nTitle: Revenge of \\\"The Salary of AtCoder Inc.\\\"\\nPlatform: atcoder\\nDifficulty: hard\\n\\nProblem Statement:\\nAoki, an employee at AtCoder Inc., has his salary for this month determined by a... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.