{"kind":"task","effective_mode":"full","benchmark":{"kind":"benchmark","effective_mode":"full","slug":"livecodebench","formal_name":"LiveCodeBench","introduction":"LiveCodeBench continuously collects new competitive-programming problems to evaluate coding capabilities. Its initial release_v1 contains 400 problems, with source platform, contest date, and dataset version tracked explicitly.","introduction_ja":"","introduction_en":"","category":"Category not supplied","task_count":null,"acquisition_status":"Acquisition status not supplied","official_url":"https://livecodebench.github.io/","indexing_mode":"noindex","profile":{"resources":[],"task_format":"","scoring":"","metric":"","size":"","answer_access":"","license":"","citation":"","maintainer":"","released":"","why_hard":"","related":[]}},"task_id":"cca05bfa-2ca5-5af7-9256-8c86ef1d743d","task_key":"release~5fv1--test--1873~5fA","task_revision_id":"2","upstream_id":"1873_A","short_description":"A. Short Sort","config":"release_v1","split":"test","body":"{\"contest_date\":\"2023-08-21T00:00:00\",\"contest_id\":\"1873\",\"difficulty\":\"easy\",\"platform\":\"codeforces\",\"question_content\":\"There 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.\",\"question_title\":\"A. Short Sort\",\"starter_code\":\"\"}","display_format":"text","language":"","answer_status":"external_grader","assets":[],"source_url":"https://livecodebench.github.io/","history":"initial import","indexing_mode":"noindex","subproblems":[],"grids":[]}