model stringclasses 1
value | task_id stringlengths 11 15 | language stringclasses 1
value | prompt stringlengths 455 3.95k | final_code stringlengths 227 31k ⌀ | events stringlengths 13.1k 5.24M | final_evaluation stringlengths 2 19.2k | num_tests_passed int64 0 45 | num_total_tests int64 2 45 | agent stringclasses 1
value | stop_reason stringclasses 3
values | num_turns int64 2 40 | input_tokens int64 3.04k 1.08M | output_tokens int64 236 40.5k | reasoning_tokens int64 12 2.91k | total_tokens int64 3.27k 1.12M | wall_secs float64 11.3 600 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
Claude-Sonnet-4.6 | 1883/1883_B | java | You are given a string $s$ of length $n$, consisting of lowercase Latin letters, and an integer $k$.
You need to check if it is possible to remove exactly $k$ characters from the string $s$ in such a way that the remaining characters can be rearranged to form a palindrome. Note that you can reorder the remaining chara... | import java.util.*;
import java.io.*;
public class Solution {
public static void main(String[] args) throws IOException {
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
int t = Integer.parseInt(br.readLine().trim());
StringBuilder sb = new StringBuilder();
... | [{"role": "system", "content": "You are a competitive programming solver that can interact with a computer shell to solve programming tasks.\nYou are operating in an environment where you will think and issue AT LEAST ONE command, the system executes the command(s) in a subshell, you see the result, then you think and ... | [{"test_index": 0, "passed": true}, {"test_index": 1, "passed": true}, {"test_index": 2, "passed": true}, {"test_index": 3, "passed": true}] | 4 | 4 | mini | solution_found | 2 | 10,703 | 7,045 | 1,292 | 17,748 | 116.114525 |
Claude-Sonnet-4.6 | abc301/abc301_f | java | "A DDoS-type string is a string of length 4 consisting of uppercase and lowercase English letters sa(...TRUNCATED) | null | "[{\"role\": \"system\", \"content\": \"You are a competitive programming solver that can interact w(...TRUNCATED) | [] | 0 | 15 | mini | timeout | 2 | 12,740 | 9,912 | 2,232 | 22,652 | 600.092923 |
Claude-Sonnet-4.6 | abc302/abc302_a | java | "There is an enemy with stamina A. Every time you attack the enemy, its stamina reduces by B.\nAt l(...TRUNCATED) | "import java.util.Scanner;\n\npublic class Solution {\n public static void main(String[] args) {\(...TRUNCATED) | "[{\"role\": \"system\", \"content\": \"You are a competitive programming solver that can interact w(...TRUNCATED) | "[{\"test_index\": 0, \"passed\": true}, {\"test_index\": 1, \"passed\": true}, {\"test_index\": 2, (...TRUNCATED) | 15 | 15 | mini | solution_found | 2 | 3,383 | 361 | 46 | 3,744 | 13.646154 |
Claude-Sonnet-4.6 | abc302/abc302_c | java | "You are given N strings S_1,S_2,\\dots,S_N, each of length M, consisting of lowercase English lette(...TRUNCATED) | "import java.util.*;\n\npublic class Solution {\n public static void main(String[] args) {\n (...TRUNCATED) | "[{\"role\": \"system\", \"content\": \"You are a competitive programming solver that can interact w(...TRUNCATED) | "[{\"test_index\": 0, \"passed\": true}, {\"test_index\": 1, \"passed\": true}, {\"test_index\": 2, (...TRUNCATED) | 15 | 15 | mini | solution_found | 3 | 6,575 | 1,088 | 170 | 7,663 | 29.197345 |
Claude-Sonnet-4.6 | abc303/abc303_a | java | "Two characters x and y are called similar characters if and only if one of the following conditions(...TRUNCATED) | "import java.util.Scanner;\n\npublic class Solution {\n public static void main(String[] args) {\(...TRUNCATED) | "[{\"role\": \"system\", \"content\": \"You are a competitive programming solver that can interact w(...TRUNCATED) | "[{\"test_index\": 0, \"passed\": true}, {\"test_index\": 1, \"passed\": true}, {\"test_index\": 2, (...TRUNCATED) | 15 | 15 | mini | solution_found | 2 | 3,911 | 397 | 14 | 4,308 | 13.926755 |
Claude-Sonnet-4.6 | abc305/abc305_a | java | "There is an ultramarathon course totaling 100\\;\\mathrm{km}.\r\nWater stations are set up every 5\(...TRUNCATED) | "import java.util.Scanner;\n\npublic class Solution {\n public static void main(String[] args) {\(...TRUNCATED) | "[{\"role\": \"system\", \"content\": \"You are a competitive programming solver that can interact w(...TRUNCATED) | "[{\"test_index\": 0, \"passed\": true}, {\"test_index\": 1, \"passed\": true}, {\"test_index\": 2, (...TRUNCATED) | 10 | 10 | mini | solution_found | 2 | 3,388 | 290 | 22 | 3,678 | 14.175675 |
Claude-Sonnet-4.6 | abc305/abc305_b | java | "There are 7 points A, B, C, D, E, F, and G on a straight line, in this order. (See also the figure (...TRUNCATED) | "import java.util.*;\n\npublic class Solution {\n public static void main(String[] args) {\n (...TRUNCATED) | "[{\"role\": \"system\", \"content\": \"You are a competitive programming solver that can interact w(...TRUNCATED) | "[{\"test_index\": 0, \"passed\": true}, {\"test_index\": 1, \"passed\": true}, {\"test_index\": 2, (...TRUNCATED) | 14 | 14 | mini | solution_found | 2 | 3,629 | 443 | 20 | 4,072 | 14.231899 |
Claude-Sonnet-4.6 | abc308/abc308_d | java | "We have a grid with H horizontal rows and W vertical columns.\r\nWe denote by (i,j) the cell at the(...TRUNCATED) | "import java.util.*;\nimport java.io.*;\n\npublic class Solution {\n public static void main(Stri(...TRUNCATED) | "[{\"role\": \"system\", \"content\": \"You are a competitive programming solver that can interact w(...TRUNCATED) | "[{\"test_index\": 0, \"passed\": true}, {\"test_index\": 1, \"passed\": true}, {\"test_index\": 2, (...TRUNCATED) | 15 | 15 | mini | solution_found | 5 | 13,983 | 1,430 | 186 | 15,413 | 59.332779 |
Claude-Sonnet-4.6 | abc308/abc308_e | java | "You are given a length-N sequence A=(A_1,A_2,\\dots,A_N) consisting of 0, 1, and 2,\r\nand a length(...TRUNCATED) | "import java.util.*;\nimport java.io.*;\n\npublic class Solution {\n static int mex(int a, int b,(...TRUNCATED) | "[{\"role\": \"system\", \"content\": \"You are a competitive programming solver that can interact w(...TRUNCATED) | "[{\"test_index\": 0, \"passed\": true}, {\"test_index\": 1, \"passed\": true}, {\"test_index\": 2, (...TRUNCATED) | 15 | 15 | mini | solution_found | 2 | 9,350 | 5,606 | 909 | 14,956 | 85.507098 |
Claude-Sonnet-4.6 | abc310/abc310_b | java | "AtCoder Shop has N products.\r\nThe price of the i-th product (1\\leq i\\leq N) is P _ i.\r\nThe i-(...TRUNCATED) | "import java.util.*;\n\npublic class Solution {\n public static void main(String[] args) {\n (...TRUNCATED) | "[{\"role\": \"system\", \"content\": \"You are a competitive programming solver that can interact w(...TRUNCATED) | "[{\"test_index\": 0, \"passed\": true}, {\"test_index\": 1, \"passed\": true}, {\"test_index\": 2, (...TRUNCATED) | 15 | 15 | mini | solution_found | 3 | 9,446 | 1,384 | 157 | 10,830 | 31.435018 |
End of preview. Expand in Data Studio
README.md exists but content is empty.
- Downloads last month
- 27