Dataset Viewer
example_id
int64 0
4
| prompt
listlengths 1
1
| completion
listlengths 1
1
| task
stringclasses 1
value | reward
float64 0
1
| generation_ms
float64 45.9k
67.1k
| scoring_ms
float64 0.14
0.28
| total_ms
float64 45.9k
67.1k
| info
dict | has_error
float64 0
0
| passed
float64 0
1
| num_test_cases
float64 5
13
| pass_rate
float64 0.85
1
|
|---|---|---|---|---|---|---|---|---|---|---|---|---|
0
|
[
{
"content": "Solve the programming task below in a Python markdown code block.\n\nThere are three cards with letters $\\texttt{a}$, $\\texttt{b}$, $\\texttt{c}$ placed in a row in some order. You can do the following operation at most once: \n\n \n- Pick two cards, and swap them. Is it possible that the row becomes $\\texttt{abc}$ after the operation? Output \"YES\" if it is possible, and \"NO\" otherwise.\n\nInput\n\nThe first line contains a single integer $t$ ($1 \\leq t \\leq 6$) — the number of test cases.\n\nThe only line of each test case contains a single string consisting of each of the three characters $\\texttt{a}$, $\\texttt{b}$, and $\\texttt{c}$ exactly once, representing the cards.\n\nOutput\n\nFor each test case, output \"YES\" if you can make the row $\\texttt{abc}$ with at most one operation, or \"NO\" otherwise.\n\nYou can output the answer in any case (for example, the strings \"yEs\", \"yes\", \"Yes\" and \"YES\" will be recognized as a positive answer).Sample Input 1:\n6\n\nabc\n\nacb\n\nbac\n\nbca\n\ncab\n\ncba\n\n\n\nSample Output 1:\n\nYES\nYES\nYES\nNO\nNO\nYES\n\n\nNote\n\nIn the first test case, we don't need to do any operations, since the row is already $\\texttt{abc}$.\n\nIn the second test case, we can swap $\\texttt{c}$ and $\\texttt{b}$: $\\texttt{acb} \\to \\texttt{abc}$.\n\nIn the third test case, we can swap $\\texttt{b}$ and $\\texttt{a}$: $\\texttt{bac} \\to \\texttt{abc}$.\n\nIn the fourth test case, it is impossible to make $\\texttt{abc}$ using at most one operation.\n\nRead the inputs from stdin solve the problem and write the answer to stdout (do not directly test on the sample inputs). Enclose your code within ```python delimiters.",
"role": "user"
}
] |
[
{
"content": "```python\nt = int(input())\ntarget = \"abc\"\n\nfor _ in range(t):\n s = input()\n if s == target:\n print(\"YES\")\n continue\n \n # Try all pairs of swaps once, check if any results in \"abc\"\n found = False\n arr = list(s)\n for i in range(3):\n for j in range(i+1, 3):\n arr[i], arr[j] = arr[j], arr[i]\n if \"\".join(arr) == target:\n found = True\n arr[i], arr[j] = arr[j], arr[i] # swap back\n if found:\n break\n if found:\n break\n \n print(\"YES\" if found else \"NO\")\n```",
"role": "assistant"
}
] |
deepcoder
| 1
| 46,797.512531
| 0.216246
| 46,797.728777
|
{
"num_test_cases": 5,
"source": "lcbv5",
"subset": "i3-code",
"subset_idx": 0,
"verification_info": {
"fn_name": null,
"test_case_inputs": [
"\"6\\nabc\\nacb\\nbac\\nbca\\ncab\\ncba\\n\"",
"\"1\\nabc\\n\"",
"\"3\\nabc\\nabc\\nabc\\n\"",
"\"5\\ncab\\nacb\\ncba\\nbac\\nbca\\n\"",
"\"6\\nabc\\nabc\\nabc\\nabc\\nabc\\nabc\\n\""
],
"test_case_outputs": [
"\"YES\\nYES\\nYES\\nNO\\nNO\\nYES\\n\"",
"\"YES\\n\"",
"\"YES\\nYES\\nYES\\n\"",
"\"NO\\nYES\\nYES\\nYES\\nNO\\n\"",
"\"YES\\nYES\\nYES\\nYES\\nYES\\nYES\\n\""
],
"timeout": 10
}
}
| 0
| 1
| 5
| 1
|
1
| [{"content":"Solve the programming task below in a Python markdown code block.\n\nSlavic is preparin(...TRUNCATED)
| [{"content":"```python\nimport sys\ninput = sys.stdin.readline\n\nt = int(input())\nfor _ in range(t(...TRUNCATED)
|
deepcoder
| 1
| 47,912.12225
| 0.154257
| 47,912.276506
| {"num_test_cases":13,"source":"lcbv5","subset":"i3-code","subset_idx":1,"verification_info":{"fn_nam(...TRUNCATED)
| 0
| 1
| 13
| 1
|
2
| [{"content":"Solve the programming task below in a Python markdown code block.\n\nYou are given a st(...TRUNCATED)
| [{"content":"```python\nimport sys\ninput = sys.stdin.readline\n\nt = int(input())\nfor _ in range(t(...TRUNCATED)
|
deepcoder
| 1
| 48,933.357
| 0.214577
| 48,933.571577
| {"num_test_cases":13,"source":"lcbv5","subset":"i3-code","subset_idx":2,"verification_info":{"fn_nam(...TRUNCATED)
| 0
| 1
| 13
| 1
|
3
| [{"content":"Solve the programming task below in a Python markdown code block.\n\nYou are given an a(...TRUNCATED)
| [{"content":"```python\nimport sys\ninput = sys.stdin.readline\n\ndef min_ops_to_divisible(n, k, a):(...TRUNCATED)
|
deepcoder
| 0
| 49,168.883324
| 0.219345
| 49,169.102669
| {"num_test_cases":13,"source":"lcbv5","subset":"i3-code","subset_idx":3,"verification_info":{"fn_nam(...TRUNCATED)
| 0
| 0
| 13
| 0.846154
|
4
| [{"content":"Solve the programming task below in a Python markdown code block.\n\nVanya and Vova are(...TRUNCATED)
| [{"content":"```python\nt = int(input())\nfor _ in range(t):\n n = int(input())\n \n # Vany(...TRUNCATED)
|
deepcoder
| 1
| 49,662.926197
| 0.217676
| 49,663.143873
| {"num_test_cases":13,"source":"lcbv5","subset":"i3-code","subset_idx":4,"verification_info":{"fn_nam(...TRUNCATED)
| 0
| 1
| 13
| 1
|
0
| [{"content":"Solve the programming task below in a Python markdown code block.\n\nThere are three ca(...TRUNCATED)
| [{"content":"```python\nt = int(input())\ntarget = \"abc\"\n\nfor _ in range(t):\n s = input()\n (...TRUNCATED)
|
deepcoder
| 1
| 47,294.073582
| 0.175238
| 47,294.248819
| {"num_test_cases":5,"source":"lcbv5","subset":"i3-code","subset_idx":0,"verification_info":{"fn_name(...TRUNCATED)
| 0
| 1
| 5
| 1
|
1
| [{"content":"Solve the programming task below in a Python markdown code block.\n\nSlavic is preparin(...TRUNCATED)
| [{"content":"```python\nt = int(input())\nfor _ in range(t):\n n = int(input())\n a = list(map(...TRUNCATED)
|
deepcoder
| 1
| 49,349.319458
| 0.209093
| 49,349.528551
| {"num_test_cases":13,"source":"lcbv5","subset":"i3-code","subset_idx":1,"verification_info":{"fn_nam(...TRUNCATED)
| 0
| 1
| 13
| 1
|
2
| [{"content":"Solve the programming task below in a Python markdown code block.\n\nYou are given a st(...TRUNCATED)
| [{"content":"```python\nimport sys\ninput = sys.stdin.readline\n\nt = int(input())\nfor _ in range(t(...TRUNCATED)
|
deepcoder
| 1
| 47,600.320578
| 0.183105
| 47,600.503683
| {"num_test_cases":13,"source":"lcbv5","subset":"i3-code","subset_idx":2,"verification_info":{"fn_nam(...TRUNCATED)
| 0
| 1
| 13
| 1
|
3
| [{"content":"Solve the programming task below in a Python markdown code block.\n\nYou are given an a(...TRUNCATED)
| [{"content":"```python\nimport sys\ninput = sys.stdin.readline\n\ndef min_ops_to_divisible(n, k, arr(...TRUNCATED)
|
deepcoder
| 0
| 67,079.56934
| 0.255346
| 67,079.824686
| {"num_test_cases":13,"source":"lcbv5","subset":"i3-code","subset_idx":3,"verification_info":{"fn_nam(...TRUNCATED)
| 0
| 0
| 13
| 0.846154
|
4
| [{"content":"Solve the programming task below in a Python markdown code block.\n\nVanya and Vova are(...TRUNCATED)
| [{"content":"```python\nt = int(input())\nfor _ in range(t):\n n = int(input())\n # Vanya wins(...TRUNCATED)
|
deepcoder
| 1
| 47,952.493429
| 0.140429
| 47,952.633858
| {"num_test_cases":13,"source":"lcbv5","subset":"i3-code","subset_idx":4,"verification_info":{"fn_nam(...TRUNCATED)
| 0
| 1
| 13
| 1
|
End of preview. Expand
in Data Studio
README.md exists but content is empty.
- Downloads last month
- 21