info stringlengths 843 34.2M | question stringlengths 645 3.99k | avg@350_qwen3_4b_instruct_2507 float64 0 1 | original_problem_id int64 0 130 |
|---|---|---|---|
"{\"tests\": \"{\\\"inputs\\\": [\\\"5 3\\\\n1 1\\\\n1 2\\\\n2 2\\\\n3 2\\\\n2 3\\\\n6\\\\n1 1\\\\n1(...TRUNCATED) | "There is a grid with 10^9 rows and W columns. The cell at the x-th column from the left and the y-t(...TRUNCATED) | 0 | 0 |
"{\"tests\": \"{\\\"inputs\\\": [\\\"2 5\\\\n1 2\\\\n3 4\\\\n5 6\\\", \\\"3 10\\\\n100 100 100\\\\n1(...TRUNCATED) | "You are given three integer sequences of length N, namely A=(A_1,A_2,\\ldots,A_N), B=(B_1,B_2,\\ldo(...TRUNCATED) | 0 | 1 |
"{\"tests\": \"{\\\"inputs\\\": [\\\"2\\\\n010011101\\\", \\\"1\\\\n000\\\", \\\"8\\\\n1110111110101(...TRUNCATED) | "For a binary string B = B_1 B_2 \\dots B_{3^n} of length 3^n (n \\geq 1), we define an operation to(...TRUNCATED) | 0 | 3 |
"{\"tests\": \"{\\\"inputs\\\": [\\\"2 2\\\\nab\\\", \\\"3 4\\\\naaa\\\", \\\"7 50\\\\natcoder\\\", (...TRUNCATED) | "You are given a lowercase English string S of length N and an integer M. For each k=0,1,\\ldots,N, (...TRUNCATED) | 0 | 4 |
"{\"tests\": \"{\\\"inputs\\\": [\\\"5\\\\n8 3 1 5 2\\\", \\\"7\\\\n300000 100000 499998 499999 2000(...TRUNCATED) | "For integers A, B, C ( A < B < C ), if they satisfy B-A = C-B, then (A, B, C) is called a fine trip(...TRUNCATED) | 0 | 7 |
"{\"tests\": \"{\\\"inputs\\\": [\\\"5 3\\\\n2 4 1 3 3\\\\n2 5\\\\n5 2\\\\n5 3\\\", \\\"10 8\\\\n2 5(...TRUNCATED) | "You are given a sequence A = (A_1, A_2, \\dots, A_N) of length N.\nAnswer Q queries. The i-th query(...TRUNCATED) | 0 | 13 |
"{\"tests\": \"{\\\"inputs\\\": [\\\"9\\\\n1 2\\\\n2 3\\\\n3 4\\\\n4 5\\\\n2 6\\\\n2 7\\\\n3 8\\\\n3(...TRUNCATED) | "You are given an undirected tree T with N vertices, numbered 1, 2, \\ldots, N. The i-th edge is an (...TRUNCATED) | 0 | 19 |
"{\"tests\": \"{\\\"inputs\\\": [\\\"3 3\\\\n12 10 6\\\\n1 1 3\\\\n8 6 7\\\\n2\\\\n1 1 10 3 1 6\\\\n(...TRUNCATED) | "There is a city divided into H \\times W blocks in the north-south-east-west directions, and there (...TRUNCATED) | 0 | 21 |
"{\"tests\": \"{\\\"inputs\\\": [\\\"4\\\\nab--\\\\n--b-\\\\n---a\\\\nc---\\\", \\\"5\\\\nus---\\\\n(...TRUNCATED) | "We have a directed graph with N vertices, numbered 1, 2, \\ldots, N.\nInformation about the edges i(...TRUNCATED) | 0 | 23 |
"{\"tests\": \"{\\\"inputs\\\": [\\\"3 3\\\\n2 1 0\\\", \\\"5 6\\\\n5 3 5 0 1\\\", \\\"7 7\\\\n0 1 2(...TRUNCATED) | "You are given integers N, M and a length-N sequence of non-negative integers A = (A_1, A_2, \\ldots(...TRUNCATED) | 0 | 31 |
End of preview. Expand in Data Studio
README.md exists but content is empty.
- Downloads last month
- 9