problem_id int64 0 99 | trajectory_id int64 0 63 | question stringclasses 100
values | messages stringlengths 9.85k 93.7k | num_turns int64 2 5 | final_reward float64 0 1 | terminated bool 2
classes | truncated bool 2
classes | interactions stringlengths 2 347k | tests stringclasses 100
values | is_successful bool 2
classes | interaction_timeout_count int64 0 4 | eval_timeout_count int64 0 15 | rendered stringlengths 8.33k 351k |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
0 | 0 | You are given a 0-indexed string s and an integer k.
You are to perform the following partitioning operations until s is empty:
Choose the longest prefix of s containing at most k distinct characters.
Delete the prefix from s and increase the number of partitions by one. The remaining characters (if any) in s maintain... | [{"role": "system", "content": "[Harmony format] Reasoning effort: medium"}, {"role": "developer", "content": "You are a helpful coding assistant.\n\nYou have access to a Python interpreter.\nTo execute code, wrap it inside <interact></interact>. I will run it and return stdout/stderr in a subsequent turn.\n\nIMPORTANT... | 2 | 0.8 | true | false | [{"code": "def partitions(s, k):\n cnt = 0\n i = 0\n n = len(s)\n while i < n:\n distinct = set()\n j = i\n while j < n and (len(distinct) + (s[j] not in distinct)) <= k:\n distinct.add(s[j])\n j += 1\n cnt += 1\n i = j\n return cnt\n\ndef max_part... | {"inputs": ["\"accca\"\n2", "\"aabaab\"\n3", "\"xxyz\"\n1", "\"abcde\"\n5", "\"aaaaaa\"\n2", "\"wjlcta\"\n5", "\"eictzzwx\"\n1", "\"fvcalcqn\"\n3", "\"zcjvkodq\"\n5", "\"eifhjtmuj\"\n7", "\"cxdzvmcbcv\"\n3", "\"rnqrabcxrh\"\n1", "\"xpfcubkanivkyjzrknwyapagrimbfidmckcyeupxioksdbcmucufydzepdedezeygezuvfmzyiodsenwqdldxjmw... | true | 0 | 0 | ================================================================================
Question: You are given a 0-indexed string s and an integer ...
Reward: 0.80 | Turns: 2 | Terminated: True | Truncated: False
================================================================================
[SYSTEM]
[Harmony format] Reaso... |
0 | 1 | "You are given a 0-indexed string s and an integer k.\nYou are to perform the following partitioning(...TRUNCATED) | "[{\"role\": \"system\", \"content\": \"[Harmony format] Reasoning effort: medium\"}, {\"role\": \"d(...TRUNCATED) | 3 | 0.8 | true | false | "[{\"code\": \"import random, string, itertools\\n\\ndef count_partitions(s, k):\\n cnt = 0\\n (...TRUNCATED) | "{\"inputs\": [\"\\\"accca\\\"\\n2\", \"\\\"aabaab\\\"\\n3\", \"\\\"xxyz\\\"\\n1\", \"\\\"abcde\\\"\(...TRUNCATED) | true | 0 | 0 | "================================================================================\nQuestion: You are(...TRUNCATED) |
0 | 2 | "You are given a 0-indexed string s and an integer k.\nYou are to perform the following partitioning(...TRUNCATED) | "[{\"role\": \"system\", \"content\": \"[Harmony format] Reasoning effort: medium\"}, {\"role\": \"d(...TRUNCATED) | 3 | 0.8 | true | false | "[{\"code\": \"import random, string, bisect, sys\\n\\ndef greedy_partitions(t, k):\\n n = len(t)(...TRUNCATED) | "{\"inputs\": [\"\\\"accca\\\"\\n2\", \"\\\"aabaab\\\"\\n3\", \"\\\"xxyz\\\"\\n1\", \"\\\"abcde\\\"\(...TRUNCATED) | true | 0 | 0 | "================================================================================\nQuestion: You are(...TRUNCATED) |
0 | 3 | "You are given a 0-indexed string s and an integer k.\nYou are to perform the following partitioning(...TRUNCATED) | "[{\"role\": \"system\", \"content\": \"[Harmony format] Reasoning effort: medium\"}, {\"role\": \"d(...TRUNCATED) | 3 | 0 | true | true | "[{\"code\": \"def greedy_partitions(s, k):\\n n = len(s)\\n i = 0\\n cnt = 0\\n while i(...TRUNCATED) | "{\"inputs\": [\"\\\"accca\\\"\\n2\", \"\\\"aabaab\\\"\\n3\", \"\\\"xxyz\\\"\\n1\", \"\\\"abcde\\\"\(...TRUNCATED) | false | 0 | 0 | "================================================================================\nQuestion: You are(...TRUNCATED) |
0 | 4 | "You are given a 0-indexed string s and an integer k.\nYou are to perform the following partitioning(...TRUNCATED) | "[{\"role\": \"system\", \"content\": \"[Harmony format] Reasoning effort: medium\"}, {\"role\": \"d(...TRUNCATED) | 3 | 0.8 | true | false | "[{\"code\": \"# Hypothesis: The provided implementation correctly computes the maximum number of pa(...TRUNCATED) | "{\"inputs\": [\"\\\"accca\\\"\\n2\", \"\\\"aabaab\\\"\\n3\", \"\\\"xxyz\\\"\\n1\", \"\\\"abcde\\\"\(...TRUNCATED) | true | 0 | 0 | "================================================================================\nQuestion: You are(...TRUNCATED) |
0 | 5 | "You are given a 0-indexed string s and an integer k.\nYou are to perform the following partitioning(...TRUNCATED) | "[{\"role\": \"system\", \"content\": \"[Harmony format] Reasoning effort: medium\"}, {\"role\": \"d(...TRUNCATED) | 3 | 0 | true | true | "[{\"code\": \"# Hypothesis: The maximum increase in number of partitions achievable by changing at (...TRUNCATED) | "{\"inputs\": [\"\\\"accca\\\"\\n2\", \"\\\"aabaab\\\"\\n3\", \"\\\"xxyz\\\"\\n1\", \"\\\"abcde\\\"\(...TRUNCATED) | false | 0 | 0 | "================================================================================\nQuestion: You are(...TRUNCATED) |
0 | 6 | "You are given a 0-indexed string s and an integer k.\nYou are to perform the following partitioning(...TRUNCATED) | "[{\"role\": \"system\", \"content\": \"[Harmony format] Reasoning effort: medium\"}, {\"role\": \"d(...TRUNCATED) | 3 | 0.866667 | true | false | "[{\"code\": \"import random\\nimport itertools\\n\\ndef greedy_partitions(t, k):\\n mask = 0\\n (...TRUNCATED) | "{\"inputs\": [\"\\\"accca\\\"\\n2\", \"\\\"aabaab\\\"\\n3\", \"\\\"xxyz\\\"\\n1\", \"\\\"abcde\\\"\(...TRUNCATED) | true | 0 | 0 | "================================================================================\nQuestion: You are(...TRUNCATED) |
0 | 7 | "You are given a 0-indexed string s and an integer k.\nYou are to perform the following partitioning(...TRUNCATED) | "[{\"role\": \"system\", \"content\": \"[Harmony format] Reasoning effort: medium\"}, {\"role\": \"d(...TRUNCATED) | 4 | 0.8 | true | false | "[{\"code\": \"import random\\n\\ndef greedy_partitions(t, k):\\n n = len(t)\\n i = 0\\n pa(...TRUNCATED) | "{\"inputs\": [\"\\\"accca\\\"\\n2\", \"\\\"aabaab\\\"\\n3\", \"\\\"xxyz\\\"\\n1\", \"\\\"abcde\\\"\(...TRUNCATED) | true | 0 | 0 | "================================================================================\nQuestion: You are(...TRUNCATED) |
0 | 8 | "You are given a 0-indexed string s and an integer k.\nYou are to perform the following partitioning(...TRUNCATED) | "[{\"role\": \"system\", \"content\": \"[Harmony format] Reasoning effort: medium\"}, {\"role\": \"d(...TRUNCATED) | 4 | 0.8 | true | false | "[{\"code\": \"# Hypothesis: Using a sentinel character (distinct from all lowercase letters) as the(...TRUNCATED) | "{\"inputs\": [\"\\\"accca\\\"\\n2\", \"\\\"aabaab\\\"\\n3\", \"\\\"xxyz\\\"\\n1\", \"\\\"abcde\\\"\(...TRUNCATED) | true | 0 | 0 | "================================================================================\nQuestion: You are(...TRUNCATED) |
0 | 9 | "You are given a 0-indexed string s and an integer k.\nYou are to perform the following partitioning(...TRUNCATED) | "[{\"role\": \"system\", \"content\": \"[Harmony format] Reasoning effort: medium\"}, {\"role\": \"d(...TRUNCATED) | 5 | 0.8 | true | false | "[{\"code\": \"def max_partitions_brutal(s, k):\\n # brute force try all possible single characte(...TRUNCATED) | "{\"inputs\": [\"\\\"accca\\\"\\n2\", \"\\\"aabaab\\\"\\n3\", \"\\\"xxyz\\\"\\n1\", \"\\\"abcde\\\"\(...TRUNCATED) | true | 0 | 0 | "================================================================================\nQuestion: You are(...TRUNCATED) |
End of preview. Expand in Data Studio
README.md exists but content is empty.
- Downloads last month
- 8