context listlengths 1 1 | gen_kwargs dict | repeat_idx int64 0 4 | request_idx int64 0 510 | task_name stringclasses 6
values | metadata dict | model_outputs stringlengths 1.81k 820k |
|---|---|---|---|---|---|---|
[
{
"content": "Generate an executable Python function generated from the given prompt. The function should take stdin as input and print the output. Simply call the function after the definition.There are three cards with letters $\\texttt{a}$, $\\texttt{b}$, $\\texttt{c}$ placed in a row in some order. You can ... | {
"do_sample": false,
"max_new_tokens": 32768,
"seed": 0,
"temperature": 0.7
} | 0 | 0 | LiveCodeBench | {
"expected_answer": "",
"problem_id": "",
"reference_solution": ""
} | <|begin_of_thought|>
Okay, let's see. I need to solve this problem where I have three cards in a row, each being a, b, c. The task is to determine if after at most one swap, the order becomes abc. So, the function should take the input string and check all possible swaps to see if any of them result in abc. If yes, ou... |
[
{
"content": "Generate an executable Python function generated from the given prompt. The function should take stdin as input and print the output. Simply call the function after the definition.Slavic is preparing a present for a friend's birthday. He has an array $a$ of $n$ digits and the present will be the p... | {
"do_sample": false,
"max_new_tokens": 32768,
"seed": 0,
"temperature": 0.7
} | 0 | 1 | LiveCodeBench | {
"expected_answer": "",
"problem_id": "",
"reference_solution": ""
} | <|begin_of_thought|>
Okay, let's see. The problem is about finding the maximum product after adding 1 to exactly one digit in the array. Hmm. So the input is an array of digits, and for each test case, we need to pick one digit to add 1 to, then compute the product of all digits (including that modified one) and find ... |
[
{
"content": "Generate an executable Python function generated from the given prompt. The function should take stdin as input and print the output. Simply call the function after the definition.You are given a strip of paper $s$ that is $n$ cells long. Each cell is either black or white. In an operation you can... | {
"do_sample": false,
"max_new_tokens": 32768,
"seed": 0,
"temperature": 0.7
} | 0 | 2 | LiveCodeBench | {
"expected_answer": "",
"problem_id": "",
"reference_solution": ""
} | <|begin_of_thought|>
Okay, let's see. I need to find the minimum number of operations to turn all the black cells in a string into white using k-length consecutive operations. Hmm. So each operation can flip a k-length consecutive segment to all white. The goal is to do this with the least number of steps possible.
F... |
[
{
"content": "Generate an executable Python function generated from the given prompt. The function should take stdin as input and print the output. Simply call the function after the definition.You are given a string $s$ of length $n$, consisting of lowercase Latin letters, and an integer $k$.\n\nYou need to ch... | {
"do_sample": false,
"max_new_tokens": 32768,
"seed": 0,
"temperature": 0.7
} | 0 | 3 | LiveCodeBench | {
"expected_answer": "",
"problem_id": "",
"reference_solution": ""
} | <|begin_of_thought|>
Okay, let's see. I need to solve this problem where I have to determine if it's possible to remove exactly k characters from a string so that the remaining characters can be rearranged into a palindrome. Hmm.
So, the key here is to figure out under what conditions the remaining characters can for... |
[
{
"content": "Generate an executable Python function generated from the given prompt. The function should take stdin as input and print the output. Simply call the function after the definition.You are given an array of integers $a_1, a_2, \\ldots, a_n$ and a number $k$ ($2 \\leq k \\leq 5$). In one operation, ... | {
"do_sample": false,
"max_new_tokens": 32768,
"seed": 0,
"temperature": 0.7
} | 0 | 4 | LiveCodeBench | {
"expected_answer": "",
"problem_id": "",
"reference_solution": ""
} | <|begin_of_thought|>
Okay, let's see. I need to find the minimum number of operations to make the product of the array divisible by k. Each operation increases an element by 1. Hmm. So the product must be divisible by k, which is between 2 and 5. Since k can be up to 5, maybe I should handle each possible k case separ... |
[
{
"content": "Generate an executable Python function generated from the given prompt. The function should take stdin as input and print the output. Simply call the function after the definition.Vanya and Vova are playing a game. Players are given an integer $n$. On their turn, the player can add $1$ to the curr... | {
"do_sample": false,
"max_new_tokens": 32768,
"seed": 0,
"temperature": 0.7
} | 0 | 5 | LiveCodeBench | {
"expected_answer": "",
"problem_id": "",
"reference_solution": ""
} | <|begin_of_thought|>
Okay, let's try to figure out this problem. So the problem is about Vanya and Vova playing a game. The rules are a bit specific, and we need to determine who wins based on the initial number n, assuming both play optimally.
First, let me restate the problem to make sure I understand it. The game ... |
[
{
"content": "Generate an executable Python function generated from the given prompt. The function should take stdin as input and print the output. Simply call the function after the definition.Alex is participating in the filming of another video of BrMeast, and BrMeast asked Alex to prepare 250 thousand tons ... | {
"do_sample": false,
"max_new_tokens": 32768,
"seed": 0,
"temperature": 0.7
} | 0 | 6 | LiveCodeBench | {
"expected_answer": "",
"problem_id": "",
"reference_solution": ""
} | <|begin_of_thought|>
Okay, let's try to understand this problem. So, the task is to find the maximum possible absolute difference between the total weights of any two trucks. The way the trucks are loaded depends on the value of k, which is the number of boxes each truck can hold. For each possible k (from 1 to n), we... |
[
{
"content": "Generate an executable Python function generated from the given prompt. The function should take stdin as input and print the output. Simply call the function after the definition.A subarray is a continuous part of array.\n\nYarik recently found an array $a$ of $n$ elements and became very interes... | {
"do_sample": false,
"max_new_tokens": 32768,
"seed": 0,
"temperature": 0.7
} | 0 | 7 | LiveCodeBench | {
"expected_answer": "",
"problem_id": "",
"reference_solution": ""
} | <|begin_of_thought|>
Okay, let's see. I need to find the maximum sum of a non-empty subarray where the elements have alternating parities. Hmm. So each adjacent element in the subarray must be of different parity. Like, even, odd, even, etc. Or odd, even, odd. So the subarray can't have two even or two odd numbers nex... |
[
{
"content": "Generate an executable Python function generated from the given prompt. The function should take stdin as input and print the output. Simply call the function after the definition.Yarik is a big fan of many kinds of music. But Yarik loves not only listening to music but also writing it. He likes e... | {
"do_sample": false,
"max_new_tokens": 32768,
"seed": 0,
"temperature": 0.7
} | 0 | 8 | LiveCodeBench | {
"expected_answer": "",
"problem_id": "",
"reference_solution": ""
} | <|begin_of_thought|>
Okay, let's try to understand this problem. So Yarik's music system uses these notes represented as 2^k, and he's interested in pairs of notes (b_i, b_j) where the combination is the same in both orders. That means b_i^b_j equals b_j^b_i. We need to count how many such pairs there are for each tes... |
[
{
"content": "Generate an executable Python function generated from the given prompt. Return the function body without invoking it at the final solution.You are given a 0-indexed array of strings details. Each element of details provides information about a given passenger compressed into a string of length 15.... | {
"do_sample": false,
"max_new_tokens": 32768,
"seed": 0,
"temperature": 0.7
} | 0 | 9 | LiveCodeBench | {
"expected_answer": "",
"problem_id": "",
"reference_solution": ""
} | <|begin_of_thought|>
Okay, let's see. I need to write a Python function that counts how many passengers are strictly more than 60 years old. The input is a list of strings, each 15 characters long. Each string has the phone number first, then gender, then age, then seat.
So the age is in the 11th and 12th characters,... |
[
{
"content": "Generate an executable Python function generated from the given prompt. Return the function body without invoking it at the final solution.You are given a 0-indexed 2D integer array nums. Initially, your score is 0. Perform the following operations until the matrix becomes empty:\n\nFrom each row ... | {
"do_sample": false,
"max_new_tokens": 32768,
"seed": 0,
"temperature": 0.7
} | 0 | 10 | LiveCodeBench | {
"expected_answer": "",
"problem_id": "",
"reference_solution": ""
} | <|begin_of_thought|>
Okay, let's see. I need to solve this problem where I have to compute a score based on selecting the largest numbers from each row in a matrix, then taking the maximum of those selected each time. Hmm.
So the problem says, in each step, we pick the largest number from each row. Then among all tho... |
[
{
"content": "Generate an executable Python function generated from the given prompt. Return the function body without invoking it at the final solution.You are given a 0-indexed integer array nums of length n and an integer k. In an operation, you can choose an element and multiply it by 2.\nReturn the maximum... | {
"do_sample": false,
"max_new_tokens": 32768,
"seed": 0,
"temperature": 0.7
} | 0 | 11 | LiveCodeBench | {
"expected_answer": "",
"problem_id": "",
"reference_solution": ""
} | <|begin_of_thought|>
Okay, let's see. I need to find the maximum possible OR value after applying at most k multiplications by 2 on the elements of the array. Hmm. The key here is that the OR operation is cumulative, so once a bit is set, it remains set. So the goal is to choose which elements to multiply by 2 to maxi... |
[
{
"content": "Generate an executable Python function generated from the given prompt. Return the function body without invoking it at the final solution.You are given a 0-indexed integer array nums representing the score of students in an exam. The teacher would like to form one non-empty group of students with... | {
"do_sample": false,
"max_new_tokens": 32768,
"seed": 0,
"temperature": 0.7
} | 0 | 12 | LiveCodeBench | {
"expected_answer": "",
"problem_id": "",
"reference_solution": ""
} | <|begin_of_thought|>
Okay, let's see. I need to find the maximum strength of a group of students based on their scores. The strength is the product of the selected elements. Hmm. So the problem is to choose a subset of the array (non-empty) such that the product is maximized.
First, I should think about the possible ... |
[
{
"content": "Generate an executable Python function generated from the given prompt. Return the function body without invoking it at the final solution.You are given a 0-indexed string s and a dictionary of words dictionary. You have to break s into one or more non-overlapping substrings such that each substri... | {
"do_sample": false,
"max_new_tokens": 32768,
"seed": 0,
"temperature": 0.7
} | 0 | 13 | LiveCodeBench | {
"expected_answer": "",
"problem_id": "",
"reference_solution": ""
} | <|begin_of_thought|>
Okay, let's see. I need to find the minimum number of extra characters left in the string s after breaking it into substrings that are present in the dictionary. Hmm. So, the problem is similar to partitioning the string into parts that are in the dictionary, and we want to minimize the leftover c... |
[
{
"content": "Generate an executable Python function generated from the given prompt. Return the function body without invoking it at the final solution.You are given an integer array prices representing the prices of various chocolates in a store. You are also given a single integer money, which represents you... | {
"do_sample": false,
"max_new_tokens": 32768,
"seed": 0,
"temperature": 0.7
} | 0 | 14 | LiveCodeBench | {
"expected_answer": "",
"problem_id": "",
"reference_solution": ""
} | <|begin_of_thought|>
Okay, let's see. I need to solve this problem where I have to buy exactly two chocolates such that after buying them, the leftover money is non-negative and as small as possible. If it's not possible, return the original money. Hmm.
So the problem says that I have to buy exactly two chocolates. T... |
[
{
"content": "Generate an executable Python function generated from the given prompt. Return the function body without invoking it at the final solution.You are given two numeric strings num1 and num2 and two integers max_sum and min_sum. We denote an integer x to be good if:\n\nnum1 <= x <= num2\nmin_sum <= di... | {
"do_sample": false,
"max_new_tokens": 32768,
"seed": 0,
"temperature": 0.7
} | 0 | 15 | LiveCodeBench | {
"expected_answer": "",
"problem_id": "",
"reference_solution": ""
} | <|begin_of_thought|>
Okay, let's see. I need to find the number of good integers x such that x is between num1 and num2 (inclusive), and the sum of the digits of x is between min_sum and max_sum. The answer should be modulo 1e9+7. Hmm.
First, I remember that num1 and num2 are given as strings, so I can't just convert... |
[
{
"content": "Generate an executable Python function generated from the given prompt. Return the function body without invoking it at the final solution.You are given a 0-indexed array nums of length n.\nThe distinct difference array of nums is an array diff of length n such that diff[i] is equal to the number ... | {
"do_sample": false,
"max_new_tokens": 32768,
"seed": 0,
"temperature": 0.7
} | 0 | 16 | LiveCodeBench | {
"expected_answer": "",
"problem_id": "",
"reference_solution": ""
} | <|begin_of_thought|>
Okay, let's see. I need to solve this problem where I have to compute the distinct difference array for a given nums array. The distinct difference array's ith element is the difference between the number of distinct elements in the prefix up to i and the number of distinct elements in the suffix ... |
[
{
"content": "Generate an executable Python function generated from the given prompt. Return the function body without invoking it at the final solution.There is a 0-indexed array nums of length n. Initially, all elements are uncolored (has a value of 0).\nYou are given a 2D integer array queries where queries[... | {
"do_sample": false,
"max_new_tokens": 32768,
"seed": 0,
"temperature": 0.7
} | 0 | 17 | LiveCodeBench | {
"expected_answer": "",
"problem_id": "",
"reference_solution": ""
} | <|begin_of_thought|>
Okay, let's see. I need to solve this problem where after each query, I have to count the number of adjacent elements with the same color. The array starts all zeros, and each query colors a specific index. The answer array should have the count after each query.
Hmm, the constraints are up to 1e... |
[
{
"content": "Generate an executable Python function generated from the given prompt. Return the function body without invoking it at the final solution.You are given a 0-indexed integer array nums representing the strength of some heroes. The power of a group of heroes is defined as follows:\n\nLet i_0, i_1, .... | {
"do_sample": false,
"max_new_tokens": 32768,
"seed": 0,
"temperature": 0.7
} | 0 | 18 | LiveCodeBench | {
"expected_answer": "",
"problem_id": "",
"reference_solution": ""
} | <|begin_of_thought|>
Okay, let's see. I need to find the sum of the power of all possible non-empty groups of heroes. The power of a group is max squared multiplied by min. Hmm. So for each subset of the array, compute max^2 * min and sum all of them.
But the constraints are up to 1e5 elements. So a brute-force appro... |
[
{
"content": "Generate an executable Python function generated from the given prompt. Return the function body without invoking it at the final solution.You are given a 0-indexed permutation of n integers nums.\nA permutation is called semi-ordered if the first number equals 1 and the last number equals n. You ... | {
"do_sample": false,
"max_new_tokens": 32768,
"seed": 0,
"temperature": 0.7
} | 0 | 19 | LiveCodeBench | {
"expected_answer": "",
"problem_id": "",
"reference_solution": ""
} | <|begin_of_thought|>
Okay, let's see. I need to find the minimum number of adjacent swaps required to turn a permutation into a semi-ordered permutation. A semi-ordered permutation is one where the first element is 1 and the last is n. So the goal is to get 1 at position 0 and n at position n-1 through swapping adjace... |
[
{
"content": "Generate an executable Python function generated from the given prompt. Return the function body without invoking it at the final solution.You are given a 0-indexed string s that consists of digits from 0 to 9.\nA string t is called a semi-repetitive if there is at most one consecutive pair of the... | {
"do_sample": false,
"max_new_tokens": 32768,
"seed": 0,
"temperature": 0.7
} | 0 | 20 | LiveCodeBench | {
"expected_answer": "",
"problem_id": "",
"reference_solution": ""
} | <|begin_of_thought|>
Okay, let's see. I need to find the longest semi-repetitive substring in a given string. A semi-repetitive string has at most one consecutive pair of the same digits. So, the problem is to find the maximum length of such a substring.
Hmm. Let's start by understanding what a semi-repetitive string... |
[
{
"content": "Generate an executable Python function generated from the given prompt. Return the function body without invoking it at the final solution.There are n friends that are playing a game. The friends are sitting in a circle and are numbered from 1 to n in clockwise order. More formally, moving clockwi... | {
"do_sample": false,
"max_new_tokens": 32768,
"seed": 0,
"temperature": 0.7
} | 0 | 21 | LiveCodeBench | {
"expected_answer": "",
"problem_id": "",
"reference_solution": ""
} | <|begin_of_thought|>
Okay, let's see. I need to solve this problem where friends are sitting in a circle, passing a ball according to certain steps. The goal is to find out which friends never received the ball. Hmm.
So, the problem says the first friend starts with the ball. Then each turn, the current holder passes... |
[
{
"content": "Generate an executable Python function generated from the given prompt. Return the function body without invoking it at the final solution.A 0-indexed array derived with length n is derived by computing the bitwise XOR (⊕) of adjacent values in a binary array original of length n.\nSpecifically, f... | {
"do_sample": false,
"max_new_tokens": 32768,
"seed": 0,
"temperature": 0.7
} | 0 | 22 | LiveCodeBench | {
"expected_answer": "",
"problem_id": "",
"reference_solution": ""
} | <|begin_of_thought|>
Okay, let's see. I need to determine if there's a binary array original that can produce the given derived array through XOR operations. Hmm. So the derived array is built by taking adjacent XORs, but with the last element being the XOR of the last element of original and the first. So the origina... |
[
{
"content": "Generate an executable Python function generated from the given prompt. Return the function body without invoking it at the final solution.You are given a string s consisting only of uppercase English letters.\nYou can apply some operations to this string where, in one operation, you can remove an... | {
"do_sample": false,
"max_new_tokens": 32768,
"seed": 0,
"temperature": 0.7
} | 0 | 23 | LiveCodeBench | {
"expected_answer": "",
"problem_id": "",
"reference_solution": ""
} | <|begin_of_thought|>
Okay, let's see. I need to find the minimum possible length of a string after removing all possible occurrences of "AB" or "CD". And each time I remove a substring, the remaining parts are concatenated, which might create new "AB" or "CD" substrings that I can then remove. The goal is to do this o... |
[
{
"content": "Generate an executable Python function generated from the given prompt. Return the function body without invoking it at the final solution.Given a positive integer n, return the punishment number of n.\nThe punishment number of n is defined as the sum of the squares of all integers i such that:\n\... | {
"do_sample": false,
"max_new_tokens": 32768,
"seed": 0,
"temperature": 0.7
} | 0 | 24 | LiveCodeBench | {
"expected_answer": "",
"problem_id": "",
"reference_solution": ""
} | <|begin_of_thought|>
Okay, let's see. I need to find the punishment number for a given n. The punishment number is the sum of the squares of all integers i from 1 to n that satisfy a certain condition. The condition is that when you square i, the decimal representation of the square can be split into contiguous substr... |
[
{
"content": "Generate an executable Python function generated from the given prompt. Return the function body without invoking it at the final solution.You are given two 0-indexed integer arrays, cost and time, of size n representing the costs and the time taken to paint n different walls respectively. There a... | {
"do_sample": false,
"max_new_tokens": 32768,
"seed": 0,
"temperature": 0.7
} | 0 | 25 | LiveCodeBench | {
"expected_answer": "",
"problem_id": "",
"reference_solution": ""
} | <|begin_of_thought|>
Okay, let's see. I need to find the minimum cost to paint all the walls using both paid and free painters. The paid painter can paint each wall in their respective time and cost, while the free painter can only be used if the paid painter is busy. Oh right, the free painter paints any wall in 1 un... |
[
{
"content": "Generate an executable Python function generated from the given prompt. Return the function body without invoking it at the final solution.You are given a 0-indexed integer array nums of size n representing the cost of collecting different chocolates. The cost of collecting the chocolate at the in... | {
"do_sample": false,
"max_new_tokens": 32768,
"seed": 0,
"temperature": 0.7
} | 0 | 26 | LiveCodeBench | {
"expected_answer": "",
"problem_id": "",
"reference_solution": ""
} | <|begin_of_thought|>
Okay, let's try to understand this problem. So, the task is to find the minimum cost to collect all types of chocolates given that after each operation, all chocolates change their type in a circular way. Each operation costs x. Hmm.
Wait, the problem says that after each operation, the i-th type... |
[
{
"content": "Generate an executable Python function generated from the given prompt. Return the function body without invoking it at the final solution.You are given two integers, n and k.\nAn array of distinct positive integers is called a k-avoiding array if there does not exist any pair of distinct elements... | {
"do_sample": false,
"max_new_tokens": 32768,
"seed": 0,
"temperature": 0.7
} | 0 | 27 | LiveCodeBench | {
"expected_answer": "",
"problem_id": "",
"reference_solution": ""
} | <|begin_of_thought|>
Okay, let's see. I need to find the minimum possible sum of a k-avoiding array of length n. The array must consist of distinct positive integers, and there should be no two distinct elements that sum to k. Hmm.
So the problem is to create the smallest possible array of n elements where no two ele... |
[
{
"content": "Generate an executable Python function generated from the given prompt. Return the function body without invoking it at the final solution.You are given two integers, num and t.\nAn integer x is called achievable if it can become equal to num after applying the following operation no more than t t... | {
"do_sample": false,
"max_new_tokens": 32768,
"seed": 0,
"temperature": 0.7
} | 0 | 28 | LiveCodeBench | {
"expected_answer": "",
"problem_id": "",
"reference_solution": ""
} | <|begin_of_thought|>
Okay, let's see. I need to find the maximum possible achievable number x given num and t. The operation allowed is to increase or decrease x by 1 and simultaneously increase or decrease num by 1. And I can do this up to t times. Hmm.
Wait, each operation involves changing both x and num. So each ... |
[
{
"content": "Generate an executable Python function generated from the given prompt. Return the function body without invoking it at the final solution.You are given a string s consisting of lowercase English letters, and you are allowed to perform operations on it. In one operation, you can replace a characte... | {
"do_sample": false,
"max_new_tokens": 32768,
"seed": 0,
"temperature": 0.7
} | 0 | 29 | LiveCodeBench | {
"expected_answer": "",
"problem_id": "",
"reference_solution": ""
} | <|begin_of_thought|>
Okay, let's see. I need to find the minimal number of operations to turn a string into a palindrome. And if there are multiple, choose the lex smallest. Hmm.
So, the approach should be to compare characters from the start and end towards the center. For each pair that doesn't match, decide whethe... |
[
{
"content": "Generate an executable Python function generated from the given prompt. Return the function body without invoking it at the final solution.You are given a 0-indexed binary string s of length n on which you can apply two types of operations:\n\nChoose an index i and invert all characters from index... | {
"do_sample": false,
"max_new_tokens": 32768,
"seed": 0,
"temperature": 0.7
} | 0 | 30 | LiveCodeBench | {
"expected_answer": "",
"problem_id": "",
"reference_solution": ""
} | <|begin_of_thought|>
Okay, let's see. I need to find the minimum cost to turn all characters in a binary string into the same character (either all 0s or all 1s). The operations allowed are flipping a prefix up to index i (cost i+1) or flipping a suffix from index i to end (cost n-i). Hmm.
First, I should figure out ... |
[
{
"content": "Generate an executable Python function generated from the given prompt. Return the function body without invoking it at the final solution.Given a positive integer num represented as a string, return the integer num without trailing zeros as a string.\n \nExample 1:\n\nInput: num = \"51230100\"\nO... | {
"do_sample": false,
"max_new_tokens": 32768,
"seed": 0,
"temperature": 0.7
} | 0 | 31 | LiveCodeBench | {
"expected_answer": "",
"problem_id": "",
"reference_solution": ""
} | <|begin_of_thought|>
Okay, let's see. I need to write a Python function that takes a string representing a positive integer and removes any trailing zeros. The output should be the same string but without those zeros. Hmm, how do I approach this?
Wait, the input is a string like "51230100". So the first thing I shoul... |
[
{
"content": "Generate an executable Python function generated from the given prompt. Return the function body without invoking it at the final solution.You are given an integer n that consists of exactly 3 digits.\nWe call the number n fascinating if, after the following modification, the resulting number cont... | {
"do_sample": false,
"max_new_tokens": 32768,
"seed": 0,
"temperature": 0.7
} | 0 | 32 | LiveCodeBench | {
"expected_answer": "",
"problem_id": "",
"reference_solution": ""
} | <|begin_of_thought|>
Okay, let's see. I need to write a Python function to check if a 3-digit number is fascinating. The condition is that when you concatenate n, 2n, and 3n, the resulting number has all digits 1-9 exactly once, with no zeros. Hmm.
First, let's understand the problem step by step. So, for example, n=... |
[
{
"content": "Generate an executable Python function generated from the given prompt. Return the function body without invoking it at the final solution.Given a 0-indexed string s, repeatedly perform the following operation any number of times:\n\nChoose an index i in the string, and let c be the character in p... | {
"do_sample": false,
"max_new_tokens": 32768,
"seed": 0,
"temperature": 0.7
} | 0 | 33 | LiveCodeBench | {
"expected_answer": "",
"problem_id": "",
"reference_solution": ""
} | <|begin_of_thought|>
Okay, let's see. I need to find the minimal possible length of a string after performing these operations any number of times. The operation is choosing a character at some index i, and then deleting the closest occurrence of that character to the left and right of i. Hmm. So each time I do this o... |
[
{
"content": "Generate an executable Python function generated from the given prompt. Return the function body without invoking it at the final solution.You are given a 0-indexed integer array nums, and you are allowed to traverse between its indices. You can traverse between index i and index j, i != j, if and... | {
"do_sample": false,
"max_new_tokens": 32768,
"seed": 0,
"temperature": 0.7
} | 0 | 34 | LiveCodeBench | {
"expected_answer": "",
"problem_id": "",
"reference_solution": ""
} | <|begin_of_thought|>
Okay, let's see. I need to determine if every pair of indices in the array can be connected via a path of traversals. Each traversal is allowed between two indices if their gcd is greater than 1. So, the problem is essentially checking if the graph formed by connecting indices with gcd >1 edges is... |
[
{
"content": "Generate an executable Python function generated from the given prompt. Return the function body without invoking it at the final solution.You are given a string s consisting of only lowercase English letters. In one operation, you can do the following:\n\nSelect any non-empty substring of s, poss... | {
"do_sample": false,
"max_new_tokens": 32768,
"seed": 0,
"temperature": 0.7
} | 0 | 35 | LiveCodeBench | {
"expected_answer": "",
"problem_id": "",
"reference_solution": ""
} | <|begin_of_thought|>
Okay, let's see. I need to find the lexicographically smallest string possible by applying exactly one operation. The operation is to select a substring (any non-empty part) and replace each character with the previous one. So for each character in the substring, if it's 'a', it becomes 'z', other... |
[
{
"content": "Generate an executable Python function generated from the given prompt. Return the function body without invoking it at the final solution.You are given a 0-indexed integer array nums. A pair of indices i, j where 0 <= i < j < nums.length is called beautiful if the first digit of nums[i] and the l... | {
"do_sample": false,
"max_new_tokens": 32768,
"seed": 0,
"temperature": 0.7
} | 0 | 36 | LiveCodeBench | {
"expected_answer": "",
"problem_id": "",
"reference_solution": ""
} | <|begin_of_thought|>
Okay, let's see. I need to find the number of beautiful pairs in the array. A beautiful pair is when i < j, and the first digit of nums[i] and the last digit of nums[j] are coprime. Oh right, and coprime means their GCD is 1.
First, I need to figure out how to get the first digit of a number and... |
[
{
"content": "Generate an executable Python function generated from the given prompt. Return the function body without invoking it at the final solution.You are given a 0-indexed integer array nums and an integer k.\nA subarray is called equal if all of its elements are equal. Note that the empty subarray is an... | {
"do_sample": false,
"max_new_tokens": 32768,
"seed": 0,
"temperature": 0.7
} | 0 | 37 | LiveCodeBench | {
"expected_answer": "",
"problem_id": "",
"reference_solution": ""
} | <|begin_of_thought|>
Okay, let's see. I need to find the longest possible equal subarray after deleting at most k elements. Hmm. So the problem is about finding a subarray where all elements are the same, and we can remove up to k elements to achieve that. And I have to find the maximum possible length of such a subar... |
[
{
"content": "Generate an executable Python function generated from the given prompt. Return the function body without invoking it at the final solution.You are given an integer n denoting the total number of servers and a 2D 0-indexed integer array logs, where logs[i] = [server_id, time] denotes that the serve... | {
"do_sample": false,
"max_new_tokens": 32768,
"seed": 0,
"temperature": 0.7
} | 0 | 38 | LiveCodeBench | {
"expected_answer": "",
"problem_id": "",
"reference_solution": ""
} | <|begin_of_thought|>
Okay, let's see. I need to solve this problem where I have to find for each query the number of servers that didn't receive any requests in a certain time interval. The interval is [queries[i] - x, queries[i]]. Hmm.
So the input is n servers, a list of logs (each log is a server and a time), x, a... |
[
{
"content": "Generate an executable Python function generated from the given prompt. Return the function body without invoking it at the final solution.You are given a 0-indexed integer array nums representing the initial positions of some marbles. You are also given two 0-indexed integer arrays moveFrom and m... | {
"do_sample": false,
"max_new_tokens": 32768,
"seed": 0,
"temperature": 0.7
} | 0 | 39 | LiveCodeBench | {
"expected_answer": "",
"problem_id": "",
"reference_solution": ""
} | <|begin_of_thought|>
Okay, let's see. I need to solve this problem where marbles are moved from their current positions to new positions, and after all moves, I have to return the sorted list of all occupied positions. Hmm.
So the input is nums which is the initial positions of the marbles. Then moveFrom and moveTo a... |
[
{
"content": "Generate an executable Python function generated from the given prompt. Return the function body without invoking it at the final solution.You are given two integers num1 and num2.\nIn one operation, you can choose integer i in the range [0, 60] and subtract 2^i + num2 from num1.\nReturn the integ... | {
"do_sample": false,
"max_new_tokens": 32768,
"seed": 0,
"temperature": 0.7
} | 0 | 40 | LiveCodeBench | {
"expected_answer": "",
"problem_id": "",
"reference_solution": ""
} | <|begin_of_thought|>
Okay, let's try to figure out this problem. So the task is to find the minimum number of operations to make num1 zero. Each operation allows us to subtract 2^i + num2 from num1, where i is between 0 and 60. Hmm.
First, I need to understand what each operation does. Let's see: each operation subtr... |
[
{
"content": "Generate an executable Python function generated from the given prompt. Return the function body without invoking it at the final solution.You are given two 0-indexed integer arrays nums1 and nums2, each of length n, and a 1-indexed 2D array queries where queries[i] = [x_i, y_i].\nFor the i^th que... | {
"do_sample": false,
"max_new_tokens": 32768,
"seed": 0,
"temperature": 0.7
} | 0 | 41 | LiveCodeBench | {
"expected_answer": "",
"problem_id": "",
"reference_solution": ""
} | <|begin_of_thought|>
Okay, let's see. I need to solve this problem where for each query, I have to find the maximum value of nums1[j] + nums2[j] for all j where nums1[j] is >= x_i and nums2[j] >= y_i. If there's no such j, return -1. The challenge is to do this efficiently given the constraints, especially since n and... |
[
{
"content": "Generate an executable Python function generated from the given prompt. Return the function body without invoking it at the final solution.You are given a 1-indexed integer array nums of length n.\nAn element nums[i] of nums is called special if i divides n, i.e. n % i == 0.\nReturn the sum of the... | {
"do_sample": false,
"max_new_tokens": 32768,
"seed": 0,
"temperature": 0.7
} | 0 | 42 | LiveCodeBench | {
"expected_answer": "",
"problem_id": "",
"reference_solution": ""
} | <|begin_of_thought|>
Okay, let's see. I need to write a Python function that calculates the sum of the squares of all special elements in a given array. The special elements are those where their 1-based index i divides the length of the array, right? So for example, if the array has length 4, then indices 1, 2, and 4... |
[
{
"content": "Generate an executable Python function generated from the given prompt. Return the function body without invoking it at the final solution.You are given a positive integer array nums.\nPartition nums into two arrays, nums1 and nums2, such that:\n\nEach element of the array nums belongs to either t... | {
"do_sample": false,
"max_new_tokens": 32768,
"seed": 0,
"temperature": 0.7
} | 0 | 43 | LiveCodeBench | {
"expected_answer": "",
"problem_id": "",
"reference_solution": ""
} | <|begin_of_thought|>
Okay, let's see. I need to find a way to split the array into two non-empty parts such that the value of the partition, which is the absolute difference between the maximum of one part and the minimum of the other, is minimized. Hmm.
First, I remember that to minimize |max(nums1) - min(nums2)|, w... |
[
{
"content": "Generate an executable Python function generated from the given prompt. Return the function body without invoking it at the final solution.You are given a 0-indexed array words consisting of distinct strings.\nThe string words[i] can be paired with the string words[j] if:\n\nThe string words[i] is... | {
"do_sample": false,
"max_new_tokens": 32768,
"seed": 0,
"temperature": 0.7
} | 0 | 44 | LiveCodeBench | {
"expected_answer": "",
"problem_id": "",
"reference_solution": ""
} | <|begin_of_thought|>
Okay, let's see. I need to find the maximum number of pairs in the words array where each pair consists of a string and its reversed version. And each string can be used in at most one pair. Hmm.
First, let's understand the problem. For each word in the array, I check if there's another word that... |
[
{
"content": "Generate an executable Python function generated from the given prompt. Return the function body without invoking it at the final solution.You are given a 0-indexed integer array nums containing n distinct positive integers. A permutation of nums is called special if:\n\nFor all indexes 0 <= i < n... | {
"do_sample": false,
"max_new_tokens": 32768,
"seed": 0,
"temperature": 0.7
} | 0 | 45 | LiveCodeBench | {
"expected_answer": "",
"problem_id": "",
"reference_solution": ""
} | <|begin_of_thought|>
Okay, let's see. I need to find the number of special permutations of the given array. The definition is that for all consecutive elements in the permutation, one divides the other. So for each pair of consecutive elements, either the first divides the second or vice versa. And the permutation has... |
[
{
"content": "Generate an executable Python function generated from the given prompt. Return the function body without invoking it at the final solution.The imbalance number of a 0-indexed integer array arr of length n is defined as the number of indices in sarr = sorted(arr) such that:\n\n0 <= i < n - 1, and\n... | {
"do_sample": false,
"max_new_tokens": 32768,
"seed": 0,
"temperature": 0.7
} | 0 | 46 | LiveCodeBench | {
"expected_answer": "",
"problem_id": "",
"reference_solution": ""
} | <|begin_of_thought|>
Okay, let's try to understand this problem. So, the task is to compute the sum of imbalance numbers for all subarrays of a given array. Hmm. Let me first make sure I understand what an imbalance number is.
The imbalance number of a subarray is the count of indices i (where 0 <= i < n-1) such that... |
[
{
"content": "Generate an executable Python function generated from the given prompt. Return the function body without invoking it at the final solution.You are given three integers x, y, and z.\nYou have x strings equal to \"AA\", y strings equal to \"BB\", and z strings equal to \"AB\". You want to choose som... | {
"do_sample": false,
"max_new_tokens": 32768,
"seed": 0,
"temperature": 0.7
} | 0 | 47 | LiveCodeBench | {
"expected_answer": "",
"problem_id": "",
"reference_solution": ""
} | <|begin_of_thought|>
Okay, let's see. I need to find the maximum possible length of a concatenated string formed by some number of "AA", "BB", and "AB" strings, such that the resulting string doesn't have "AAA" or "BBB" as a substring. Hmm.
First, I should think about how these strings can be combined without creatin... |
[
{
"content": "Generate an executable Python function generated from the given prompt. Return the function body without invoking it at the final solution.You are given a 0-indexed array words containing n strings.\nLet's define a join operation join(x, y) between two strings x and y as concatenating them into xy... | {
"do_sample": false,
"max_new_tokens": 32768,
"seed": 0,
"temperature": 0.7
} | 0 | 48 | LiveCodeBench | {
"expected_answer": "",
"problem_id": "",
"reference_solution": ""
} | <|begin_of_thought|>
Okay, let's see. I need to find the minimum possible length of the final string after joining all the words in order using the given join operation. The join operation either appends two strings directly or merges them if the last character of the first and the first character of the second are th... |
[
{
"content": "Generate an executable Python function generated from the given prompt. Return the function body without invoking it at the final solution.You are given a 0-indexed array nums of n integers and an integer target.\nYou are initially positioned at index 0. In one step, you can jump from index i to a... | {
"do_sample": false,
"max_new_tokens": 32768,
"seed": 0,
"temperature": 0.7
} | 0 | 49 | LiveCodeBench | {
"expected_answer": "",
"problem_id": "",
"reference_solution": ""
} | <|begin_of_thought|>
Okay, let's see. I need to find the maximum number of jumps from index 0 to the last index in the array, given certain constraints on the jumps. The constraints are that each jump must be from i to j where i < j and the difference between nums[j] and nums[i] is within the target. If there's no way... |
[
{
"content": "Generate an executable Python function generated from the given prompt. Return the function body without invoking it at the final solution.You are given an array nums consisting of positive integers.\nWe call a subarray of an array complete if the following condition is satisfied:\n\nThe number of... | {
"do_sample": false,
"max_new_tokens": 32768,
"seed": 0,
"temperature": 0.7
} | 0 | 50 | LiveCodeBench | {
"expected_answer": "",
"problem_id": "",
"reference_solution": ""
} | <|begin_of_thought|>
Okay, let's see. I need to find the number of complete subarrays in a given array. A complete subarray is one where the number of distinct elements is equal to the total number of distinct elements in the original array. Hmm.
So the first thing I should do is figure out the total number of distin... |
[
{
"content": "Generate an executable Python function generated from the given prompt. Return the function body without invoking it at the final solution.A truck has two fuel tanks. You are given two integers, mainTank representing the fuel present in the main tank in liters and additionalTank representing the f... | {
"do_sample": false,
"max_new_tokens": 32768,
"seed": 0,
"temperature": 0.7
} | 0 | 51 | LiveCodeBench | {
"expected_answer": "",
"problem_id": "",
"reference_solution": ""
} | <|begin_of_thought|>
Okay, let's see. I need to solve this problem where a truck has two fuel tanks, and I have to calculate the maximum distance it can travel based on the given rules. Hmm. Let's read the problem statement again carefully.
So, the main tank has mainTank liters, and the additional tank has additional... |
[
{
"content": "Generate an executable Python function generated from the given prompt. Return the function body without invoking it at the final solution.You are given a 0-indexed integer array nums and an integer threshold.\nFind the length of the longest subarray of nums starting at index l and ending at index... | {
"do_sample": false,
"max_new_tokens": 32768,
"seed": 0,
"temperature": 0.7
} | 0 | 52 | LiveCodeBench | {
"expected_answer": "",
"problem_id": "",
"reference_solution": ""
} | <|begin_of_thought|>
Okay, let's see. I need to find the longest subarray starting at index l where nums[l] is even. Then, for all the elements from l to r-1, each consecutive pair must alternate between even and odd. Also, all elements in the subarray must be <= the threshold. Hmm.
So the problem has three condition... |
[
{
"content": "Generate an executable Python function generated from the given prompt. Return the function body without invoking it at the final solution.You are given a binary array nums.\nA subarray of an array is good if it contains exactly one element with the value 1.\nReturn an integer denoting the number ... | {
"do_sample": false,
"max_new_tokens": 32768,
"seed": 0,
"temperature": 0.7
} | 0 | 53 | LiveCodeBench | {
"expected_answer": "",
"problem_id": "",
"reference_solution": ""
} | <|begin_of_thought|>
Okay, let's see. I need to find the number of ways to split the binary array into good subarrays. A good subarray has exactly one 1. So each split must consist of these good subarrays, and the entire array must be covered. Hmm.
First, let's understand the examples. In example 1, the array is [0,1... |
[
{
"content": "Generate an executable Python function generated from the given prompt. Return the function body without invoking it at the final solution.You are given a 0-indexed integer array nums. A subarray of nums is called continuous if:\n\nLet i, i + 1, ..., j_ be the indices in the subarray. Then, for ea... | {
"do_sample": false,
"max_new_tokens": 32768,
"seed": 0,
"temperature": 0.7
} | 0 | 54 | LiveCodeBench | {
"expected_answer": "",
"problem_id": "",
"reference_solution": ""
} | <|begin_of_thought|>
Okay, let's see. I need to find the number of continuous subarrays in a given array where the absolute difference between any two elements in the subarray is at most 2. Hmm. So for each possible subarray, I have to check all pairs of elements to see if they satisfy |nums[i] - nums[j]| <= 2. But wa... |
[
{
"content": "Generate an executable Python function generated from the given prompt. Return the function body without invoking it at the final solution.You are given two 0-indexed integer arrays nums1 and nums2 of length n.\nLet's define another 0-indexed integer array, nums3, of length n. For each index i in ... | {
"do_sample": false,
"max_new_tokens": 32768,
"seed": 0,
"temperature": 0.7
} | 0 | 55 | LiveCodeBench | {
"expected_answer": "",
"problem_id": "",
"reference_solution": ""
} | <|begin_of_thought|>
Okay, let's see. I need to find the maximum length of a non-decreasing subarray in nums3, which is constructed by choosing each element from either nums1 or nums2. Hmm. The problem says that for each index i, we can pick either nums1[i] or nums2[i], and then form nums3. The goal is to choose these... |
[
{
"content": "Generate an executable Python function generated from the given prompt. Return the function body without invoking it at the final solution.You are given a 0-indexed integer array nums. A subarray s of length m is called alternating if:\n\nm is greater than 1.\ns_1 = s_0 + 1.\nThe 0-indexed subarra... | {
"do_sample": false,
"max_new_tokens": 32768,
"seed": 0,
"temperature": 0.7
} | 0 | 56 | LiveCodeBench | {
"expected_answer": "",
"problem_id": "",
"reference_solution": ""
} | <|begin_of_thought|>
Okay, let's see. I need to find the maximum length of an alternating subarray in the given array. The subarray has to be of length greater than 1. The pattern alternates between increasing and decreasing. So like, the first step is up, then down, then up again, and so on. But wait, the problem sta... |
[
{
"content": "Generate an executable Python function generated from the given prompt. Return the function body without invoking it at the final solution.You are given a 0-indexed array nums consisting of positive integers.\nYou can do the following operation on the array any number of times:\n\nChoose an intege... | {
"do_sample": false,
"max_new_tokens": 32768,
"seed": 0,
"temperature": 0.7
} | 0 | 57 | LiveCodeBench | {
"expected_answer": "",
"problem_id": "",
"reference_solution": ""
} | <|begin_of_thought|>
Okay, let's see. I need to find the largest possible element in the array after performing any number of operations. The operation allows me to choose an index i where nums[i] is less than or equal to nums[i+1], then replace nums[i+1] with the sum of nums[i] and nums[i+1], and delete nums[i]. So t... |
[
{
"content": "Generate an executable Python function generated from the given prompt. Return the function body without invoking it at the final solution.You are given an integer n. We say that two integers x and y form a prime number pair if:\n\n1 <= x <= y <= n\nx + y == n\nx and y are prime numbers\n\nReturn ... | {
"do_sample": false,
"max_new_tokens": 32768,
"seed": 0,
"temperature": 0.7
} | 0 | 58 | LiveCodeBench | {
"expected_answer": "",
"problem_id": "",
"reference_solution": ""
} | <|begin_of_thought|>
Okay, let's see. I need to find all prime pairs (x, y) where x + y = n, x <= y, and both are primes. The output should be a sorted list of these pairs, sorted by x in increasing order. If there are none, return an empty list. Hmm.
First, I need to generate all primes up to n. Because x and y are ... |
[
{
"content": "Generate an executable Python function generated from the given prompt. Return the function body without invoking it at the final solution.There are n employees in a company, numbered from 0 to n - 1. Each employee i has worked for hours[i] hours in the company.\nThe company requires each employee... | {
"do_sample": false,
"max_new_tokens": 32768,
"seed": 0,
"temperature": 0.7
} | 0 | 59 | LiveCodeBench | {
"expected_answer": "",
"problem_id": "",
"reference_solution": ""
} | <|begin_of_thought|>
Okay, let's see. I need to write a Python function that counts how many employees have worked at least the target hours. The input is an array of hours each employee has worked, and the target. The output is the number of employees meeting or exceeding the target.
Hmm, so the first thing I should... |
[
{
"content": "Generate an executable Python function generated from the given prompt. Return the function body without invoking it at the final solution.Given three strings a, b, and c, your task is to find a string that has the minimum length and contains all three strings as substrings.\nIf there are multiple... | {
"do_sample": false,
"max_new_tokens": 32768,
"seed": 0,
"temperature": 0.7
} | 0 | 60 | LiveCodeBench | {
"expected_answer": "",
"problem_id": "",
"reference_solution": ""
} | <|begin_of_thought|>
Okay, let's see. I need to find a string that contains all three given strings a, b, and c as substrings. And the result should be the shortest possible, and if there are multiple options with the same length, pick the lex smallest one. Hmm.
So first, the problem is similar to merging three strin... |
[
{
"content": "Generate an executable Python function generated from the given prompt. Return the function body without invoking it at the final solution.You are given a 0-indexed integer array nums and a positive integer k.\nYou can apply the following operation on the array any number of times:\n\nChoose any s... | {
"do_sample": false,
"max_new_tokens": 32768,
"seed": 0,
"temperature": 0.7
} | 0 | 61 | LiveCodeBench | {
"expected_answer": "",
"problem_id": "",
"reference_solution": ""
} | <|begin_of_thought|>
Okay, let's see. I need to determine if it's possible to make all elements of the array zero by repeatedly subtracting 1 from any subarray of length k. Hmm. So the problem is about applying these operations optimally to reach all zeros.
First, let's think about what each operation does. Each ope... |
[
{
"content": "Generate an executable Python function generated from the given prompt. Return the function body without invoking it at the final solution.Given a string s and an integer k, partition s into k substrings such that the sum of the number of letter changes required to turn each substring into a semi-... | {
"do_sample": false,
"max_new_tokens": 32768,
"seed": 0,
"temperature": 0.7
} | 0 | 62 | LiveCodeBench | {
"expected_answer": "",
"problem_id": "",
"reference_solution": ""
} | <|begin_of_thought|>
Okay, let's try to understand this problem. So, the task is to partition a string into k substrings such that the sum of the number of changes needed for each substring to become a semi-palindrome is minimized. Hmm, right. And we need to find the minimal total changes.
First, I need to understand... |
[
{
"content": "Generate an executable Python function generated from the given prompt. Return the function body without invoking it at the final solution.Given an array of strings words and a character separator, split each string in words by separator.\nReturn an array of strings containing the new strings form... | {
"do_sample": false,
"max_new_tokens": 32768,
"seed": 0,
"temperature": 0.7
} | 0 | 63 | LiveCodeBench | {
"expected_answer": "",
"problem_id": "",
"reference_solution": ""
} | <|begin_of_thought|>
Okay, let's see. I need to solve this problem where I have to split each string in the words array using a separator and then return all the non-empty parts in order. Hmm. So the main steps are: iterate through each word in the input list, split each by the separator, then collect all the non-empt... |
[
{
"content": "Generate an executable Python function generated from the given prompt. Return the function body without invoking it at the final solution.Given two positive integers n and x.\nReturn the number of ways n can be expressed as the sum of the x^th power of unique positive integers, in other words, th... | {
"do_sample": false,
"max_new_tokens": 32768,
"seed": 0,
"temperature": 0.7
} | 0 | 64 | LiveCodeBench | {
"expected_answer": "",
"problem_id": "",
"reference_solution": ""
} | <|begin_of_thought|>
Okay, let's see. I need to find the number of ways to express a given number n as the sum of x-th powers of unique positive integers. Hmm. So for each possible subset of integers, I calculate their x-th powers, sum them up, and check if it equals n. But since the numbers have to be unique, I can't... |
[
{
"content": "Generate an executable Python function generated from the given prompt. Return the function body without invoking it at the final solution.Given a binary string s, partition the string into one or more substrings such that each substring is beautiful.\nA string is beautiful if:\n\nIt doesn't conta... | {
"do_sample": false,
"max_new_tokens": 32768,
"seed": 0,
"temperature": 0.7
} | 0 | 65 | LiveCodeBench | {
"expected_answer": "",
"problem_id": "",
"reference_solution": ""
} | <|begin_of_thought|>
Okay, let's see. I need to solve this problem where I have to partition a binary string into the minimum number of beautiful substrings. A beautiful substring is one that doesn't have leading zeros and is the binary representation of a power of 5. If it's impossible, return -1. Hmm.
First, I need... |
[
{
"content": "Generate an executable Python function generated from the given prompt. Return the function body without invoking it at the final solution.You are given a string word and an array of strings forbidden.\nA string is called valid if none of its substrings are present in forbidden.\nReturn the length... | {
"do_sample": false,
"max_new_tokens": 32768,
"seed": 0,
"temperature": 0.7
} | 0 | 66 | LiveCodeBench | {
"expected_answer": "",
"problem_id": "",
"reference_solution": ""
} | <|begin_of_thought|>
Okay, let's see. I need to find the longest valid substring in the given word where none of its substrings are in the forbidden list. Hmm. So the valid substring can't have any of the forbidden strings as any of its substrings. And the forbidden array can be very large, up to 1e5 elements. So I ne... |
[
{
"content": "Generate an executable Python function generated from the given prompt. Return the function body without invoking it at the final solution.Your laptop keyboard is faulty, and whenever you type a character 'i' on it, it reverses the string that you have written. Typing other characters works as exp... | {
"do_sample": false,
"max_new_tokens": 32768,
"seed": 0,
"temperature": 0.7
} | 0 | 67 | LiveCodeBench | {
"expected_answer": "",
"problem_id": "",
"reference_solution": ""
} | <|begin_of_thought|>
Okay, let's see. I need to solve this problem where each character typed on the keyboard either adds to the string or reverses it if it's an 'i'. Hmm. So the main idea is that whenever I encounter an 'i', the current string gets reversed. Otherwise, I just append the character. Wait, but the examp... |
[
{
"content": "Generate an executable Python function generated from the given prompt. Return the function body without invoking it at the final solution.Given a 0-indexed string s, permute s to get a new string t such that:\n\nAll consonants remain in their original places. More formally, if there is an index i... | {
"do_sample": false,
"max_new_tokens": 32768,
"seed": 0,
"temperature": 0.7
} | 0 | 68 | LiveCodeBench | {
"expected_answer": "",
"problem_id": "",
"reference_solution": ""
} | <|begin_of_thought|>
Okay, let's see. I need to solve this problem where I have to permute a string such that consonants stay in their original positions, and vowels are sorted in non-decreasing order of their ASCII values. Hmm.
First, I need to figure out which characters are vowels. The vowels are a, e, i, o, u and... |
[
{
"content": "Generate an executable Python function generated from the given prompt. Return the function body without invoking it at the final solution.An element x of an integer array arr of length m is dominant if freq(x) * 2 > m, where freq(x) is the number of occurrences of x in arr. Note that this definit... | {
"do_sample": false,
"max_new_tokens": 32768,
"seed": 0,
"temperature": 0.7
} | 0 | 69 | LiveCodeBench | {
"expected_answer": "",
"problem_id": "",
"reference_solution": ""
} | <|begin_of_thought|>
Okay, let's see. I need to find the minimum index i where splitting the array at i gives two subarrays each with the same dominant element as the original array. Hmm. So first, I need to figure out what the dominant element of the original array is. Since the problem states there's exactly one dom... |
[
{
"content": "Generate an executable Python function generated from the given prompt. Return the function body without invoking it at the final solution.You are given a 0-indexed array nums and a non-negative integer k.\nIn one operation, you can do the following:\n\nChoose an index i that hasn't been chosen be... | {
"do_sample": false,
"max_new_tokens": 32768,
"seed": 0,
"temperature": 0.7
} | 0 | 70 | LiveCodeBench | {
"expected_answer": "",
"problem_id": "",
"reference_solution": ""
} | <|begin_of_thought|>
Okay, let's try to figure out this problem. So the task is to find the maximum possible beauty of an array after performing a certain number of operations. The operations allow us to choose an index and replace its value with any number in the range [nums[i] - k, nums[i] + k], but each index can b... |
[
{
"content": "Generate an executable Python function generated from the given prompt. Return the function body without invoking it at the final solution.You are given an integer array nums. We consider an array good if it is a permutation of an array base[n].\nbase[n] = [1, 2, ..., n - 1, n, n] (in other words,... | {
"do_sample": false,
"max_new_tokens": 32768,
"seed": 0,
"temperature": 0.7
} | 0 | 71 | LiveCodeBench | {
"expected_answer": "",
"problem_id": "",
"reference_solution": ""
} | <|begin_of_thought|>
Okay, let's see. I need to determine if a given array is a permutation of the base array. The base array for a given n is [1, 2, ..., n-1, n, n]. So the array must have exactly n elements, right? Because the base array has length n+1. Wait, no. Wait, the base array for n is of length n+1. So for e... |
[
{
"content": "Generate an executable Python function generated from the given prompt. Return the function body without invoking it at the final solution.You are given a 0-indexed integer array nums and a positive integer x.\nYou are initially at position 0 in the array and you can visit other positions accordin... | {
"do_sample": false,
"max_new_tokens": 32768,
"seed": 0,
"temperature": 0.7
} | 0 | 72 | LiveCodeBench | {
"expected_answer": "",
"problem_id": "",
"reference_solution": ""
} | <|begin_of_thought|>
Okay, let's see. I need to find the maximum total score by visiting positions in the array according to the given rules. The problem says that each time you move from i to j where j > i, if the parities of nums[i] and nums[j] are different, you lose x. The initial score is nums[0], and then each v... |
[
{
"content": "Generate an executable Python function generated from the given prompt. Return the function body without invoking it at the final solution.You are given a 0-indexed integer array nums. You have to find the maximum sum of a pair of numbers from nums such that the maximum digit in both numbers are e... | {
"do_sample": false,
"max_new_tokens": 32768,
"seed": 0,
"temperature": 0.7
} | 0 | 73 | LiveCodeBench | {
"expected_answer": "",
"problem_id": "",
"reference_solution": ""
} | <|begin_of_thought|>
Okay, let's see. I need to find the maximum sum of a pair in the array such that both numbers have the same maximum digit. Hmm. So the first thing is to figure out for each number in the array, what's the maximum digit it has. Then, we need to find pairs of numbers that have the same maximum digit... |
[
{
"content": "Generate an executable Python function generated from the given prompt. Return the function body without invoking it at the final solution.You are given a 0-indexed integer array nums, an integer modulo, and an integer k.\nYour task is to find the count of subarrays that are interesting.\nA subarr... | {
"do_sample": false,
"max_new_tokens": 32768,
"seed": 0,
"temperature": 0.7
} | 0 | 74 | LiveCodeBench | {
"expected_answer": "",
"problem_id": "",
"reference_solution": ""
} | <|begin_of_thought|>
Okay, let's try to figure out how to solve this problem. So the task is to find the number of interesting subarrays in the given array. An interesting subarray is one where the count of elements that satisfy nums[i] % modulo == k is congruent to k modulo modulo. Hmm, that's a bit tricky. Let me br... |
[
{
"content": "Generate an executable Python function generated from the given prompt. Return the function body without invoking it at the final solution.You are given an array nums of length n and an integer m. You need to determine if it is possible to split the array into n non-empty arrays by performing a se... | {
"do_sample": false,
"max_new_tokens": 32768,
"seed": 0,
"temperature": 0.7
} | 0 | 75 | LiveCodeBench | {
"expected_answer": "",
"problem_id": "",
"reference_solution": ""
} | <|begin_of_thought|>
Okay, let's try to figure out this problem. So the task is to determine if we can split the given array into n non-empty subarrays by splitting steps. Each split must satisfy certain conditions. Hmm.
First, let's understand the problem. The initial array is of length n. We need to split it into n... |
[
{
"content": "Generate an executable Python function generated from the given prompt. Return the function body without invoking it at the final solution.Given a 0-indexed integer array nums of length n and an integer target, return the number of pairs (i, j) where 0 <= i < j < n and nums[i] + nums[j] < target.\... | {
"do_sample": false,
"max_new_tokens": 32768,
"seed": 0,
"temperature": 0.7
} | 0 | 76 | LiveCodeBench | {
"expected_answer": "",
"problem_id": "",
"reference_solution": ""
} | <|begin_of_thought|>
Okay, let's see. I need to find the number of pairs (i, j) where i < j and nums[i] + nums[j] is less than the target. Hmm. So the straightforward approach would be to check all possible pairs and count those that meet the condition. But wait, what's the time complexity here? For a list of n elemen... |
[
{
"content": "Generate an executable Python function generated from the given prompt. Return the function body without invoking it at the final solution.You are given a 0-indexed array usageLimits of length n.\nYour task is to create groups using numbers from 0 to n - 1, ensuring that each number, i, is used no... | {
"do_sample": false,
"max_new_tokens": 32768,
"seed": 0,
"temperature": 0.7
} | 0 | 77 | LiveCodeBench | {
"expected_answer": "",
"problem_id": "",
"reference_solution": ""
} | <|begin_of_thought|>
Okay, let's try to figure out how to solve this problem. So the task is to create the maximum number of groups such that each group has distinct numbers, and each subsequent group is longer than the previous one. Also, each number can't be used more than its usage limit. Hmm.
First, I need to und... |
[
{
"content": "Generate an executable Python function generated from the given prompt. Return the function body without invoking it at the final solution.You are given a 0-indexed array nums containing n integers.\nAt each second, you perform the following operation on the array:\n\nFor every index i in the rang... | {
"do_sample": false,
"max_new_tokens": 32768,
"seed": 0,
"temperature": 0.7
} | 0 | 78 | LiveCodeBench | {
"expected_answer": "",
"problem_id": "",
"reference_solution": ""
} | <|begin_of_thought|>
Okay, let's try to figure out this problem. So the task is to find the minimum number of seconds needed to make all elements in the array equal, given that each second, every element can be replaced with its current value, the left neighbor, or the right neighbor. All replacements happen at the sa... |
[
{
"content": "Generate an executable Python function generated from the given prompt. Return the function body without invoking it at the final solution.Given two positive integers low and high represented as strings, find the count of stepping numbers in the inclusive range [low, high].\nA stepping number is a... | {
"do_sample": false,
"max_new_tokens": 32768,
"seed": 0,
"temperature": 0.7
} | 0 | 79 | LiveCodeBench | {
"expected_answer": "",
"problem_id": "",
"reference_solution": ""
} | <|begin_of_thought|>
Okay, let's see. I need to find the count of stepping numbers between two given strings, low and high. Stepping numbers are those where each adjacent digit differs by exactly 1. And the answer has to be modulo 1e9+7. Hmm.
First, the problem says that low and high can be up to 100 digits long. Oh ... |
[
{
"content": "Generate an executable Python function generated from the given prompt. Return the function body without invoking it at the final solution.You are given two 0-indexed integer arrays nums1 and nums2 of equal length. Every second, for all indices 0 <= i < nums1.length, value of nums1[i] is increment... | {
"do_sample": false,
"max_new_tokens": 32768,
"seed": 0,
"temperature": 0.7
} | 0 | 80 | LiveCodeBench | {
"expected_answer": "",
"problem_id": "",
"reference_solution": ""
} | <|begin_of_thought|>
Okay, let's try to understand this problem. So, we have two arrays, nums1 and nums2, both of the same length. Every second, each element in nums1 is increased by the corresponding element in nums2. Then, we can choose to set any element in nums1 to zero. We need to find the minimum number of secon... |
[
{
"content": "Generate an executable Python function generated from the given prompt. Return the function body without invoking it at the final solution.You are given a 2D integer array coordinates and an integer k, where coordinates[i] = [x_i, y_i] are the coordinates of the i^th point in a 2D plane.\nWe defin... | {
"do_sample": false,
"max_new_tokens": 32768,
"seed": 0,
"temperature": 0.7
} | 0 | 81 | LiveCodeBench | {
"expected_answer": "",
"problem_id": "",
"reference_solution": ""
} | <|begin_of_thought|>
Okay, let's see. I need to find the number of pairs (i, j) where i < j and the XOR-based distance between the two points is exactly k. Hmm. The distance is defined as (x1 XOR x2) + (y1 XOR y2). So for each pair, I have to compute that sum and check if it equals k. But the problem is that the coord... |
[
{
"content": "Generate an executable Python function generated from the given prompt. Return the function body without invoking it at the final solution.You are given an integer array nums and two positive integers m and k.\nReturn the maximum sum out of all almost unique subarrays of length k of nums. If no su... | {
"do_sample": false,
"max_new_tokens": 32768,
"seed": 0,
"temperature": 0.7
} | 0 | 82 | LiveCodeBench | {
"expected_answer": "",
"problem_id": "",
"reference_solution": ""
} | <|begin_of_thought|>
Okay, let's see. I need to find the maximum sum of almost unique subarrays of length k. An almost unique subarray here is one that has at least m distinct elements. So the problem is, for each possible subarray of length k, check if it has at least m distinct elements. If yes, calculate its sum an... |
[
{
"content": "Generate an executable Python function generated from the given prompt. Return the function body without invoking it at the final solution.Initially, you have a bank account balance of 100 dollars.\nYou are given an integer purchaseAmount representing the amount you will spend on a purchase in dol... | {
"do_sample": false,
"max_new_tokens": 32768,
"seed": 0,
"temperature": 0.7
} | 0 | 83 | LiveCodeBench | {
"expected_answer": "",
"problem_id": "",
"reference_solution": ""
} | <|begin_of_thought|>
Okay, let's see. I need to solve this problem where I have to calculate the remaining balance after a purchase. The key part here is figuring out the rounded amount correctly. Let's break down the problem step by step.
So, the initial balance is 100 dollars. The purchase amount given might not be... |
[
{
"content": "Generate an executable Python function generated from the given prompt. Return the function body without invoking it at the final solution.Given an array of strings words and a string s, determine if s is an acronym of words.\nThe string s is considered an acronym of words if it can be formed by c... | {
"do_sample": false,
"max_new_tokens": 32768,
"seed": 0,
"temperature": 0.7
} | 0 | 84 | LiveCodeBench | {
"expected_answer": "",
"problem_id": "",
"reference_solution": ""
} | <|begin_of_thought|>
Okay, let's see. I need to write a Python function that checks if a given string s is an acronym formed by the first characters of each word in the words array. Hmm, right. So the steps here are probably: first, check the lengths. Because the acronym's length has to match s's length. If not, retur... |
[
{
"content": "Generate an executable Python function generated from the given prompt. Return the function body without invoking it at the final solution.You are given an integer n representing the number of houses on a number line, numbered from 0 to n - 1.\nAdditionally, you are given a 2D integer array offers... | {
"do_sample": false,
"max_new_tokens": 32768,
"seed": 0,
"temperature": 0.7
} | 0 | 85 | LiveCodeBench | {
"expected_answer": "",
"problem_id": "",
"reference_solution": ""
} | <|begin_of_thought|>
Okay, let's see. I need to find the maximum gold I can get by selecting non-overlapping offers. Hmm. So the problem is similar to the classic interval scheduling problem where you select non-overlapping intervals to maximize profit. But in this case, the offers can be selected in any order as long... |
[
{
"content": "Generate an executable Python function generated from the given prompt. Return the function body without invoking it at the final solution.You are given two positive integers low and high.\nAn integer x consisting of 2 * n digits is symmetric if the sum of the first n digits of x is equal to the s... | {
"do_sample": false,
"max_new_tokens": 32768,
"seed": 0,
"temperature": 0.7
} | 0 | 86 | LiveCodeBench | {
"expected_answer": "",
"problem_id": "",
"reference_solution": ""
} | <|begin_of_thought|>
Okay, let's see. I need to find the number of symmetric integers between low and high, inclusive. A symmetric integer has 2n digits, right? So like 2, 4, 6 digits, etc. And the sum of the first n digits must equal the sum of the last n digits.
Hmm. So first, I should figure out for each number i... |
[
{
"content": "Generate an executable Python function generated from the given prompt. Return the function body without invoking it at the final solution.You are given two strings s1 and s2, both of length 4, consisting of lowercase English letters.\nYou can apply the following operation on any of the two string... | {
"do_sample": false,
"max_new_tokens": 32768,
"seed": 0,
"temperature": 0.7
} | 0 | 87 | LiveCodeBench | {
"expected_answer": "",
"problem_id": "",
"reference_solution": ""
} | <|begin_of_thought|>
Okay, let's see. I need to determine if two 4-character strings can be made equal using a specific swap operation. The operation allows swapping any two characters that are two positions apart. So, for a string like "abcd", the possible swaps are between 0 and 2, or 1 and 3. Each swap can be done ... |
[
{
"content": "Generate an executable Python function generated from the given prompt. Return the function body without invoking it at the final solution.You are given a 0-indexed integer array nums and an integer x.\nFind the minimum absolute difference between two elements in the array that are at least x indi... | {
"do_sample": false,
"max_new_tokens": 32768,
"seed": 0,
"temperature": 0.7
} | 0 | 88 | LiveCodeBench | {
"expected_answer": "",
"problem_id": "",
"reference_solution": ""
} | <|begin_of_thought|>
Okay, let's see. I need to find the minimum absolute difference between two elements in the array that are at least x indices apart. Hmm. So, the problem is to find two indices i and j where the absolute difference between i and j is >= x, and the absolute difference between nums[i] and nums[j] is... |
[
{
"content": "Generate an executable Python function generated from the given prompt. Return the function body without invoking it at the final solution.You are given positive integers low, high, and k.\nA number is beautiful if it meets both of the following conditions:\n\nThe count of even digits in the numbe... | {
"do_sample": false,
"max_new_tokens": 32768,
"seed": 0,
"temperature": 0.7
} | 0 | 89 | LiveCodeBench | {
"expected_answer": "",
"problem_id": "",
"reference_solution": ""
} | <|begin_of_thought|>
Okay, let's see. I need to find the number of beautiful integers between low and high, inclusive. A beautiful number has two conditions: the count of even digits equals the count of odd digits, and it's divisible by k. Hmm.
First, how do I approach this? The constraints mention that numbers can b... |
[
{
"content": "Generate an executable Python function generated from the given prompt. Return the function body without invoking it at the final solution.You are given two 0-indexed strings str1 and str2.\nIn an operation, you select a set of indices in str1, and for each index i in the set, increment str1[i] to... | {
"do_sample": false,
"max_new_tokens": 32768,
"seed": 0,
"temperature": 0.7
} | 0 | 90 | LiveCodeBench | {
"expected_answer": "",
"problem_id": "",
"reference_solution": ""
} | <|begin_of_thought|>
Okay, let's see. I need to determine if str2 can be made a subsequence of str1 after performing at most one cyclic increment operation on str1. Hmm. So, the operation allows selecting a set of indices in str1 and increment each selected character cyclically. Then, check if str2 is a subsequence of... |
[
{
"content": "Generate an executable Python function generated from the given prompt. Return the function body without invoking it at the final solution.You are given a string moves of length n consisting only of characters 'L', 'R', and '_'. The string represents your movement on a number line starting from th... | {
"do_sample": false,
"max_new_tokens": 32768,
"seed": 0,
"temperature": 0.7
} | 0 | 91 | LiveCodeBench | {
"expected_answer": "",
"problem_id": "",
"reference_solution": ""
} | <|begin_of_thought|>
Okay, let's see. I need to find the furthest point from the origin after making all the moves in a string. The moves can be 'L', 'R', or '_'. For each move, I can choose to go left or right, but the '_' allows me to choose either. The goal is to maximize the distance from the origin after n moves.... |
[
{
"content": "Generate an executable Python function generated from the given prompt. Return the function body without invoking it at the final solution.You are given two strings s and t of equal length n. You can perform the following operation on the string s:\n\nRemove a suffix of s of length l where 0 < l <... | {
"do_sample": false,
"max_new_tokens": 32768,
"seed": 0,
"temperature": 0.7
} | 0 | 92 | LiveCodeBench | {
"expected_answer": "",
"problem_id": "",
"reference_solution": ""
} | <|begin_of_thought|>
Okay, let's try to understand this problem. So, the task is to find the number of ways to transform string s into t using exactly k operations, where each operation is rotating a suffix of s to the front. The answer needs to be modulo 1e9+7.
Hmm. Let's start by breaking down the problem. Each ope... |
[
{
"content": "Generate an executable Python function generated from the given prompt. Return the function body without invoking it at the final solution.You are given a 0-indexed array nums consisting of non-negative powers of 2, and an integer target.\nIn one operation, you must apply the following changes to ... | {
"do_sample": false,
"max_new_tokens": 32768,
"seed": 0,
"temperature": 0.7
} | 0 | 93 | LiveCodeBench | {
"expected_answer": "",
"problem_id": "",
"reference_solution": ""
} | <|begin_of_thought|>
Okay, let's try to understand this problem. So, the task is to find the minimum number of operations needed to perform on a given array of non-negative powers of two so that there exists a subsequence whose sum equals the target. Each operation allows us to split a number greater than 1 into two h... |
[
{
"content": "Generate an executable Python function generated from the given prompt. Return the function body without invoking it at the final solution.Given a 0-indexed 2D integer matrix grid of size n * m, we define a 0-indexed 2D matrix p of size n * m as the product matrix of grid if the following conditio... | {
"do_sample": false,
"max_new_tokens": 32768,
"seed": 0,
"temperature": 0.7
} | 0 | 94 | LiveCodeBench | {
"expected_answer": "",
"problem_id": "",
"reference_solution": ""
} | <|begin_of_thought|>
Okay, let's see. I need to find a way to compute the product matrix where each element is the product of all elements except the current one, modulo 12345. Hmm. The constraints are tight, especially since the grid can be up to 1e5 elements. So a naive approach of calculating the product for each e... |
[
{
"content": "Generate an executable Python function generated from the given prompt. Return the function body without invoking it at the final solution.You are given a 0-indexed integer array receiver of length n and an integer k.\nThere are n players having a unique id in the range [0, n - 1] who will play a ... | {
"do_sample": false,
"max_new_tokens": 32768,
"seed": 0,
"temperature": 0.7
} | 0 | 95 | LiveCodeBench | {
"expected_answer": "",
"problem_id": "",
"reference_solution": ""
} | <|begin_of_thought|>
Okay, let's see. I need to find the maximum value of the function f(x) for a given receiver array and k passes. The function f(x) is the sum of x plus all the receivers after each pass, up to k passes. Hmm. So for each starting player x, we simulate k passes and add up all the receiver IDs along t... |
[
{
"content": "Generate an executable Python function generated from the given prompt. Return the function body without invoking it at the final solution.You are given two 0-indexed binary strings s1 and s2, both of length n, and a positive integer x.\nYou can perform any of the following operations on the strin... | {
"do_sample": false,
"max_new_tokens": 32768,
"seed": 0,
"temperature": 0.7
} | 0 | 96 | LiveCodeBench | {
"expected_answer": "",
"problem_id": "",
"reference_solution": ""
} | <|begin_of_thought|>
Okay, let's try to figure out how to solve this problem. So, the task is to find the minimum cost to make two binary strings s1 and s2 equal using certain operations. If it's impossible, return -1. The operations allowed are flipping two adjacent characters (cost 1) or flipping two arbitrary chara... |
[
{
"content": "Generate an executable Python function generated from the given prompt. Return the function body without invoking it at the final solution.You are given a 0-indexed 2D integer array nums representing the coordinates of the cars parking on a number line. For any index i, nums[i] = [start_i, end_i] ... | {
"do_sample": false,
"max_new_tokens": 32768,
"seed": 0,
"temperature": 0.7
} | 0 | 97 | LiveCodeBench | {
"expected_answer": "",
"problem_id": "",
"reference_solution": ""
} | <|begin_of_thought|>
Okay, let's see. I need to find the number of integer points on the line that are covered by any car. The cars are given as intervals, and each car's coverage is from start_i to end_i, inclusive. So the task is to compute the union of all these intervals and then count how many integers are in tha... |
[
{
"content": "Generate an executable Python function generated from the given prompt. Return the function body without invoking it at the final solution.You are given an array nums of positive integers and an integer k.\nIn one operation, you can remove the last element of the array and add it to your collectio... | {
"do_sample": false,
"max_new_tokens": 32768,
"seed": 0,
"temperature": 0.7
} | 0 | 98 | LiveCodeBench | {
"expected_answer": "",
"problem_id": "",
"reference_solution": ""
} | <|begin_of_thought|>
Okay, let's see. I need to find the minimum number of operations to collect elements 1 to k. The operations are removing the last element each time and adding it to the collection. So, the order in which elements are removed affects which ones we get. The goal is to collect all 1..k as quickly as ... |
[
{
"content": "Generate an executable Python function generated from the given prompt. Return the function body without invoking it at the final solution.You are given a 0-indexed array nums of length n containing distinct positive integers. Return the minimum number of right shifts required to sort nums and -1 ... | {
"do_sample": false,
"max_new_tokens": 32768,
"seed": 0,
"temperature": 0.7
} | 0 | 99 | LiveCodeBench | {
"expected_answer": "",
"problem_id": "",
"reference_solution": ""
} | <|begin_of_thought|>
Okay, let's see. I need to find the minimum number of right shifts required to sort the array. If it's not possible, return -1. Hmm. Right shifts move each element to the next position, with the last element wrapping around to the first. So after one right shift, each element moves to the right by... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.