hash string | ability string | data_source string | prompt list | reward_model dict |
|---|---|---|---|---|
7b3a48823cd08358ca1e725ab940354c | code | coder1_longcot | [
{
"content": "Solve the following coding problem using the programming language python:\n\nDreamoon loves summing up something for no reason. One day he obtains two integers a and b occasionally. He wants to calculate the sum of all nice integers. Positive integer x is called nice if $\\operatorname{mod}(x, b) ... | {
"ground_truth": "{\"inputs\": [\"1 1\\n\", \"2 2\\n\", \"4 1\\n\", \"4 2\\n\", \"4 3\\n\", \"4 4\\n\", \"3 4\\n\", \"2 4\\n\", \"1 4\\n\", \"1000 1000\\n\", \"10000000 10000000\\n\", \"10000000 9999999\\n\", \"2 10000000\\n\", \"10000000 2\\n\", \"9999999 2\\n\", \"9999999 9999999\\n\", \"10000000 10000\\n\", \"10000 10000000\\n\", \"2 9999999\\n\", \"123456 123456\\n\", \"6407688 3000816\\n\", \"9956532 1084240\\n\", \"3505377 9167664\\n\", \"7054221 7251088\\n\", \"346169 367216\\n\", \"3895014 8450640\\n\", \"861392 6200826\\n\", \"4410236 9316955\\n\", \"2926377 2367675\\n\", \"1507925 5483803\\n\", \"9832578 8599931\\n\", \"8348718 6683355\\n\", \"1897562 4766779\\n\", \"413703 2850203\\n\", \"8995251 5966331\\n\", \"7319903 9017051\\n\", \"9253578 1799941\\n\", \"7835126 9883365\\n\", \"6351267 7966789\\n\", \"9900111 1082917\\n\", \"1 10000000\\n\", \"123456 234567\\n\", \"888888 888888\\n\", \"1001 1500126\\n\", \"9243243 432434\\n\", \"3 10000000\\n\", \"4108931 211273\\n\", \"999999 92321\\n\", \"999999 999999\\n\", \"191919 123123\\n\", \"999999 1000000\\n\", \"31623 10000000\\n\", \"1000023 1000043\\n\", \"666666 666666\\n\", \"7672285 753250\\n\", \"1000000 1000000\\n\", \"6340794 6874449\\n\", \"9998486 9998486\\n\", \"9999997 9999998\\n\"], \"outputs\": [\"0\\n\", \"8\\n\", \"0\\n\", \"24\\n\", \"102\\n\", \"264\\n\", \"162\\n\", \"84\\n\", \"30\\n\", \"247750000\\n\", \"425362313\\n\", \"930564389\\n\", \"990423507\\n\", \"19300000\\n\", \"999300006\\n\", \"957764103\\n\", \"723127969\\n\", \"372369289\\n\", \"48573499\\n\", \"417111819\\n\", \"895399645\\n\", \"554368769\\n\", \"80435138\\n\", \"7849970\\n\", \"358144298\\n\", \"627604019\\n\", \"180835815\\n\", \"602743722\\n\", \"395740917\\n\", \"727607740\\n\", \"428281878\\n\", \"275994807\\n\", \"148050609\\n\", \"76966774\\n\", \"451718548\\n\", \"975259203\\n\", \"868664771\\n\", \"119844544\\n\", \"683811063\\n\", \"539539383\\n\", \"995024507\\n\", \"93010021\\n\", \"456888843\\n\", \"45074025\\n\", \"203891513\\n\", \"986197007\\n\", \"142398939\\n\", \"286549418\\n\", \"691690639\\n\", \"358196438\\n\", \"725921292\\n\", \"382702377\\n\", \"175442768\\n\", \"869302791\\n\", \"461773059\\n\", \"249917764\\n\", \"930977735\\n\", \"988877388\\n\", \"946983076\\n\"]}",
"style": "rule"
} |
3c03186a1602e6b4a3c8645e06f87671 | code | coder1_longcot | [
{
"content": "Solve the following coding problem using the programming language python:\n\n\"QAQ\" is a word to denote an expression of crying. Imagine \"Q\" as eyes with tears and \"A\" as a mouth.\n\nNow Diamond has given Bort a string consisting of only uppercase English letters of length n. There is a great... | {
"ground_truth": "{\"inputs\": [\"QAQAQYSYIOIWIN\\n\", \"QAQQQZZYNOIWIN\\n\", \"QA\\n\", \"IAQVAQZLQBQVQFTQQQADAQJA\\n\", \"QQAAQASGAYAAAAKAKAQIQEAQAIAAIAQQQQQ\\n\", \"AMVFNFJIAVNQJWIVONQOAOOQSNQSONOASONAONQINAONAOIQONANOIQOANOQINAONOQINAONOXJCOIAQOAOQAQAQAQAQWWWAQQAQ\\n\", \"AAQQAXBQQBQQXBNQRJAQKQNAQNQVDQASAGGANQQQQTJFFQQQTQQA\\n\", \"KAZXAVLPJQBQVQQQQQAPAQQGQTQVZQAAAOYA\\n\", \"W\\n\", \"DBA\\n\", \"RQAWNACASAAKAGAAAAQ\\n\", \"QJAWZAAOAAGIAAAAAOQATASQAEAAAAQFQQHPA\\n\", \"QQKWQAQAAAAAAAAGAAVAQUEQQUMQMAQQQNQLAMAAAUAEAAEMAAA\\n\", \"QQUMQAYAUAAGWAAAQSDAVAAQAAAASKQJJQQQQMAWAYYAAAAAAEAJAXWQQ\\n\", \"QORZOYAQ\\n\", \"QCQAQAGAWAQQQAQAVQAQQQQAQAQQQAQAAATQAAVAAAQQQQAAAUUQAQQNQQWQQWAQAAQQKQYAQAAQQQAAQRAQQQWBQQQQAPBAQGQA\\n\", \"QQAQQAKQFAQLQAAWAMQAZQAJQAAQQOACQQAAAYANAQAQQAQAAQQAOBQQJQAQAQAQQQAAAAABQQQAVNZAQQQQAMQQAFAAEAQAQHQT\\n\", \"AQEGQHQQKQAQQPQKAQQQAAAAQQQAQEQAAQAAQAQFSLAAQQAQOQQAVQAAAPQQAWAQAQAFQAXAQQQQTRLOQAQQJQNQXQQQQSQVDQQQ\\n\", \"QNQKQQQLASQBAVQQQQAAQQOQRJQQAQQQEQZUOANAADAAQQJAQAQARAAAQQQEQBHTQAAQAAAAQQMKQQQIAOJJQQAQAAADADQUQQQA\\n\", \"QQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQ\\n\", \"AMQQAAQAAQAAAAAAQQQBOAAANAAKQJCYQAE\\n\", \"AYQBAEQGAQEOAKGIXLQJAIAKQAAAQPUAJAKAATFWQQAOQQQUFQYAQQMQHOKAAJXGFCARAQSATHAUQQAATQJJQDQRAANQQAE\\n\", \"AAQXAAQAYQAAAAGAQHVQYAGIVACADFAAQAAAAQZAAQMAKZAADQAQDAAQDAAAMQQOXYAQQQAKQBAAQQKAXQBJZDDLAAHQQ\\n\", \"AYQQYAVAMNIAUAAKBBQVACWKTQSAQZAAQAAASZJAWBCAALAARHACQAKQQAQAARPAQAAQAQAAZQUSHQAMFVFZQQQQSAQQXAA\\n\", \"LQMAQQARQAQBJQQQAGAAZQQXALQQAARQAQQQQAAQQAQQQAQQCAQQAQQAYQQQRAAZATQALYQQAAHHAAQHAAAAAAAAQQMAAQNAKQ\\n\", \"MAQQWAQOYQMAAAQAQPQZAOAAQAUAQNAAQAAAITQSAQAKAQKAQQWSQAAQQAGUCDQMQWKQUXKWQQAAQQAAQQZQDQQQAABXQUUXQOA\\n\", \"QTAAQDAQXAQQJQQQGAAAQQQQSBQZKAQQAQQQQEAQNUQBZCQLYQZQEQQAAQHQVAORKQVAQYQNASZQAARZAAGAAAAOQDCQ\\n\", \"QQWAQQGQQUZQQQLZAAQYQXQVAQFQUAQZUQZZQUKBHSHTQYLQAOQXAQQGAQQTQOAQARQADAJRAAQPQAQQUQAUAMAUVQAAAQQAWQ\\n\", \"QQAAQQAQVAQZQQQQAOEAQZPQIBQZACQQAFQQLAAQDATZQANHKYQQAQTAAFQRQAIQAJPWQAQTEIRXAEQQAYWAAAUKQQAQAQQQSQQH\\n\", \"AQQQQAQAAQQAQAQAAAAAAAAAQAQAAAAAQAQAQQQAQQQAAAQQQAAAAAAAQAAAAQQQQQQQAQQQQAQAAAQAAAAAQAQAAAAAQAQAAAA\\n\", \"AQQQQAQAAQQAQAQAAAAAAAAAQAQAAAAAQAQAQQQAQQQAAAQQQAAAAAAAQAAAAQQQQQQQAQQQQAQAAAQAAAAAQAQAAAAAQ\\n\", \"AQQQQAQAAQQAQAQAAAAAAAAAQAQAAAAAQAQAQQQAQQQAAAQQQAAAAAAAQAAAAQQQQQQQAQQQQAQAAAQAAAAAQAQAAAAAQAQAA\\n\", \"AQQQQAQAAQQAQAQAAAAAAAAAQAQAAAAAQAQAQQQAQQQAAAQQQAAAAAAAQAAAAQQQQQQQAQQQQAQAAAQAAAAAQAQAAAAAQQAA\\n\", \"QQQQQAQAAQQAQAQAAAAAAAAAQAQAAAAAQAQAQQQAQQQAAAQQQAAAAAAAQAAAAQQQQQQQAQQQQAQAAAQAAAAAQAQAAAAAQAQAA\\n\", \"AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQ\\n\", \"QQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA\\n\", \"QQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQ\\n\", \"QAQAQAQAQAQAQAQAQAQAQAQAQAQAQAQAQAQAQAQAQAQAQAQAQAQAQAQAQAQAQAQAQAQAQAQAQAQAQAQAQAQAQAQAQAQAQAQAQAQA\\n\", \"AQAQAQAQAQAQAQAQAQAQAQAQAQAQAQAQAQAQAQAQAQAQAQAQAQAQAQAQAQAQAQAQAQAQAQAQAQAQAQAQAQAQAQAQAQAQAQAQAQAQ\\n\", \"Q\\n\", \"A\\n\", \"FFF\\n\", \"AAAAAA\\n\"], \"outputs\": [\"4\\n\", \"3\\n\", \"0\\n\", \"24\\n\", \"378\\n\", \"1077\\n\", \"568\\n\", \"70\\n\", \"0\\n\", \"0\\n\", \"10\\n\", \"111\\n\", \"411\\n\", \"625\\n\", \"1\\n\", \"13174\\n\", \"10420\\n\", \"12488\\n\", \"9114\\n\", \"35937\\n\", \"254\\n\", \"2174\\n\", \"2962\\n\", \"2482\\n\", \"7768\\n\", \"5422\\n\", \"3024\\n\", \"4527\\n\", \"6416\\n\", \"14270\\n\", \"13136\\n\", \"14270\\n\", \"14231\\n\", \"15296\\n\", \"0\\n\", \"0\\n\", \"0\\n\", \"20825\\n\", \"20825\\n\", \"0\\n\", \"0\\n\", \"0\\n\", \"0\\n\"]}",
"style": "rule"
} |
45835978994c3f41e17082bda084cb75 | code | coder1_longcot | [
{
"content": "Solve the following coding problem using the programming language python:\n\nCodefortia is a small island country located somewhere in the West Pacific. It consists of $n$ settlements connected by $m$ bidirectional gravel roads. Curiously enough, the beliefs of the inhabitants require the time nee... | {
"ground_truth": "{\"inputs\": [\"5 5 20 25\\n1 2 25\\n2 3 25\\n3 4 20\\n4 5 20\\n5 1 20\\n\", \"6 7 13 22\\n1 2 13\\n2 3 13\\n1 4 22\\n3 4 13\\n4 5 13\\n5 6 13\\n6 1 13\\n\", \"2 1 1 2\\n2 1 1\\n\", \"2 1 9999999 10000000\\n1 2 10000000\\n\", \"3 3 78422 6789101\\n3 1 6789101\\n2 1 78422\\n2 3 78422\\n\", \"3 3 2770628 3912422\\n1 2 2770628\\n2 3 2770628\\n1 3 3912422\\n\", \"3 3 2566490 5132980\\n1 2 2566490\\n2 3 2566490\\n3 1 5132980\\n\", \"3 2 509529 5982470\\n1 2 509529\\n3 2 509529\\n\", \"3 2 1349740 8457492\\n2 1 1349740\\n3 1 1349740\\n\", \"3 2 150319 5002968\\n3 2 150319\\n1 2 5002968\\n\", \"3 2 990530 8623767\\n3 2 8623767\\n1 2 990530\\n\", \"3 2 810925 2022506\\n1 2 2022506\\n1 3 810925\\n\", \"3 2 1651136 5131013\\n1 2 5131013\\n3 2 5131013\\n\", \"3 2 451715 1577270\\n1 3 1577270\\n1 2 1577270\\n\", \"3 3 1291926 4943478\\n2 3 1291926\\n1 2 1291926\\n3 1 1291926\\n\", \"3 3 2132137 9084127\\n1 2 2132137\\n3 2 9084127\\n3 1 2132137\\n\", \"3 3 1126640 9858678\\n3 1 9858678\\n3 2 1126640\\n1 2 9858678\\n\", \"3 3 1966851 6439891\\n1 3 6439891\\n1 2 1966851\\n3 2 6439891\\n\", \"3 3 1787246 7806211\\n3 2 7806211\\n2 1 7806211\\n1 3 7806211\\n\"], \"outputs\": [\"0 25 60 40 20\\n\", \"0 13 26 39 26 13\\n\", \"0 1\\n\", \"0 10000000\\n\", \"0 78422 156844\\n\", \"0 2770628 5541256\\n\", \"0 2566490 5132980\\n\", \"0 509529 1019058\\n\", \"0 1349740 1349740\\n\", \"0 5002968 5153287\\n\", \"0 990530 9614297\\n\", \"0 2022506 810925\\n\", \"0 5131013 10262026\\n\", \"0 1577270 1577270\\n\", \"0 1291926 1291926\\n\", \"0 2132137 2132137\\n\", \"0 9858678 9858678\\n\", \"0 1966851 6439891\\n\", \"0 7806211 7806211\\n\"]}",
"style": "rule"
} |
e17bd6bd8d9d6fa85a97fc29bf92fa0d | code | coder1_longcot | [
{
"content": "Solve the following coding problem using the programming language python:\n\nVasya and Kolya play a game with a string, using the following rules. Initially, Kolya creates a string s, consisting of small English letters, and uniformly at random chooses an integer k from a segment [0, len(s) - 1]. ... | {
"ground_truth": "{\"inputs\": [\"technocup\\n\", \"tictictactac\\n\", \"bbaabaabbb\\n\", \"cbbbbcaaca\\n\", \"cadbcdddda\\n\", \"bababbdaee\\n\", \"fabbbhgedd\\n\", \"gaejllebhn\\n\", \"bbababaaababaabbbbbabbbbbbaaabbabaaaaabbbbbaaaabbbbabaabaabababbbabbabbabaaababbabbababaaaaabaaaabbb\\n\", \"eaaebccaeacdecaedcaabbbdeebccdcdaabeeaeeaddbaabdccebecebbbbedbdcbbbbbbecbaddcddcccdcbbadbecddecedbba\\n\", \"hcdhgcchbdhbeagdcfedgcbaffebgcbcccadeefacbhefgeadfgchabgeebegahfgegahbddedfhffeadcedadgfbeebhgfahhfb\\n\", \"difhjdjbcdjedhiegagdejkbjfcdcdagdijdjajecbheiabfbjdgjdecfhdkgdbkcgcgakkiiggfkgcfadkjhiijkjacgejfhjge\\n\", \"khjcoijiicdkdianmdolmadobdkcmgifdnffddnjehhbldlkjffknficdcmokfacioiegjedbmadjioomdacbodcajcmonmnlabo\\n\", \"kpsaloedscghjeaqadfhmlibjepjafdomkkorinrpakondtnrnknbqarbejcenrlsbfgdbsdmkpphbkdnbitjfcofsjibssmmlll\\n\", \"jkeaagakbifeaechkifkdghcjcgighidcgdccfbdbcackfgaebkddabgijkhjkaffkabacekdkjekeccegbecbkecbgbgcacgdackcdfjefaifgbigahkbedidfhjbikejdhejcgideaeejdcegeeccaefbddejkbdkfagfcdjbikbidfggkidcdcic\\n\", \"ibledofnibedebifmnjdoaijeghajecbkjaebbkofnacceaodiifbhgkihkibddneeiemacodeafeaiiiaoajhmkjffbmmiehebhokfklhbkeoanoajdedjdlkbhenidclagggfhhhldfleccgmjbkhaginlhabkabagikalccndciokabfaebjkndf\\n\", \"aaabbbaaaabbbbaaabbbbbaabbbbaaababbaaabbbbaaabbbbababbbbaaabbbbaaabbbbbaabbbbaaabbbbaaabbbb\\n\", \"abbbaababbbaababbbaababbbaababbbaababbbaababbbaababbbaababbbaababbbaababbbaababbbaababbbaab\\n\", \"abbacba\\n\"], \"outputs\": [\"1.000000000000000\\n\", \"0.333333333333333\\n\", \"0.100000000000000\\n\", \"0.800000000000000\\n\", \"0.800000000000000\\n\", \"1.000000000000000\\n\", \"1.000000000000000\\n\", \"1.000000000000000\\n\", \"0.000000000000000\\n\", \"0.080000000000000\\n\", \"0.450000000000000\\n\", \"0.840000000000000\\n\", \"0.960000000000000\\n\", \"1.000000000000000\\n\", \"0.438502673796791\\n\", \"0.786096256684492\\n\", \"0.000000000000000\\n\", \"0.000000000000000\\n\", \"1.000000000000000\\n\"]}",
"style": "rule"
} |
caeec2e826110f44b8b28a78fb30573f | code | coder1_longcot | [
{
"content": "Solve the following coding problem using the programming language python:\n\nThe Little Elephant has an integer a, written in the binary notation. He wants to write this number on a piece of paper.\n\nTo make sure that the number a fits on the piece of paper, the Little Elephant ought to delete ex... | {
"ground_truth": "{\"inputs\": [\"101\\n\", \"110010\\n\", \"10000\\n\", \"1111111110\\n\", \"10100101011110101\\n\", \"111010010111\\n\", \"11110111011100000000\\n\", \"11110010010100001110110101110011110110100111101\\n\", \"1001011111010010100111111\\n\", \"1111111111\\n\", \"1111111111111111111100111101001110110111111000001111110101001101001110011000001011001111111000110101\\n\", \"11010110000100100101111110111001001010011000011011000010010100111010101000111010011101101111110001111000101000001100011101110100\\n\", \"11111111111111111111111110110111001101100111010010101101101001011100011011000111010011110010101100010001011101011010010100001000011100001101101001100010100001001010010100100001111110100110011000101100001111111011010111001011111110111101000100101001001011\\n\", \"11100010010010000110101101101100111111001010001101101001001111010110010111001011010000001100110101000101111000001111101111110010000010101110011110101101010110001100011101111011100010011101100111110010111111100110101000000111101000000000110100100101111101000110101010101101001110001110000101011010101100011100100111100010001011010010001100011111110010011010011000111000100111100010110100011010010101011011011111110100001110000011011\\n\", \"11\\n\", \"111\\n\", \"111111\\n\", \"11111\\n\", \"1111\\n\"], \"outputs\": [\"11\\n\", \"11010\\n\", \"1000\\n\", \"111111111\\n\", \"1100101011110101\\n\", \"11110010111\\n\", \"1111111011100000000\\n\", \"1111010010100001110110101110011110110100111101\\n\", \"101011111010010100111111\\n\", \"111111111\\n\", \"111111111111111111110111101001110110111111000001111110101001101001110011000001011001111111000110101\\n\", \"1110110000100100101111110111001001010011000011011000010010100111010101000111010011101101111110001111000101000001100011101110100\\n\", \"1111111111111111111111111110111001101100111010010101101101001011100011011000111010011110010101100010001011101011010010100001000011100001101101001100010100001001010010100100001111110100110011000101100001111111011010111001011111110111101000100101001001011\\n\", \"1110010010010000110101101101100111111001010001101101001001111010110010111001011010000001100110101000101111000001111101111110010000010101110011110101101010110001100011101111011100010011101100111110010111111100110101000000111101000000000110100100101111101000110101010101101001110001110000101011010101100011100100111100010001011010010001100011111110010011010011000111000100111100010110100011010010101011011011111110100001110000011011\\n\", \"1\\n\", \"11\\n\", \"11111\\n\", \"1111\\n\", \"111\\n\"]}",
"style": "rule"
} |
5d266fe7c18e142f6a9314dba0d03df9 | code | coder1_longcot | [
{
"content": "Solve the following coding problem using the programming language python:\n\nIt is so boring in the summer holiday, isn't it? So Alice and Bob have invented a new game to play. The rules are as follows. First, they get a set of n distinct integers. And then they take turns to make the following mo... | {
"ground_truth": "{\"inputs\": [\"2\\n2 3\\n\", \"2\\n5 3\\n\", \"3\\n5 6 7\\n\", \"10\\n72 96 24 66 6 18 12 30 60 48\\n\", \"10\\n78 66 6 60 18 84 36 96 72 48\\n\", \"10\\n98 63 42 56 14 77 70 35 84 21\\n\", \"2\\n1 1000000000\\n\", \"2\\n1000000000 999999999\\n\", \"3\\n2 4 6\\n\", \"2\\n4 6\\n\", \"2\\n2 6\\n\", \"2\\n6 2\\n\", \"10\\n100000000 200000000 300000000 400000000 500000000 600000000 700000000 800000000 900000000 1000000000\\n\", \"2\\n1 2\\n\", \"10\\n1 999999999 999999998 999999997 999999996 999999995 999999994 999999993 999999992 999999991\\n\", \"3\\n6 14 21\\n\", \"3\\n4 12 18\\n\", \"4\\n2 3 15 30\\n\", \"2\\n10 4\\n\"], \"outputs\": [\"Alice\\n\", \"Alice\\n\", \"Bob\\n\", \"Bob\\n\", \"Bob\\n\", \"Bob\\n\", \"Bob\\n\", \"Bob\\n\", \"Bob\\n\", \"Alice\\n\", \"Alice\\n\", \"Alice\\n\", \"Bob\\n\", \"Bob\\n\", \"Alice\\n\", \"Bob\\n\", \"Bob\\n\", \"Bob\\n\", \"Alice\\n\"]}",
"style": "rule"
} |
51d7186d50fd1c0dd446e3d3ea8b8d73 | code | coder1_longcot | [
{
"content": "Solve the following coding problem using the programming language python:\n\nMad scientist Mike does not use slow hard disks. His modification of a hard drive has not one, but n different heads that can read data in parallel.\n\nWhen viewed from the side, Mike's hard drive is an endless array of t... | {
"ground_truth": "{\"inputs\": [\"3 4\\n2 5 6\\n1 3 6 8\\n\", \"3 3\\n1 2 3\\n1 2 3\\n\", \"1 2\\n165\\n142 200\\n\", \"1 2\\n5000000000\\n1 10000000000\\n\", \"2 4\\n3 12\\n1 7 8 14\\n\", \"3 3\\n1 2 3\\n2 3 4\\n\", \"2 1\\n1 10\\n9\\n\", \"3 19\\n7 10 13\\n1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19\\n\", \"3 3\\n2 3 4\\n1 3 5\\n\", \"10 11\\n1 909090909 1818181817 2727272725 3636363633 4545454541 5454545449 6363636357 7272727265 8181818173\\n454545455 1363636363 2272727271 3181818179 4090909087 4999999995 5909090903 6818181811 7727272719 8636363627 9545454535\\n\", \"3 10\\n4999999999 5000000000 5000000001\\n1 1000 100000 1000000 4999999999 5000000000 5000000001 6000000000 8000000000 10000000000\\n\", \"2 4\\n4500000000 5500000000\\n5 499999999 5000000001 9999999995\\n\", \"10 10\\n331462447 1369967506 1504296131 2061390288 2309640071 3006707770 4530801731 4544099460 7357049371 9704808257\\n754193799 3820869903 4594383880 5685752675 6303322854 6384906441 7863448848 8542634752 9573124462 9665646063\\n\", \"1 1\\n10000000000\\n1\\n\", \"1 1\\n1\\n10000000000\\n\", \"10 10\\n9999999991 9999999992 9999999993 9999999994 9999999995 9999999996 9999999997 9999999998 9999999999 10000000000\\n1 2 3 4 5 6 7 8 9 10\\n\", \"3 12\\n477702277 4717363935 8947981095\\n477702276 477702304 477702312 477702317 4717363895 4717363896 4717363920 4717363936 8947981094 8947981111 8947981112 8947981135\\n\", \"10 10\\n389151626 1885767612 2609703695 3054567325 4421751790 5636236054 6336088034 7961001379 8631992167 9836923433\\n389144165 389158510 1885760728 1885775073 2609696234 2609710579 3054559864 3054574209 4421744329 4421758674\\n\", \"1 1\\n10000000000\\n1\\n\"], \"outputs\": [\"2\\n\", \"0\\n\", \"81\\n\", \"14999999998\\n\", \"8\\n\", \"1\\n\", \"1\\n\", \"6\\n\", \"1\\n\", \"1363636362\\n\", \"4999999999\\n\", \"5499999993\\n\", \"1840806981\\n\", \"9999999999\\n\", \"9999999999\\n\", \"9999999990\\n\", \"42\\n\", \"21229\\n\", \"9999999999\\n\"]}",
"style": "rule"
} |
c34413535a243ca8dabee630fbe76b4e | code | coder1_longcot | [
{
"content": "Solve the following coding problem using the programming language python:\n\nA schoolboy named Vasya loves reading books on programming and mathematics. He has recently read an encyclopedia article that described the method of median smoothing (or median filter) and its many applications in scienc... | {
"ground_truth": "{\"inputs\": [\"4\\n0 0 1 1\\n\", \"5\\n0 1 0 1 0\\n\", \"3\\n1 0 0\\n\", \"4\\n1 0 0 1\\n\", \"7\\n1 0 1 1 1 0 1\\n\", \"14\\n0 1 0 0 0 1 1 0 1 0 1 0 1 0\\n\", \"3\\n1 0 1\\n\", \"3\\n0 0 1\\n\", \"3\\n1 1 0\\n\", \"3\\n1 1 1\\n\", \"4\\n1 1 0 1\\n\", \"4\\n1 0 1 1\\n\", \"10\\n0 1 0 1 0 0 1 0 1 0\\n\", \"4\\n0 1 1 0\\n\", \"168\\n0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 1 0 1 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 0 1 0 1 0 1 0 1 0\\n\", \"3\\n0 1 1\\n\", \"3\\n0 0 0\\n\", \"4\\n0 1 0 1\\n\", \"3\\n0 1 0\\n\"], \"outputs\": [\"0\\n0 0 1 1\\n\", \"2\\n0 0 0 0 0\\n\", \"0\\n1 0 0\\n\", \"0\\n1 0 0 1\\n\", \"1\\n1 1 1 1 1 1 1\\n\", \"3\\n0 0 0 0 0 1 1 1 1 1 0 0 0 0\\n\", \"1\\n1 1 1\\n\", \"0\\n0 0 1\\n\", \"0\\n1 1 0\\n\", \"0\\n1 1 1\\n\", \"1\\n1 1 1 1\\n\", \"1\\n1 1 1 1\\n\", \"2\\n0 0 0 0 0 0 0 0 0 0\\n\", \"0\\n0 1 1 0\\n\", \"36\\n0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0\\n\", \"0\\n0 1 1\\n\", \"0\\n0 0 0\\n\", \"1\\n0 0 1 1\\n\", \"1\\n0 0 0\\n\"]}",
"style": "rule"
} |
0ff153c65bcdfa0ff48c248d1e888140 | code | coder1_longcot | [
{
"content": "Solve the following coding problem using the programming language python:\n\nLimak is a little bear who loves to play. Today he is playing by destroying block towers. He built n towers in a row. The i-th tower is made of h_{i} identical blocks. For clarification see picture for the first sample.\n... | {
"ground_truth": "{\"inputs\": [\"6\\n2 1 4 6 2 2\\n\", \"7\\n3 3 3 1 3 3 3\\n\", \"7\\n5128 5672 5805 5452 5882 5567 5032\\n\", \"10\\n1 2 2 3 5 5 5 4 2 1\\n\", \"14\\n20 20 20 20 20 20 3 20 20 20 20 20 20 20\\n\", \"50\\n3 2 4 3 5 3 4 5 3 2 3 3 3 4 5 4 2 2 3 3 4 4 3 2 3 3 2 3 4 4 5 2 5 2 3 5 4 4 2 2 3 5 2 5 2 2 5 4 5 4\\n\", \"1\\n1\\n\", \"1\\n1000000000\\n\", \"2\\n1 1\\n\", \"2\\n1049 1098\\n\", \"2\\n100 100\\n\", \"5\\n1 2 3 2 1\\n\", \"15\\n2 2 1 1 2 2 2 2 2 2 2 2 2 1 2\\n\", \"28\\n415546599 415546599 415546599 415546599 415546599 415546599 415546599 415546599 415546599 2 802811737 802811737 802811737 802811737 802811737 802811737 802811737 802811737 1 550595901 550595901 550595901 550595901 550595901 550595901 550595901 550595901 550595901\\n\", \"45\\n3 12 13 11 13 13 10 11 14 15 15 13 14 12 13 11 14 10 10 14 14 11 10 12 11 11 13 14 10 11 14 13 14 11 11 11 12 15 1 10 15 12 14 14 14\\n\", \"84\\n1 3 4 5 6 5 6 7 8 9 7 4 5 4 2 5 1 1 1 3 2 7 7 8 10 9 5 6 5 2 3 3 3 3 3 2 4 8 6 5 8 9 8 7 9 3 4 4 4 2 2 1 6 4 9 5 9 9 10 7 10 4 5 4 2 4 3 3 4 4 6 6 6 9 10 12 7 5 9 8 5 3 3 2\\n\", \"170\\n1 2 1 2 1 1 1 1 2 3 2 1 1 2 2 1 2 1 2 1 1 2 3 3 2 1 1 1 1 1 1 1 1 2 1 2 3 3 2 1 2 2 1 2 3 2 1 1 2 3 2 1 2 1 1 1 2 3 3 2 1 2 1 2 1 1 1 2 1 2 1 1 2 2 1 1 2 1 2 2 1 2 1 2 2 1 2 1 2 3 2 1 1 2 3 4 4 3 2 1 2 1 2 1 2 3 3 2 1 2 1 1 1 1 1 1 1 2 2 1 1 2 1 1 1 1 2 1 1 2 3 2 1 2 2 1 2 1 1 1 2 2 1 2 1 2 3 2 1 2 1 1 1 2 3 4 5 4 3 2 1 1 2 1 2 3 4 3 2 1\\n\", \"1\\n5\\n\"], \"outputs\": [\"3\\n\", \"2\\n\", \"4\\n\", \"5\\n\", \"5\\n\", \"4\\n\", \"1\\n\", \"1\\n\", \"1\\n\", \"1\\n\", \"1\\n\", \"3\\n\", \"2\\n\", \"6\\n\", \"13\\n\", \"8\\n\", \"5\\n\", \"1\\n\"]}",
"style": "rule"
} |
0ecede119f4a93897ddd3f8b9d2322f8 | code | coder1_longcot | [
{
"content": "Solve the following coding problem using the programming language python:\n\nEighth-grader Vova is on duty today in the class. After classes, he went into the office to wash the board, and found on it the number n. He asked what is this number and the teacher of mathematics Inna Petrovna answered ... | {
"ground_truth": "{\"inputs\": [\"21\\n\", \"20\\n\", \"1\\n\", \"2\\n\", \"3\\n\", \"100000001\\n\", \"1000000000\\n\", \"999999979\\n\", \"9\\n\", \"10\\n\", \"11\\n\", \"39\\n\", \"66\\n\", \"75\\n\", \"100\\n\", \"101\\n\", \"2014\\n\", \"999999994\\n\"], \"outputs\": [\"1\\n15\\n\", \"0\\n\", \"0\\n\", \"1\\n1\\n\", \"0\\n\", \"2\\n99999937\\n100000000\\n\", \"1\\n999999932\\n\", \"2\\n999999899\\n999999908\\n\", \"0\\n\", \"1\\n5\\n\", \"1\\n10\\n\", \"1\\n33\\n\", \"1\\n60\\n\", \"0\\n\", \"1\\n86\\n\", \"2\\n91\\n100\\n\", \"2\\n1988\\n2006\\n\", \"0\\n\"]}",
"style": "rule"
} |
c3fe68424d5c8380acdd9a13fb2bcd38 | code | coder1_longcot | [
{
"content": "Solve the following coding problem using the programming language python:\n\nYou are given a non-empty string s consisting of lowercase English letters. You have to pick exactly one non-empty substring of s and shift all its letters 'z' $\\rightarrow$ 'y' $\\rightarrow$ 'x' $\\rightarrow \\ldots \... | {
"ground_truth": "{\"inputs\": [\"codeforces\\n\", \"abacaba\\n\", \"babbbabaababbaa\\n\", \"bcbacaabcababaccccaaaabacbbcbbaa\\n\", \"cabaccaacccabaacdbdcbcdbccbccbabbdadbdcdcdbdbcdcdbdadcbcda\\n\", \"a\\n\", \"eeeedddccbceaabdaecaebaeaecccbdeeeaadcecdbeacecdcdcceabaadbcbbadcdaeddbcccaaeebccecaeeeaebcaaccbdaccbdcadadaaeacbbdcbaeeaecedeeeedadec\\n\", \"fddfbabadaadaddfbfecadfaefaefefabcccdbbeeabcbbddefbafdcafdfcbdffeeaffcaebbbedabddeaecdddffcbeaafffcddccccfffdbcddcfccefafdbeaacbdeeebdeaaacdfdecadfeafaeaefbfdfffeeaefebdceebcebbfeaccfafdccdcecedeedadcadbfefccfdedfaaefabbaeebdebeecaadbebcfeafbfeeefcfaecadfe\\n\", \"aaaaaaaaaa\\n\", \"abbabaaaaa\\n\", \"bbbbbbbbbbbb\\n\", \"aabaaaaaaaaaaaa\\n\", \"aaaaaaaaaaaaaaaaaaaa\\n\", \"abaabaaaaaabbaaaaaaabaaaaaaaaabaaaabaaaaaaabaaaaaaaaaabaaaaaaaaaaaaaaabaaaabbaaaaabaaaaaaaabaaaaaaaa\\n\", \"abbbbbbbabbbbbbbbbbbbbbbbbbbbbbbabbabbbbbabbbbbbbbbbbabbbbbbbbabbabbbbbbbbbbbbbbabbabbbaababbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbabbabbbbbbbbbbbbbbbbabbbbabbbbbbbbbbbbbbbabbbbbbbbbaababbbbbbbbabbbbbbbbbbbbbbbbbbbbbbbbbbbbabbbbbbbbbbbbbbbbbbbbabbabbbbbbbbbbbbbbbbabbbabbbbbaabbabbbbbbbbbbbbbbbbbbbbbbbbbbbbbabbbbbbbbbbbbbbbbaabbbbbbbbbbbbababbabbbbbbbbbbbbbbbbbbbbbbbbabbbbbbbbbbbbbbbabbbbbbbbbbbabbbbbbbbbbbbbbbbbbbbbbabbbbbbbabbbbbbb\\n\", \"aaaaa\\n\", \"aaa\\n\", \"aa\\n\"], \"outputs\": [\"bncdenqbdr\\n\", \"aaacaba\\n\", \"aabbbabaababbaa\\n\", \"abaacaabcababaccccaaaabacbbcbbaa\\n\", \"babaccaacccabaacdbdcbcdbccbccbabbdadbdcdcdbdbcdcdbdadcbcda\\n\", \"z\\n\", \"ddddcccbbabdaabdaecaebaeaecccbdeeeaadcecdbeacecdcdcceabaadbcbbadcdaeddbcccaaeebccecaeeeaebcaaccbdaccbdcadadaaeacbbdcbaeeaecedeeeedadec\\n\", \"ecceaabadaadaddfbfecadfaefaefefabcccdbbeeabcbbddefbafdcafdfcbdffeeaffcaebbbedabddeaecdddffcbeaafffcddccccfffdbcddcfccefafdbeaacbdeeebdeaaacdfdecadfeafaeaefbfdfffeeaefebdceebcebbfeaccfafdccdcecedeedadcadbfefccfdedfaaefabbaeebdebeecaadbebcfeafbfeeefcfaecadfe\\n\", \"aaaaaaaaaz\\n\", \"aaaabaaaaa\\n\", \"aaaaaaaaaaaa\\n\", \"aaaaaaaaaaaaaaa\\n\", \"aaaaaaaaaaaaaaaaaaaz\\n\", \"aaaabaaaaaabbaaaaaaabaaaaaaaaabaaaabaaaaaaabaaaaaaaaaabaaaaaaaaaaaaaaabaaaabbaaaaabaaaaaaaabaaaaaaaa\\n\", \"aaaaaaaaabbbbbbbbbbbbbbbbbbbbbbbabbabbbbbabbbbbbbbbbbabbbbbbbbabbabbbbbbbbbbbbbbabbabbbaababbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbabbabbbbbbbbbbbbbbbbabbbbabbbbbbbbbbbbbbbabbbbbbbbbaababbbbbbbbabbbbbbbbbbbbbbbbbbbbbbbbbbbbabbbbbbbbbbbbbbbbbbbbabbabbbbbbbbbbbbbbbbabbbabbbbbaabbabbbbbbbbbbbbbbbbbbbbbbbbbbbbbabbbbbbbbbbbbbbbbaabbbbbbbbbbbbababbabbbbbbbbbbbbbbbbbbbbbbbbabbbbbbbbbbbbbbbabbbbbbbbbbbabbbbbbbbbbbbbbbbbbbbbbabbbbbbbabbbbbbb\\n\", \"aaaaz\\n\", \"aaz\\n\", \"az\\n\"]}",
"style": "rule"
} |
811b158b35eac12103a102b12f10da7c | code | coder1_longcot | [
{
"content": "Solve the following coding problem using the programming language python:\n\nAfter a wonderful evening in the restaurant the time to go home came. Leha as a true gentlemen suggested Noora to give her a lift. Certainly the girl agreed with pleasure. Suddenly one problem appeared: Leha cannot find h... | {
"ground_truth": "{\"inputs\": [\"4\\n1 1 1 1 1\\n3 2 5 4 5\\n1 1 5 5 10000\\n1 4 2 5 2\\n\", \"10\\n3 7 4 10 7\\n6 1 7 10 18\\n9 6 10 8 3\\n1 8 3 10 3\\n10 4 10 5 19\\n8 9 9 10 10\\n10 1 10 5 4\\n8 1 9 4 18\\n6 3 9 5 1\\n6 6 9 6 16\\n\", \"10\\n1 1 2 2 8\\n3 4 5 9 4\\n2 10 5 10 6\\n8 5 10 8 8\\n1 2 8 2 20\\n8 6 10 8 20\\n6 7 6 7 9\\n8 5 10 10 13\\n1 8 10 9 13\\n9 8 10 9 3\\n\", \"10\\n4 4 9 8 14\\n5 5 10 10 7\\n1 1 10 5 14\\n3 5 8 9 15\\n3 2 8 7 17\\n5 1 10 6 7\\n6 6 10 10 1\\n3 3 7 10 15\\n6 6 10 10 17\\n6 5 10 9 5\\n\", \"10\\n6 2 10 9 7\\n4 3 8 7 9\\n2 1 7 9 5\\n2 6 10 10 3\\n1 4 7 8 18\\n1 2 7 6 14\\n2 6 6 10 14\\n3 1 10 9 10\\n4 6 10 10 14\\n1 6 9 10 20\\n\", \"10\\n35670 87689 78020 97199 170735\\n49603 42971 77473 79458 124936\\n94018 22571 99563 79717 79594\\n65172 72864 69350 77801 174349\\n45117 31256 60374 67497 156317\\n36047 95407 60232 98208 139099\\n32487 46904 57699 99668 80778\\n21651 59154 75570 62785 115538\\n29698 87365 74417 93703 117692\\n14164 51564 33862 97087 68406\\n\", \"10\\n51798 36533 70866 80025 119989\\n28380 14954 62643 52624 29118\\n54458 49611 75784 95421 49917\\n69985 20586 84374 81162 14398\\n65761 87545 72679 89308 70174\\n22064 89628 77685 93857 38969\\n75905 57174 86394 88214 107079\\n48955 26587 98075 76935 72945\\n69991 81288 96051 90174 75880\\n66736 31080 84603 89293 196873\\n\", \"10\\n45965 63556 68448 95894 98898\\n50414 55822 93611 81912 81281\\n51874 82624 99557 93570 17105\\n83870 83481 98209 86976 37205\\n34423 98865 81812 99559 52923\\n59982 80565 63020 90493 156405\\n73425 8598 94843 23120 95359\\n75710 49176 96524 75354 10095\\n11342 31715 50626 83343 14952\\n50673 61478 61380 81973 35755\\n\", \"10\\n39453 1588 68666 44518 80856\\n65967 37333 79860 79474 185463\\n72918 67988 88918 85752 178916\\n4960 53963 30061 77750 101446\\n68699 86791 98399 87875 166780\\n42051 5526 86018 54457 56275\\n35111 22360 46210 77033 154364\\n79350 54886 79640 66722 206\\n57162 67626 99566 96156 173141\\n42028 40518 52695 94347 188413\\n\", \"10\\n60149 83439 91672 93997 29005\\n2170 81207 33662 85253 169296\\n84242 35792 96226 46307 32764\\n48745 41099 63904 50301 99488\\n20797 58596 98423 69870 151507\\n79648 84250 95429 93302 160725\\n29270 74595 41752 87094 46279\\n97721 20075 99994 24743 121486\\n44598 9233 59399 56549 114860\\n81435 24939 83492 87248 55048\\n\", \"10\\n17273 60120 44211 66117 121362\\n38045 49581 43392 60379 106182\\n29993 28891 49459 68331 170383\\n13745 94716 99131 96384 163728\\n35994 29973 69541 91771 65364\\n93514 84168 95810 91743 60595\\n57881 7334 95096 48342 39876\\n41495 70230 56091 84188 78893\\n12540 23228 26212 81656 105752\\n83061 65904 87563 68222 150811\\n\", \"10\\n89912 38588 100000 61519 131263\\n63723 14623 74226 61508 104495\\n80783 19628 93957 60942 72631\\n49607 2064 60475 32125 43001\\n397 31798 60225 47064 161900\\n87074 8737 99607 47892 162291\\n10290 73252 84596 86607 106118\\n38621 44306 76871 87471 44012\\n26666 84711 53248 98378 27672\\n22685 36055 57791 80992 140124\\n\", \"10\\n25583 8810 71473 84303 56325\\n52527 14549 67038 87309 41381\\n85964 55620 99929 76963 34442\\n28280 87558 56450 98865 107242\\n61281 44852 99966 67445 108461\\n58298 39201 70236 74834 62161\\n54864 73811 68399 96057 132419\\n11978 85542 35272 97885 1419\\n89151 60500 99966 89149 185860\\n48390 40961 87183 97309 35887\\n\", \"10\\n1 1 100000 100000 124458\\n1 1 100000 100000 89626\\n1 1 100000 100000 42210\\n1 1 100000 100000 65721\\n1 1 100000 100000 148198\\n1 1 100000 100000 122029\\n1 1 100000 100000 50224\\n1 1 100000 100000 16314\\n1 1 100000 100000 158599\\n1 1 100000 100000 142792\\n\", \"10\\n1 1 100000 100000 73712\\n1 1 100000 100000 193808\\n1 1 100000 100000 69429\\n1 1 100000 100000 162666\\n1 1 100000 100000 94759\\n1 1 100000 100000 21899\\n1 1 100000 100000 76524\\n1 1 100000 100000 182233\\n1 1 100000 100000 125300\\n1 1 100000 100000 71258\\n\", \"10\\n63468235 40219768 326916221 835104676 1952530008\\n297013188 212688608 432392437 887776079 1462376999\\n153855395 41506149 261808021 778766232 291194343\\n238640217 22153210 642972954 719331789 371665652\\n528859722 494055455 831993741 924681396 251221747\\n19429387 475067059 567446881 908192965 1886584907\\n472431037 68414189 620339945 605371645 1906964799\\n741781008 683180935 932571485 883233060 987079989\\n557448838 174849798 875225676 549316493 360200169\\n61358988 97847347 487462496 955727516 1024792731\\n\", \"10\\n1 1 1000000000 1000000000 497721466\\n1 1 1000000000 1000000000 1096400602\\n1 1 1000000000 1000000000 1120358961\\n1 1 1000000000 1000000000 232914786\\n1 1 1000000000 1000000000 601018859\\n1 1 1000000000 1000000000 310363393\\n1 1 1000000000 1000000000 636663039\\n1 1 1000000000 1000000000 1548359129\\n1 1 1000000000 1000000000 1183677871\\n1 1 1000000000 1000000000 792703683\\n\", \"10\\n1 1 1000000000 1000000000 1477070720\\n1 1 1000000000 1000000000 1378704784\\n1 1 1000000000 1000000000 782520772\\n1 1 1000000000 1000000000 1377211731\\n1 1 1000000000 1000000000 623332716\\n1 1 1000000000 1000000000 497630560\\n1 1 1000000000 1000000000 47465148\\n1 1 1000000000 1000000000 790892344\\n1 1 1000000000 1000000000 1071836060\\n1 1 1000000000 1000000000 1949232149\\n\"], \"outputs\": [\"1\\n13\\n93\\n0\\n\", \"22\\n130\\n0\\n0\\n25\\n3\\n0\\n68\\n0\\n22\\n\", \"6\\n13\\n0\\n10\\n36\\n95\\n4\\n42\\n94\\n3\\n\", \"132\\n46\\n291\\n157\\n162\\n92\\n5\\n244\\n205\\n33\\n\", \"74\\n106\\n90\\n24\\n165\\n155\\n193\\n257\\n158\\n356\\n\", \"454444876\\n271069018\\n549471212\\n320529941\\n94517473\\n311684494\\n819172459\\n675269446\\n7036993\\n762542106\\n\", \"12182239\\n653954597\\n844386299\\n206168423\\n437228219\\n154397952\\n317840300\\n905267860\\n968243748\\n750471863\\n\", \"199194379\\n133563355\\n535853348\\n105738618\\n790969580\\n176118196\\n203632117\\n366899916\\n146517938\\n749331834\\n\", \"974201015\\n675658286\\n140222566\\n668884231\\n613269116\\n620825458\\n239625852\\n0\\n193348271\\n860068784\\n\", \"922941587\\n694484017\\n0\\n117048300\\n483223856\\n262420342\\n0\\n449352476\\n757860438\\n37418807\\n\", \"908485580\\n424476218\\n6537747\\n993909605\\n825278510\\n232753578\\n980640613\\n0\\n732434354\\n794713552\\n\", \"191639278\\n266398397\\n387687950\\n268970017\\n733430769\\n239026110\\n569640661\\n502549869\\n0\\n901026605\\n\", \"605688865\\n873699306\\n156635112\\n698424830\\n86490140\\n906905842\\n454122876\\n0\\n347292150\\n987085065\\n\", \"986777122\\n640050028\\n864029027\\n339397763\\n973589169\\n723174232\\n902088077\\n287074869\\n973589169\\n973589169\\n\", \"717056579\\n973589169\\n625066178\\n973589169\\n207662527\\n561940319\\n600480675\\n973589169\\n665222578\\n844687430\\n\", \"383784865\\n892686589\\n440520525\\n909297528\\n857306896\\n138121854\\n327512104\\n256512043\\n89816936\\n158271270\\n\", \"11780124\\n248752269\\n248752269\\n883198940\\n218155629\\n747605194\\n352461300\\n248752269\\n248752269\\n562283839\\n\", \"248752269\\n248752269\\n949069688\\n248752269\\n840885502\\n42891263\\n23378226\\n985784682\\n561979540\\n248752269\\n\"]}",
"style": "rule"
} |
f5021c47be588c5cb0a7acc990f58cf8 | code | coder1_longcot | [
{
"content": "Solve the following coding problem using the programming language python:\n\nGennady is one of the best child dentists in Berland. Today n children got an appointment with him, they lined up in front of his office.\n\nAll children love to cry loudly at the reception at the dentist. We enumerate th... | {
"ground_truth": "{\"inputs\": [\"5\\n4 2 2\\n4 1 2\\n5 2 4\\n3 3 5\\n5 1 2\\n\", \"5\\n4 5 1\\n5 3 9\\n4 1 2\\n2 1 8\\n4 1 9\\n\", \"10\\n10 7 10\\n3 6 11\\n8 4 10\\n10 1 11\\n7 3 13\\n7 2 13\\n7 6 14\\n3 4 17\\n9 4 20\\n5 2 24\\n\", \"10\\n5 6 3\\n7 4 10\\n9 1 17\\n2 8 23\\n9 10 24\\n6 8 18\\n3 2 35\\n7 6 6\\n1 3 12\\n9 9 5\\n\", \"10\\n4 9 1\\n8 2 14\\n7 10 20\\n6 9 18\\n5 3 19\\n2 9 7\\n6 8 30\\n8 7 38\\n6 5 5\\n6 9 37\\n\", \"10\\n10 3 3\\n8 6 17\\n9 5 26\\n10 7 17\\n3 10 29\\n3 1 27\\n3 3 7\\n8 10 28\\n1 3 23\\n3 4 6\\n\", \"10\\n5 6 1\\n9 2 6\\n4 1 5\\n4 10 5\\n1 8 23\\n9 4 21\\n3 9 6\\n7 8 34\\n7 4 24\\n8 9 21\\n\", \"4\\n2 10 1\\n1 2 2\\n2 1 1\\n5 5 1\\n\", \"1\\n1 1 1\\n\", \"2\\n5 1 1\\n1 1 5\\n\", \"2\\n5 1 1\\n1 1 4\\n\", \"2\\n5 1 1\\n1 1 6\\n\", \"3\\n5 1 1\\n1 1 4\\n1 1 4\\n\", \"3\\n5 1 1\\n1 1 4\\n1 1 5\\n\", \"3\\n5 1 1\\n1 1 5\\n1 1 3\\n\", \"3\\n5 1 1\\n10 1 5\\n1000 1000 14\\n\", \"10\\n9 8 8\\n2 9 33\\n10 7 42\\n7 2 18\\n3 5 82\\n9 9 25\\n3 2 86\\n3 5 49\\n5 3 72\\n4 4 71\\n\", \"10\\n9 8 8\\n2 9 8\\n10 7 16\\n7 2 9\\n3 5 23\\n9 9 25\\n3 2 35\\n3 5 36\\n5 3 40\\n4 4 42\\n\"], \"outputs\": [\"2\\n1 3 \", \"4\\n1 2 4 5 \", \"3\\n1 2 5 \", \"6\\n1 2 3 4 5 7 \", \"8\\n1 2 3 4 5 7 8 10 \", \"5\\n1 2 3 5 8 \", \"5\\n1 2 5 6 8 \", \"3\\n1 2 4 \", \"1\\n1 \", \"2\\n1 2 \", \"1\\n1 \", \"2\\n1 2 \", \"1\\n1 \", \"2\\n1 3 \", \"2\\n1 2 \", \"3\\n1 2 3 \", \"10\\n1 2 3 4 5 6 7 8 9 10 \", \"1\\n1 \"]}",
"style": "rule"
} |
fad468c4d7507192f445729d3c0cdef0 | code | coder1_longcot | [
{
"content": "Solve the following coding problem using the programming language python:\n\nYaroslav is playing a game called \"Time\". The game has a timer showing the lifespan he's got left. As soon as the timer shows 0, Yaroslav's character dies and the game ends. Also, the game has n clock stations, station ... | {
"ground_truth": "{\"inputs\": [\"3 1000\\n1000\\n0 0\\n0 1\\n0 3\\n\", \"3 1000\\n1000\\n1 0\\n1 1\\n1 2\\n\", \"5 1421\\n896 448 727\\n-19 -40\\n-87 40\\n69 51\\n-55 61\\n-7 67\\n\", \"6 1000\\n142 712 254 869\\n7 0\\n95 38\\n96 -20\\n-7 93\\n75 -45\\n-80 -20\\n\", \"7 1288\\n943 265 649 447 806\\n-4 -51\\n-26 32\\n47 -28\\n31 32\\n61 65\\n-45 -37\\n82 42\\n\", \"8 1931\\n440 627 324 538 539 119\\n-85 -41\\n-91 61\\n-84 11\\n92 -19\\n8 -5\\n16 -25\\n97 -98\\n91 78\\n\", \"9 1829\\n98 513 987 291 162 637 356\\n38 -3\\n-89 93\\n-86 45\\n-43 -84\\n-3 -87\\n53 -59\\n18 -19\\n81 -74\\n-85 32\\n\", \"10 1000\\n759 222 589 423 947 507 31 414\\n-4 -71\\n-31 -53\\n24 28\\n-13 -65\\n-59 -49\\n-42 -79\\n85 -71\\n-60 -17\\n28 66\\n74 2\\n\", \"11 1199\\n282 735 54 1000 419 939 901 789 128\\n10 -81\\n26 72\\n19 -91\\n-61 85\\n0 -33\\n-62 79\\n-59 65\\n-2 -77\\n-63 100\\n-15 53\\n94 54\\n\", \"12 1609\\n196 486 94 344 524 588 315 504 449 201\\n86 -22\\n-2 25\\n-95 -8\\n-5 -30\\n-78 71\\n5 -54\\n-69 -92\\n-41 0\\n10 19\\n61 17\\n75 -39\\n-46 22\\n\", \"3 97325\\n40\\n43 43\\n45 -95\\n-93 63\\n\", \"11 1615\\n137 681 199 33 388 585 241 518 7\\n-60 89\\n24 6\\n-100 -55\\n-26 -90\\n-40 -33\\n-100 28\\n12 34\\n-60 -13\\n38 -89\\n62 81\\n-35 54\\n\", \"4 62071\\n706 480\\n6 96\\n51 -12\\n99 66\\n-69 -61\\n\", \"12 1542\\n389 356 290 648 182 94 585 988 762 494\\n-46 96\\n1 88\\n0 95\\n-91 -100\\n-42 -29\\n45 -27\\n-52 -34\\n-62 27\\n-19 46\\n-100 95\\n5 -55\\n-36 -65\\n\", \"3 100000\\n1\\n-100 -100\\n-100 -99\\n100 100\\n\", \"12 1211\\n1 5 7 1000 1000 1000 1000 1000 1000 1000\\n1 1\\n5 5\\n3 4\\n4 3\\n0 1\\n0 2\\n0 5\\n0 7\\n1 0\\n3 0\\n8 0\\n10 10\\n\", \"6 1000\\n1000 1000 1000 1000\\n0 0\\n0 -1\\n1 -1\\n2 -1\\n2 0\\n2 1\\n\"], \"outputs\": [\"2000\\n\", \"1000\\n\", \"169099\\n\", \"107000\\n\", \"229903\\n\", \"569018\\n\", \"288982\\n\", \"151000\\n\", \"262581\\n\", \"282231\\n\", \"15182700\\n\", \"96900\\n\", \"14400472\\n\", \"263034\\n\", \"39999999\\n\", \"20220\\n\", \"1000\\n\"]}",
"style": "rule"
} |
70b847f33e91009117e6f69afc3b9d61 | code | coder1_longcot | [
{
"content": "Solve the following coding problem using the programming language python:\n\nSquirrel Liss lived in a forest peacefully, but unexpected trouble happens. Stones fall from a mountain. Initially Squirrel Liss occupies an interval [0, 1]. Next, n stones will fall and Liss will escape from the stones. ... | {
"ground_truth": "{\"inputs\": [\"llrlr\\n\", \"rrlll\\n\", \"lrlrr\\n\", \"lllrlrllrl\\n\", \"llrlrrrlrr\\n\", \"rlrrrllrrr\\n\", \"lrrlrrllrrrrllllllrr\\n\", \"rlrrrlrrrllrrllrlrll\\n\", \"lllrrlrlrllrrrrrllrl\\n\", \"rrrllrrrlllrlllrlrrr\\n\", \"rrlllrrrlrrlrrrlllrlrlrrrlllrllrrllrllrrlrlrrllllrlrrrrlrlllrlrrrlrlrllrlrlrrlrrllrrrlrlrlllrrllllrl\\n\", \"llrlrlllrrllrllllrlrrlrlrrllrlrlrrlrrrrrrlllrrlrrrrrlrrrlrlrlrrlllllrrrrllrrlrlrrrllllrlrrlrrlrlrrll\\n\", \"llrrrrllrrlllrlrllrlrllllllrrrrrrrrllrrrrrrllrlrrrlllrrrrrrlllllllrrlrrllrrrllllrrlllrrrlrlrrlrlrllr\\n\", \"lllllrllrrlllrrrllrrrrlrrlrllllrrrrrllrlrllllllrrlrllrlrllrlrrlrlrrlrrrlrrrrllrlrrrrrrrllrllrrlrllrl\\n\", \"llrlrlrlrlrlrrlllllllrllllrllrrrlllrrllrllrrlllrrlllrlrrllllrrlllrrllrrllllrrlllrlllrrrllrrrrrrllrrl\\n\", \"l\\n\", \"r\\n\"], \"outputs\": [\"3\\n5\\n4\\n2\\n1\\n\", \"1\\n2\\n5\\n4\\n3\\n\", \"2\\n4\\n5\\n3\\n1\\n\", \"4\\n6\\n9\\n10\\n8\\n7\\n5\\n3\\n2\\n1\\n\", \"3\\n5\\n6\\n7\\n9\\n10\\n8\\n4\\n2\\n1\\n\", \"1\\n3\\n4\\n5\\n8\\n9\\n10\\n7\\n6\\n2\\n\", \"2\\n3\\n5\\n6\\n9\\n10\\n11\\n12\\n19\\n20\\n18\\n17\\n16\\n15\\n14\\n13\\n8\\n7\\n4\\n1\\n\", \"1\\n3\\n4\\n5\\n7\\n8\\n9\\n12\\n13\\n16\\n18\\n20\\n19\\n17\\n15\\n14\\n11\\n10\\n6\\n2\\n\", \"4\\n5\\n7\\n9\\n12\\n13\\n14\\n15\\n16\\n19\\n20\\n18\\n17\\n11\\n10\\n8\\n6\\n3\\n2\\n1\\n\", \"1\\n2\\n3\\n6\\n7\\n8\\n12\\n16\\n18\\n19\\n20\\n17\\n15\\n14\\n13\\n11\\n10\\n9\\n5\\n4\\n\", \"1\\n2\\n6\\n7\\n8\\n10\\n11\\n13\\n14\\n15\\n19\\n21\\n23\\n24\\n25\\n29\\n32\\n33\\n36\\n39\\n40\\n42\\n44\\n45\\n50\\n52\\n53\\n54\\n55\\n57\\n61\\n63\\n64\\n65\\n67\\n69\\n72\\n74\\n76\\n77\\n79\\n80\\n83\\n84\\n85\\n87\\n89\\n93\\n94\\n99\\n100\\n98\\n97\\n96\\n95\\n92\\n91\\n90\\n88\\n86\\n82\\n81\\n78\\n75\\n73\\n71\\n70\\n68\\n66\\n62\\n60\\n59\\n58\\n56\\n51\\n49\\n48\\n47\\n46\\n43\\n41\\n38\\n37\\n35\\n34\\n31\\n30\\n28\\n27\\n26\\n22\\n20\\n18\\n17\\n16\\n12\\n9\\n5\\n4\\n3\\n\", \"3\\n5\\n9\\n10\\n13\\n18\\n20\\n21\\n23\\n25\\n26\\n29\\n31\\n33\\n34\\n36\\n37\\n38\\n39\\n40\\n41\\n45\\n46\\n48\\n49\\n50\\n51\\n52\\n54\\n55\\n56\\n58\\n60\\n62\\n63\\n69\\n70\\n71\\n72\\n75\\n76\\n78\\n80\\n81\\n82\\n87\\n89\\n90\\n92\\n93\\n95\\n97\\n98\\n100\\n99\\n96\\n94\\n91\\n88\\n86\\n85\\n84\\n83\\n79\\n77\\n74\\n73\\n68\\n67\\n66\\n65\\n64\\n61\\n59\\n57\\n53\\n47\\n44\\n43\\n42\\n35\\n32\\n30\\n28\\n27\\n24\\n22\\n19\\n17\\n16\\n15\\n14\\n12\\n11\\n8\\n7\\n6\\n4\\n2\\n1\\n\", \"3\\n4\\n5\\n6\\n9\\n10\\n14\\n16\\n19\\n21\\n28\\n29\\n30\\n31\\n32\\n33\\n34\\n35\\n38\\n39\\n40\\n41\\n42\\n43\\n46\\n48\\n49\\n50\\n54\\n55\\n56\\n57\\n58\\n59\\n67\\n68\\n70\\n71\\n74\\n75\\n76\\n81\\n82\\n86\\n87\\n88\\n90\\n92\\n93\\n95\\n97\\n100\\n99\\n98\\n96\\n94\\n91\\n89\\n85\\n84\\n83\\n80\\n79\\n78\\n77\\n73\\n72\\n69\\n66\\n65\\n64\\n63\\n62\\n61\\n60\\n53\\n52\\n51\\n47\\n45\\n44\\n37\\n36\\n27\\n26\\n25\\n24\\n23\\n22\\n20\\n18\\n17\\n15\\n13\\n12\\n11\\n8\\n7\\n2\\n1\\n\", \"6\\n9\\n10\\n14\\n15\\n16\\n19\\n20\\n21\\n22\\n24\\n25\\n27\\n32\\n33\\n34\\n35\\n36\\n39\\n41\\n48\\n49\\n51\\n54\\n56\\n59\\n61\\n62\\n64\\n66\\n67\\n69\\n70\\n71\\n73\\n74\\n75\\n76\\n79\\n81\\n82\\n83\\n84\\n85\\n86\\n87\\n90\\n93\\n94\\n96\\n99\\n100\\n98\\n97\\n95\\n92\\n91\\n89\\n88\\n80\\n78\\n77\\n72\\n68\\n65\\n63\\n60\\n58\\n57\\n55\\n53\\n52\\n50\\n47\\n46\\n45\\n44\\n43\\n42\\n40\\n38\\n37\\n31\\n30\\n29\\n28\\n26\\n23\\n18\\n17\\n13\\n12\\n11\\n8\\n7\\n5\\n4\\n3\\n2\\n1\\n\", \"3\\n5\\n7\\n9\\n11\\n13\\n14\\n22\\n27\\n30\\n31\\n32\\n36\\n37\\n40\\n43\\n44\\n48\\n49\\n53\\n55\\n56\\n61\\n62\\n66\\n67\\n70\\n71\\n76\\n77\\n81\\n85\\n86\\n87\\n90\\n91\\n92\\n93\\n94\\n95\\n98\\n99\\n100\\n97\\n96\\n89\\n88\\n84\\n83\\n82\\n80\\n79\\n78\\n75\\n74\\n73\\n72\\n69\\n68\\n65\\n64\\n63\\n60\\n59\\n58\\n57\\n54\\n52\\n51\\n50\\n47\\n46\\n45\\n42\\n41\\n39\\n38\\n35\\n34\\n33\\n29\\n28\\n26\\n25\\n24\\n23\\n21\\n20\\n19\\n18\\n17\\n16\\n15\\n12\\n10\\n8\\n6\\n4\\n2\\n1\\n\", \"1\\n\", \"1\\n\"]}",
"style": "rule"
} |
06f05ea33743355af9697660fb9f09da | code | coder1_longcot | [
{
"content": "Solve the following coding problem using the programming language python:\n\nDreamoon likes coloring cells very much.\n\nThere is a row of $n$ cells. Initially, all cells are empty (don't contain any color). Cells are numbered from $1$ to $n$.\n\nYou are given an integer $m$ and $m$ integers $l_1,... | {
"ground_truth": "{\"inputs\": [\"5 3\\n3 2 2\\n\", \"10 1\\n1\\n\", \"1 1\\n1\\n\", \"2 2\\n1 2\\n\", \"200 50\\n49 35 42 47 134 118 14 148 58 159 33 33 8 123 99 126 75 94 1 141 61 79 122 31 48 7 66 97 141 43 25 141 7 56 120 55 49 37 154 56 13 59 153 133 18 1 141 24 151 125\\n\", \"3 3\\n3 3 1\\n\", \"100000 1\\n100000\\n\", \"2000 100\\n5 128 1368 1679 1265 313 1854 1512 1924 338 38 1971 238 1262 1834 1878 1749 784 770 1617 191 395 303 214 1910 1300 741 1966 1367 24 268 403 1828 1033 1424 218 1146 925 1501 1760 1164 1881 1628 1596 1358 1360 29 1343 922 618 1537 1839 1114 1381 704 464 692 1450 1590 1121 670 300 1053 1730 1024 1292 1549 1112 1028 1096 794 38 1121 261 618 1489 587 1841 627 707 1693 1693 1867 1402 803 321 475 410 1664 1491 1846 1279 1250 457 1010 518 1785 514 1656 1588\\n\", \"10000 3\\n3376 5122 6812\\n\", \"99999 30\\n31344 14090 93157 5965 57557 41264 93881 58871 57763 46958 96029 37297 75623 12215 38442 86773 66112 7512 31968 28331 90390 79301 56205 704 15486 63054 83372 45602 15573 78459\\n\", \"100000 10\\n31191 100000 99999 99999 99997 100000 99996 99994 99995 99993\\n\", \"1000 2\\n1 1\\n\", \"10 3\\n1 9 2\\n\", \"6 3\\n2 2 6\\n\", \"100 3\\n45 10 45\\n\", \"6 3\\n1 2 2\\n\", \"9 3\\n9 3 1\\n\"], \"outputs\": [\"1 2 4\\n\", \"-1\\n\", \"1\\n\", \"-1\\n\", \"1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 76\\n\", \"-1\\n\", \"1\\n\", \"1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 413\\n\", \"1 2 3189\\n\", \"1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 5968 21541\\n\", \"-1\\n\", \"-1\\n\", \"1 2 9\\n\", \"-1\\n\", \"1 46 56\\n\", \"-1\\n\", \"1 6 9\\n\"]}",
"style": "rule"
} |
60983c5a237c58f8c7adfd7090660001 | code | coder1_longcot | [
{
"content": "Solve the following coding problem using the programming language python:\n\nYou work in a big office. It is a 9 floor building with an elevator that can accommodate up to 4 people. It is your responsibility to manage this elevator.\n\nToday you are late, so there are queues on some floors already... | {
"ground_truth": "{\"inputs\": [\"2\\n3 5\\n5 3\\n\", \"2\\n5 3\\n3 5\\n\", \"9\\n1 2\\n2 3\\n3 4\\n4 5\\n5 6\\n6 7\\n7 8\\n8 9\\n9 1\\n\", \"50\\n9 5\\n2 6\\n5 4\\n7 5\\n3 6\\n5 8\\n1 2\\n6 1\\n9 7\\n8 1\\n9 5\\n6 8\\n6 8\\n2 8\\n4 9\\n6 7\\n7 8\\n5 8\\n1 2\\n9 2\\n5 9\\n6 7\\n3 2\\n9 8\\n7 8\\n7 4\\n6 5\\n1 7\\n6 5\\n2 6\\n3 1\\n6 5\\n3 7\\n9 3\\n8 1\\n8 3\\n8 2\\n1 9\\n9 2\\n3 2\\n8 7\\n5 1\\n6 2\\n2 1\\n6 1\\n3 4\\n4 1\\n2 3\\n2 6\\n2 9\\n\", \"50\\n8 9\\n6 7\\n6 8\\n4 1\\n3 2\\n9 3\\n8 3\\n9 7\\n4 6\\n4 6\\n5 6\\n7 2\\n6 3\\n1 3\\n8 2\\n4 6\\n6 8\\n7 6\\n8 6\\n9 4\\n8 6\\n9 1\\n3 8\\n3 1\\n4 7\\n4 9\\n9 1\\n7 4\\n3 5\\n1 7\\n3 5\\n8 9\\n5 4\\n2 9\\n2 9\\n3 9\\n8 5\\n4 9\\n9 4\\n5 6\\n6 1\\n4 2\\n3 9\\n9 1\\n9 4\\n4 5\\n2 4\\n2 6\\n3 6\\n1 9\\n\", \"50\\n3 9\\n8 9\\n7 2\\n9 1\\n5 2\\n2 8\\n2 4\\n8 6\\n4 6\\n1 6\\n5 3\\n3 8\\n8 2\\n6 7\\n7 1\\n2 4\\n2 8\\n3 7\\n7 1\\n7 9\\n9 3\\n7 2\\n2 7\\n8 4\\n5 8\\n6 8\\n7 1\\n7 5\\n5 6\\n9 1\\n8 6\\n3 6\\n7 6\\n4 3\\n3 2\\n9 2\\n4 9\\n2 1\\n7 9\\n1 8\\n4 9\\n5 2\\n7 2\\n9 8\\n3 1\\n4 5\\n3 4\\n2 7\\n2 1\\n6 1\\n\", \"50\\n7 1\\n4 8\\n9 3\\n9 3\\n2 4\\n5 9\\n1 5\\n1 4\\n7 6\\n4 8\\n3 6\\n2 8\\n5 1\\n8 9\\n7 4\\n7 2\\n2 4\\n7 9\\n8 7\\n3 8\\n1 7\\n4 5\\n7 2\\n6 4\\n6 1\\n4 8\\n5 6\\n4 3\\n6 5\\n6 4\\n6 9\\n2 5\\n9 3\\n3 4\\n3 4\\n9 3\\n7 9\\n5 8\\n1 6\\n5 1\\n8 3\\n7 4\\n1 8\\n5 2\\n1 7\\n6 1\\n9 6\\n3 1\\n6 5\\n9 7\\n\", \"50\\n1 9\\n9 4\\n4 2\\n2 4\\n3 8\\n9 5\\n3 2\\n8 3\\n8 1\\n4 7\\n5 3\\n2 6\\n1 8\\n6 5\\n4 1\\n5 7\\n1 4\\n4 7\\n5 4\\n8 2\\n4 6\\n8 7\\n1 9\\n1 6\\n6 4\\n5 2\\n5 3\\n2 6\\n4 6\\n5 2\\n6 7\\n5 3\\n9 5\\n8 3\\n1 9\\n2 6\\n5 1\\n7 3\\n4 3\\n7 2\\n4 3\\n5 7\\n6 8\\n8 2\\n3 6\\n4 9\\n1 8\\n7 8\\n5 4\\n7 6\\n\", \"50\\n5 9\\n1 2\\n6 9\\n1 6\\n8 1\\n5 3\\n2 1\\n2 7\\n6 1\\n4 3\\n6 1\\n2 6\\n2 8\\n2 1\\n3 4\\n6 2\\n4 8\\n6 4\\n2 1\\n1 5\\n4 9\\n6 8\\n4 1\\n1 6\\n1 5\\n5 9\\n2 6\\n6 9\\n4 2\\n4 7\\n8 2\\n4 6\\n2 5\\n9 4\\n3 1\\n8 4\\n3 9\\n1 3\\n2 3\\n8 7\\n5 4\\n2 6\\n9 5\\n6 2\\n5 8\\n2 8\\n8 9\\n9 2\\n5 3\\n9 1\\n\", \"50\\n9 8\\n8 9\\n2 3\\n2 6\\n7 6\\n9 8\\n7 5\\n8 5\\n2 9\\n4 2\\n4 6\\n9 4\\n1 9\\n4 8\\n7 9\\n7 4\\n4 7\\n7 6\\n8 9\\n2 8\\n1 3\\n6 7\\n6 3\\n1 8\\n9 3\\n4 9\\n9 6\\n4 2\\n6 5\\n3 8\\n9 3\\n7 5\\n9 6\\n5 6\\n4 7\\n5 7\\n9 1\\n7 5\\n5 6\\n3 1\\n4 3\\n7 1\\n9 8\\n7 8\\n3 7\\n8 3\\n9 6\\n5 7\\n1 8\\n6 4\\n\", \"9\\n2 1\\n5 9\\n2 6\\n2 6\\n4 7\\n7 3\\n3 1\\n3 1\\n7 8\\n\", \"5\\n1 7\\n2 5\\n8 6\\n3 4\\n1 6\\n\", \"4\\n2 1\\n1 7\\n5 8\\n8 4\\n\", \"1\\n1 9\\n\", \"1\\n9 1\\n\", \"1\\n1 5\\n\", \"1\\n8 6\\n\"], \"outputs\": [\"10\", \"12\", \"34\", \"278\", \"252\", \"260\", \"274\", \"258\", \"282\", \"275\", \"46\", \"29\", \"21\", \"10\", \"18\", \"6\", \"11\"]}",
"style": "rule"
} |
7e437f40a9c6a1c8cc0450a60244fa24 | code | coder1_longcot | [
{
"content": "Solve the following coding problem using the programming language python:\n\nToad Zitz has an array of integers, each integer is between $0$ and $m-1$ inclusive. The integers are $a_1, a_2, \\ldots, a_n$.\n\nIn one operation Zitz can choose an integer $k$ and $k$ indices $i_1, i_2, \\ldots, i_k$ s... | {
"ground_truth": "{\"inputs\": [\"5 3\\n0 0 0 1 2\\n\", \"5 7\\n0 6 1 3 2\\n\", \"10 10\\n5 0 5 9 4 6 4 5 0 0\\n\", \"4 6\\n0 3 5 1\\n\", \"6 4\\n1 3 0 2 1 0\\n\", \"10 1000\\n981 824 688 537 969 72 39 734 929 718\\n\", \"10 300000\\n111862 91787 271781 182224 260248 142019 30716 102643 141870 19206\\n\", \"100 10\\n8 4 4 9 0 7 9 5 1 1 2 3 7 1 8 4 8 8 6 0 8 7 8 3 7 0 6 4 8 4 2 7 0 0 3 8 4 4 2 0 0 4 7 2 4 7 9 1 3 3 6 2 9 6 0 6 3 5 6 5 5 3 0 0 8 7 1 4 2 4 1 3 9 7 9 0 6 6 7 4 2 3 7 1 7 3 5 1 4 3 7 5 7 5 0 5 1 9 0 9\\n\", \"100 1\\n0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0\\n\", \"100 2\\n1 1 0 1 0 1 0 0 0 1 0 1 0 0 1 1 1 1 1 0 1 1 1 1 1 1 0 0 0 1 1 0 1 0 0 0 0 0 1 1 1 1 1 0 0 0 0 1 1 1 1 0 1 0 0 1 0 0 1 0 1 0 1 1 1 0 1 1 0 1 1 0 1 0 0 0 1 0 1 1 0 1 1 0 1 0 1 0 0 0 0 0 1 0 0 0 0 1 1 1\\n\", \"100 1000\\n980 755 745 448 424 691 210 545 942 979 555 783 425 942 495 741 487 514 752 434 187 874 372 617 414 505 659 445 81 397 243 986 441 587 31 350 831 801 194 103 723 166 108 182 252 846 328 905 639 690 738 638 986 340 559 626 572 808 442 410 179 549 880 153 449 99 434 945 163 687 173 797 999 274 975 626 778 456 407 261 988 43 25 391 937 856 54 110 884 937 940 205 338 250 903 244 424 871 979 810\\n\", \"1 1\\n0\\n\", \"10 10\\n1 2 3 4 5 6 7 8 9 0\\n\", \"2 1\\n0 0\\n\", \"2 2\\n0 1\\n\", \"2 2\\n1 0\\n\"], \"outputs\": [\"0\\n\", \"1\\n\", \"6\\n\", \"3\\n\", \"2\\n\", \"463\\n\", \"208213\\n\", \"8\\n\", \"0\\n\", \"1\\n\", \"860\\n\", \"0\\n\", \"9\\n\", \"0\\n\", \"0\\n\", \"1\\n\"]}",
"style": "rule"
} |
4331e6a5fd972d9e49d9a6cbeb31dd95 | code | coder1_longcot | [
{
"content": "Solve the following coding problem using the programming language python:\n\nThe life goes up and down, just like nice sequences. Sequence t_1, t_2, ..., t_{n} is called nice if the following two conditions are satisfied: t_{i} < t_{i} + 1 for each odd i < n; t_{i} > t_{i} + 1 for each even i <... | {
"ground_truth": "{\"inputs\": [\"5\\n2 8 4 7 7\\n\", \"4\\n200 150 100 50\\n\", \"10\\n3 2 1 4 1 4 1 4 1 4\\n\", \"9\\n1 2 3 4 5 6 7 8 9\\n\", \"5\\n1 1 1 4 3\\n\", \"10\\n7 7 8 10 5 10 1 5 2 6\\n\", \"50\\n11836 28308 72527 92281 139289 93797 134555 148444 40866 111317 21564 87813 65466 20541 99238 2287 74647 128071 18163 61672 39766 55589 138385 147443 138100 142683 60703 15444 52566 72976 147412 116006 115986 110545 79993 100440 9876 71470 75209 62443 64906 88987 72232 2246 63160 45041 729 148611 103397 78474\\n\", \"10\\n522 309 276 454 566 978 175 388 289 276\\n\", \"20\\n8 9 1 10 7 9 5 8 5 7 5 6 1 3 2 7 3 2 6 9\\n\", \"25\\n25 20 58 95 47 68 38 39 24 83 36 68 28 67 25 40 62 99 11 88 74 75 38 90 42\\n\", \"30\\n18647 31594 58075 122543 49766 65303 48728 102863 22542 140297 5300 90685 50141 86948 27074 40214 17945 147095 97758 140835 121469 139920 63817 138623 85609 110002 70046 128002 122139 116109\\n\", \"39\\n18329 39326 21115 36341 3916 40060 23262 41923 17476 42107 17052 23198 10756 32540 14873 28454 23912 35765 9459 45834 85 46756 31859 40087 35420 47585 9781 46544 31859 49453 7394 17459 2816 34051 12519 4077 692 44098 23345\\n\", \"2\\n5 1\\n\", \"2\\n10 10\\n\", \"6\\n1 1 1 2 2 2\\n\", \"12\\n10 15 10 15 10 8 10 15 10 20 30 20\\n\"], \"outputs\": [\"2\\n\", \"1\\n\", \"8\\n\", \"0\\n\", \"1\\n\", \"2\\n\", \"0\\n\", \"0\\n\", \"3\\n\", \"1\\n\", \"1\\n\", \"15\\n\", \"1\\n\", \"0\\n\", \"1\\n\", \"1\\n\"]}",
"style": "rule"
} |
168294c0edec72a1057446a83d8e34c8 | code | coder1_longcot | [
{
"content": "Solve the following coding problem using the programming language python:\n\nVasya's telephone contains n photos. Photo number 1 is currently opened on the phone. It is allowed to move left and right to the adjacent photo by swiping finger over the screen. If you swipe left from the first photo, y... | {
"ground_truth": "{\"inputs\": [\"4 2 3 10\\nwwhw\\n\", \"5 2 4 13\\nhhwhh\\n\", \"5 2 4 1000\\nhhwhh\\n\", \"3 1 100 10\\nwhw\\n\", \"10 2 3 32\\nhhwwhwhwwh\\n\", \"1 2 3 3\\nw\\n\", \"100 20 100 10202\\nwwwwhhwhhwhhwhhhhhwwwhhhwwwhwwhwhhwwhhwwwhwwhwwwhwhwhwwhhhwhwhhwhwwhhwhwhwwwhwwwwhwhwwwwhwhhhwhwhwww\\n\", \"20 10 10 1\\nhwhwhwhwhwhwhwhwhhhw\\n\", \"12 10 10 1\\nwhwhwhwhwhwh\\n\", \"2 5 5 1000000000\\nwh\\n\", \"16 1 1000 2100\\nhhhwwwhhhwhhhwww\\n\", \"5 2 4 13\\nhhhwh\\n\", \"7 1 1000 13\\nhhhhwhh\\n\", \"10 1 1000 10\\nhhhhhhwwhh\\n\", \"7 1 100 8\\nhhhwwwh\\n\", \"5 2 4 12\\nhhhwh\\n\"], \"outputs\": [\"2\\n\", \"4\\n\", \"5\\n\", \"0\\n\", \"7\\n\", \"0\\n\", \"100\\n\", \"1\\n\", \"0\\n\", \"2\\n\", \"5\\n\", \"4\\n\", \"6\\n\", \"5\\n\", \"4\\n\", \"4\\n\"]}",
"style": "rule"
} |
7073b9e4a70b147bfa32fae21323bd44 | code | coder1_longcot | [
{
"content": "Solve the following coding problem using the programming language python:\n\nDoubly linked list is one of the fundamental data structures. A doubly linked list is a sequence of elements, each containing information about the previous and the next elements of the list. In this problem all lists hav... | {
"ground_truth": "{\"inputs\": [\"7\\n4 7\\n5 0\\n0 0\\n6 1\\n0 2\\n0 4\\n1 0\\n\", \"2\\n2 0\\n0 1\\n\", \"1\\n0 0\\n\", \"4\\n0 2\\n1 0\\n0 4\\n3 0\\n\", \"5\\n0 0\\n0 0\\n0 0\\n0 0\\n0 0\\n\", \"2\\n0 0\\n0 0\\n\", \"2\\n0 2\\n1 0\\n\", \"5\\n5 3\\n4 0\\n1 4\\n3 2\\n0 1\\n\", \"5\\n2 0\\n0 1\\n0 4\\n3 5\\n4 0\\n\", \"5\\n3 4\\n0 0\\n0 1\\n1 0\\n0 0\\n\", \"5\\n3 0\\n0 0\\n0 1\\n0 0\\n0 0\\n\", \"10\\n7 5\\n5 0\\n4 7\\n10 3\\n1 2\\n0 9\\n3 1\\n9 10\\n6 8\\n8 4\\n\", \"10\\n6 2\\n1 0\\n9 4\\n3 6\\n10 8\\n4 1\\n0 10\\n5 0\\n0 3\\n7 5\\n\", \"10\\n0 9\\n4 0\\n5 0\\n7 2\\n0 3\\n8 10\\n0 4\\n0 6\\n1 0\\n6 0\\n\", \"10\\n7 0\\n0 0\\n0 0\\n0 0\\n0 0\\n0 0\\n0 1\\n0 0\\n0 0\\n0 0\\n\", \"10\\n0 0\\n0 0\\n0 0\\n0 0\\n0 0\\n0 0\\n0 0\\n0 0\\n0 0\\n0 0\\n\"], \"outputs\": [\"4 7\\n5 6\\n0 5\\n6 1\\n3 2\\n2 4\\n1 0\\n\", \"2 0\\n0 1\\n\", \"0 0\\n\", \"0 2\\n1 3\\n2 4\\n3 0\\n\", \"0 2\\n1 3\\n2 4\\n3 5\\n4 0\\n\", \"0 2\\n1 0\\n\", \"0 2\\n1 0\\n\", \"5 3\\n4 0\\n1 4\\n3 2\\n0 1\\n\", \"2 3\\n0 1\\n1 4\\n3 5\\n4 0\\n\", \"3 4\\n0 3\\n2 1\\n1 5\\n4 0\\n\", \"3 4\\n0 3\\n2 1\\n1 5\\n4 0\\n\", \"7 5\\n5 0\\n4 7\\n10 3\\n1 2\\n0 9\\n3 1\\n9 10\\n6 8\\n8 4\\n\", \"6 2\\n1 0\\n9 4\\n3 6\\n10 8\\n4 1\\n0 10\\n5 9\\n8 3\\n7 5\\n\", \"0 9\\n4 8\\n5 7\\n7 2\\n9 3\\n8 10\\n3 4\\n2 6\\n1 5\\n6 0\\n\", \"7 8\\n0 3\\n2 4\\n3 5\\n4 6\\n5 7\\n6 1\\n1 9\\n8 10\\n9 0\\n\", \"0 2\\n1 3\\n2 4\\n3 5\\n4 6\\n5 7\\n6 8\\n7 9\\n8 10\\n9 0\\n\"]}",
"style": "rule"
} |
ac13aba5a034cdeedc18218906a991eb | code | coder1_longcot | [
{
"content": "Solve the following coding problem using the programming language python:\n\nHooray! Berl II, the king of Berland is making a knight tournament. The king has already sent the message to all knights in the kingdom and they in turn agreed to participate in this grand event.\n\nAs for you, you're jus... | {
"ground_truth": "{\"inputs\": [\"4 3\\n1 2 1\\n1 3 3\\n1 4 4\\n\", \"8 4\\n3 5 4\\n3 7 6\\n2 8 8\\n1 8 1\\n\", \"2 1\\n1 2 1\\n\", \"2 1\\n1 2 2\\n\", \"3 1\\n1 3 1\\n\", \"3 1\\n1 3 2\\n\", \"3 1\\n1 3 3\\n\", \"3 2\\n1 2 1\\n1 3 3\\n\", \"3 2\\n1 2 2\\n1 3 2\\n\", \"3 2\\n2 3 3\\n1 3 3\\n\", \"11 6\\n1 2 2\\n7 8 7\\n3 4 4\\n6 9 6\\n5 10 10\\n2 11 11\\n\", \"10 6\\n9 10 10\\n6 7 7\\n2 4 2\\n2 5 5\\n1 7 5\\n4 10 8\\n\", \"11 8\\n3 5 5\\n8 9 9\\n4 6 6\\n8 10 10\\n5 7 7\\n2 7 2\\n10 11 11\\n1 11 1\\n\", \"10 7\\n7 8 7\\n7 9 9\\n5 9 5\\n5 10 10\\n1 2 2\\n3 4 4\\n2 10 4\\n\", \"11 5\\n8 10 9\\n6 10 7\\n6 11 11\\n3 5 5\\n1 11 1\\n\", \"10 6\\n6 7 6\\n5 7 5\\n3 7 4\\n2 8 2\\n2 10 10\\n1 10 10\\n\", \"11 7\\n7 8 8\\n5 6 5\\n1 3 3\\n7 9 9\\n5 10 10\\n10 11 11\\n1 11 4\\n\", \"10 7\\n8 9 9\\n3 4 3\\n2 3 2\\n1 5 2\\n6 7 6\\n6 10 10\\n1 10 10\\n\", \"11 6\\n1 2 1\\n8 9 9\\n3 5 5\\n3 6 6\\n9 10 10\\n1 11 10\\n\", \"10 5\\n1 2 1\\n8 10 8\\n3 6 4\\n4 7 7\\n1 8 7\\n\", \"4 3\\n1 2 2\\n1 3 3\\n1 4 4\\n\"], \"outputs\": [\"3 1 4 0 \", \"0 8 4 6 4 8 6 1 \", \"0 1 \", \"2 0 \", \"0 1 1 \", \"2 0 2 \", \"3 3 0 \", \"3 1 0 \", \"2 0 2 \", \"3 3 0 \", \"2 11 4 11 10 10 6 7 6 11 0 \", \"5 5 2 2 8 7 5 0 10 8 \", \"0 1 5 5 6 7 2 9 10 11 1 \", \"2 4 4 0 10 5 9 7 5 4 \", \"0 1 5 5 1 7 11 9 7 9 1 \", \"10 10 4 2 4 5 6 2 10 0 \", \"3 3 4 0 10 5 8 9 10 11 4 \", \"2 10 2 3 2 10 6 9 10 0 \", \"10 1 5 5 6 10 10 9 10 0 10 \", \"7 1 4 7 4 4 0 7 8 8 \", \"2 3 4 0 \"]}",
"style": "rule"
} |
814ceb45da90093109cab93ae473ea9d | code | coder1_longcot | [
{
"content": "Solve the following coding problem using the programming language python:\n\nWe all know the impressive story of Robin Hood. Robin Hood uses his archery skills and his wits to steal the money from rich, and return it to the poor.\n\nThere are n citizens in Kekoland, each person has c_{i} coins. Ea... | {
"ground_truth": "{\"inputs\": [\"4 1\\n1 1 4 2\\n\", \"3 1\\n2 2 2\\n\", \"10 20\\n6 4 7 10 4 5 5 3 7 10\\n\", \"30 7\\n3 3 2 2 2 2 3 4 4 5 2 1 1 5 5 3 4 3 2 1 3 4 3 2 2 5 2 5 1 2\\n\", \"2 0\\n182 2\\n\", \"123 54564\\n38 44 41 42 59 3 95 15 45 32 44 69 35 83 94 57 65 85 64 47 24 20 34 86 26 91 98 12 36 96 80 4 70 40 95 38 70 22 58 50 34 84 80 45 14 60 61 43 11 56 19 59 50 63 21 15 97 98 27 13 9 71 32 18 90 10 2 99 75 87 74 83 79 37 89 3 49 27 92 95 49 1 26 50 72 75 81 37 60 98 28 28 10 93 99 63 14 26 69 51 47 59 42 7 20 17 75 44 44 20 44 85 27 32 65 95 47 46 12 22 64 77 21\\n\", \"111 10\\n2 8 6 1 3 5 8 3 8 2 9 9 6 9 8 8 5 2 3 8 8 3 8 3 7 9 4 3 9 7 1 8 3 1 5 5 5 8 2 4 2 7 9 1 4 4 3 1 6 7 7 4 1 3 5 3 9 4 4 4 8 8 7 3 5 6 3 3 8 2 8 4 5 8 1 8 4 1 7 1 4 9 8 9 7 6 5 6 3 7 4 8 9 3 8 9 9 3 5 9 1 3 6 8 9 1 1 3 8 7 6\\n\", \"10 1000000\\n307196 650096 355966 710719 99165 959865 500346 677478 614586 6538\\n\", \"5 1000000\\n145119584 42061308 953418415 717474449 57984109\\n\", \"100 20\\n2 5 3 3 2 7 6 2 2 2 6 7 2 1 8 10 2 4 10 6 10 2 1 1 4 7 1 2 9 7 5 3 7 4 6 3 10 10 3 7 6 8 2 2 10 3 1 2 1 3 1 6 3 1 4 10 3 10 9 5 10 4 3 10 3 3 5 3 10 2 1 5 10 7 8 7 7 2 4 2 1 3 3 8 8 5 7 3 1 1 8 10 5 7 4 4 7 7 1 9\\n\", \"10 1000\\n1000000000 999999994 999999992 1000000000 999999994 999999999 999999990 999999997 999999995 1000000000\\n\", \"2 100000\\n1 3\\n\", \"4 0\\n1 4 4 4\\n\", \"4 42\\n1 1 1 1000000000\\n\", \"3 4\\n1 2 7\\n\", \"4 100\\n1 1 10 10\\n\"], \"outputs\": [\"2\\n\", \"0\\n\", \"1\\n\", \"2\\n\", \"180\\n\", \"1\\n\", \"8\\n\", \"80333\\n\", \"909357107\\n\", \"7\\n\", \"1\\n\", \"0\\n\", \"3\\n\", \"999999943\\n\", \"1\\n\", \"1\\n\"]}",
"style": "rule"
} |
7020d70dd984ee91d79435196e77e78b | code | coder1_longcot | [
{
"content": "Solve the following coding problem using the programming language python:\n\nBob recently read about bitwise operations used in computers: AND, OR and XOR. He have studied their properties and invented a new game.\n\nInitially, Bob chooses integer m, bit depth of the game, which means that all num... | {
"ground_truth": "{\"inputs\": [\"3 3\\na := 101\\nb := 011\\nc := ? XOR b\\n\", \"5 1\\na := 1\\nbb := 0\\ncx := ? OR a\\nd := ? XOR ?\\ne := d AND bb\\n\", \"2 10\\nb := 0100101101\\na := ? XOR b\\n\", \"1 10\\na := 0110110011\\n\", \"1 6\\na := ? OR ?\\n\", \"13 6\\na := 111010\\nb := 100100\\nc := 001110\\nd := b AND b\\ne := c AND ?\\nf := e OR c\\ng := 011110\\nh := d XOR ?\\ni := 010111\\nj := 000011\\nk := d OR ?\\nl := 011101\\nm := b OR j\\n\", \"16 3\\na := 011\\nb := 110\\nc := a XOR b\\nd := 110\\ne := a XOR b\\nf := b XOR a\\ng := b XOR e\\nh := 111\\ni := a XOR h\\nj := f XOR ?\\nk := 100\\nl := 000\\nm := 100\\nn := 110\\no := 110\\np := 110\\n\", \"29 2\\naa := 10\\nba := 11\\nca := 01\\nda := aa AND ?\\nea := ba OR ?\\nfa := da XOR ?\\nga := 11\\nha := fa XOR ea\\nia := 01\\nja := ca OR ha\\nka := ha XOR ia\\nla := ha OR ?\\nma := ba AND ba\\nna := ma OR ?\\noa := 11\\npa := oa OR ba\\nqa := 00\\nra := qa AND ia\\nsa := fa OR ?\\nta := ha OR ga\\nua := 00\\nva := 00\\nwa := 11\\nxa := 10\\nya := ja XOR ?\\nza := 00\\nab := 00\\nbb := pa OR qa\\ncb := bb AND ?\\n\", \"10 3\\na := 011\\nb := ? OR a\\nc := 000\\nd := ? AND c\\ne := 101\\nf := ? AND e\\ng := 001\\nh := ? XOR g\\ni := 001\\nj := ? XOR i\\n\", \"12 3\\na := 101\\nb := a XOR ?\\nc := b XOR b\\nd := b XOR a\\ne := c XOR ?\\nf := e XOR ?\\ng := c XOR f\\nh := 100\\ni := c XOR h\\nj := c XOR i\\nk := b XOR ?\\nl := 111\\n\", \"12 14\\na := 01100010000111\\nb := ? XOR a\\nc := 01101111001010\\nd := ? XOR c\\ne := 10000011101111\\nf := ? XOR e\\ng := 10100011001010\\nh := ? XOR g\\ni := 10010110111111\\nj := ? XOR i\\nk := 10000111110001\\nl := ? XOR k\\n\", \"14 8\\na := 01010000\\nb := 10101111\\nc := 01100100\\nd := 10011011\\ne := 01001100\\nf := 10110011\\ng := ? XOR a\\nh := b XOR ?\\ni := ? XOR c\\nj := d XOR ?\\nk := ? XOR e\\nl := f XOR ?\\nm := 00101111\\nn := ? XOR m\\n\", \"14 14\\na := 10000100110000\\nb := 01111011001111\\nc := 11110001111101\\nd := 00001110000010\\ne := 00111100000010\\nf := 11000011111101\\ng := ? XOR a\\nh := b XOR ?\\ni := ? XOR c\\nj := d XOR ?\\nk := ? XOR e\\nl := f XOR ?\\nm := 11110011011001\\nn := ? XOR m\\n\", \"17 15\\na := 010000111111110\\nb := 101100110000100\\nc := 100101100100111\\nd := 010110101110110\\ne := 111111000010110\\nf := 011001110111110\\ng := 110011010100101\\nh := 000001010010001\\ni := 110000111001011\\nj := 000010000010111\\nk := 110110111110110\\nl := 010000110000100\\nm := 000111101101000\\nn := 011111011000111\\no := 010110110010100\\np := 111001110011001\\nq := 000100110001000\\n\", \"22 9\\na := 100101111\\nb := 010001100\\nc := b AND b\\nd := 111000010\\ne := c AND a\\nf := a OR e\\ng := e AND ?\\nh := 000010001\\ni := b OR ?\\nj := d AND ?\\nk := g AND h\\nl := 010100000\\nm := a AND a\\nn := j AND ?\\no := m OR n\\np := o AND ?\\nq := f OR ?\\nr := 000011011\\ns := 001110011\\nt := 100111100\\nu := l AND p\\nv := g OR h\\n\", \"2 109\\na := 1010101010100000000000011111111111111111111111111111111111111111111000000000000000000000000000111111111111111\\nb := ? XOR a\\n\"], \"outputs\": [\"011\\n100\\n\", \"0\\n0\\n\", \"0100101101\\n1011010010\\n\", \"0000000000\\n0000000000\\n\", \"000000\\n111111\\n\", \"100000\\n011011\\n\", \"101\\n010\\n\", \"00\\n11\\n\", \"001\\n110\\n\", \"000\\n111\\n\", \"10000011001011\\n01011000010000\\n\", \"00101111\\n11010000\\n\", \"11110011011001\\n00001100100110\\n\", \"000000000000000\\n000000000000000\\n\", \"000000000\\n111111111\\n\", \"1010101010100000000000011111111111111111111111111111111111111111111000000000000000000000000000111111111111111\\n0101010101011111111111100000000000000000000000000000000000000000000111111111111111111111111111000000000000000\\n\"]}",
"style": "rule"
} |
aca032762cc90a0e85fffc932f55e7e4 | code | coder1_longcot | [
{
"content": "Solve the following coding problem using the programming language python:\n\nVasya is an active Internet user. One day he came across an Internet resource he liked, so he wrote its address in the notebook. We know that the address of the written resource has format: <protocol>://<domain>.ru[/<cont... | {
"ground_truth": "{\"inputs\": [\"httpsunrux\\n\", \"ftphttprururu\\n\", \"httpuururrururruruurururrrrrurrurrurruruuruuu\\n\", \"httpabuaruauabbaruru\\n\", \"httpuurrruurruuruuruuurrrurururuurruuuuuuruurr\\n\", \"httpruhhphhhpuhruruhhpruhhphruhhru\\n\", \"httpftprftprutprururftruruftptp\\n\", \"httpfttpftpfttftpftpftppfrurururu\\n\", \"httpruhttttpruhttprupruhttpruhtturuhttphtruuru\\n\", \"httpsjkazaaghasjkasjkabruru\\n\", \"httpftphttptphttphrururuhpftphtpftphtpftphtptpft\\n\", \"httpppppru\\n\", \"ftprrurururrurururuurrururruuru\\n\", \"ftpabaruru\\n\", \"ftpruurruurururururuuruuur\\n\", \"ftphhphruhhpruhhpuhhpuruhhphruhhruhhpuhhru\\n\", \"ftparua\\n\", \"httpzru\\n\", \"httprrur\\n\", \"ftprru\\n\"], \"outputs\": [\"http://sun.ru/x\\n\", \"ftp://http.ru/ruru\\n\", \"http://uu.ru/rrururruruurururrrrrurrurrurruruuruuu\\n\", \"http://abua.ru/auabbaruru\\n\", \"http://uurr.ru/urruuruuruuurrrurururuurruuuuuuruurr\\n\", \"http://ruhhphhhpuh.ru/ruhhpruhhphruhhru\\n\", \"http://ftprftp.ru/tprururftruruftptp\\n\", \"http://fttpftpfttftpftpftppf.ru/rururu\\n\", \"http://ruhttttp.ru/httprupruhttpruhtturuhttphtruuru\\n\", \"http://sjkazaaghasjkasjkab.ru/ru\\n\", \"http://ftphttptphttph.ru/ruruhpftphtpftphtpftphtptpft\\n\", \"http://pppp.ru\\n\", \"ftp://r.ru/rururrurururuurrururruuru\\n\", \"ftp://aba.ru/ru\\n\", \"ftp://ruur.ru/urururururuuruuur\\n\", \"ftp://hhph.ru/hhpruhhpuhhpuruhhphruhhruhhpuhhru\\n\", \"ftp://a.ru/a\\n\", \"http://z.ru\\n\", \"http://r.ru/r\\n\", \"ftp://r.ru\\n\"]}",
"style": "rule"
} |
a6311c56ccadd21148ddbaea83d3d968 | code | coder1_longcot | [
{
"content": "Solve the following coding problem using the programming language python:\n\nAs technologies develop, manufacturers are making the process of unlocking a phone as user-friendly as possible. To unlock its new phone, Arkady's pet dog Mu-mu has to bark the password once. The phone represents a passwo... | {
"ground_truth": "{\"inputs\": [\"ya\\n4\\nah\\noy\\nto\\nha\\n\", \"hp\\n2\\nht\\ntp\\n\", \"ah\\n1\\nha\\n\", \"bb\\n4\\nba\\nab\\naa\\nbb\\n\", \"bc\\n4\\nca\\nba\\nbb\\ncc\\n\", \"ba\\n4\\ncd\\nad\\ncc\\ncb\\n\", \"pg\\n4\\nzl\\nxs\\ndi\\nxn\\n\", \"bn\\n100\\ndf\\nyb\\nze\\nml\\nyr\\nof\\nnw\\nfm\\ndw\\nlv\\nzr\\nhu\\nzt\\nlw\\nld\\nmo\\nxz\\ntp\\nmr\\nou\\nme\\npx\\nvp\\nes\\nxi\\nnr\\nbx\\nqc\\ngm\\njs\\nkn\\ntw\\nrq\\nkz\\nuc\\nvc\\nqr\\nab\\nna\\nro\\nya\\nqy\\ngu\\nvk\\nqk\\ngs\\nyq\\nop\\nhw\\nrj\\neo\\nlz\\nbh\\nkr\\nkb\\nma\\nrd\\nza\\nuf\\nhq\\nmc\\nmn\\nti\\nwn\\nsh\\nax\\nsi\\nnd\\ntz\\ndu\\nfj\\nkl\\nws\\now\\nnf\\nvr\\nye\\nzc\\niw\\nfv\\nkv\\noo\\nsm\\nbc\\nrs\\nau\\nuz\\nuv\\ngh\\nsu\\njn\\ndz\\nrl\\nwj\\nbk\\nzl\\nas\\nms\\nit\\nwu\\n\", \"bb\\n1\\naa\\n\", \"qm\\n25\\nqw\\nwe\\ner\\nrt\\nty\\nyu\\nui\\nio\\nop\\npa\\nas\\nsd\\ndf\\nfg\\ngh\\nhj\\njk\\nkl\\nlz\\nzx\\nxc\\ncv\\nvb\\nbn\\nnm\\n\", \"mq\\n25\\nqw\\nwe\\ner\\nrt\\nty\\nyu\\nui\\nio\\nop\\npa\\nas\\nsd\\ndf\\nfg\\ngh\\nhj\\njk\\nkl\\nlz\\nzx\\nxc\\ncv\\nvb\\nbn\\nnm\\n\", \"aa\\n1\\naa\\n\", \"bb\\n1\\nbb\\n\", \"ba\\n1\\ncc\\n\", \"ha\\n1\\nha\\n\", \"aa\\n1\\naa\\n\", \"ez\\n1\\njl\\n\", \"aa\\n2\\nab\\nba\\n\", \"aa\\n2\\nca\\ncc\\n\", \"dd\\n2\\nac\\ndc\\n\", \"qc\\n2\\nyc\\nkr\\n\", \"aa\\n3\\nba\\nbb\\nab\\n\", \"ca\\n3\\naa\\nbb\\nab\\n\", \"ca\\n3\\nbc\\nbd\\nca\\n\", \"dd\\n3\\nmt\\nrg\\nxl\\n\", \"be\\n20\\nad\\ncd\\ncb\\ndb\\ndd\\naa\\nab\\nca\\nae\\ned\\ndc\\nbb\\nba\\nda\\nee\\nea\\ncc\\nac\\nec\\neb\\n\", \"fc\\n20\\nca\\nbb\\nce\\nfd\\nde\\nfa\\ncc\\nec\\nfb\\nfc\\nff\\nbe\\ncf\\nba\\ndb\\ned\\naf\\nae\\nda\\nef\\n\", \"ca\\n20\\ndc\\naf\\ndf\\neg\\naa\\nbc\\nea\\nbd\\nab\\ndb\\ngc\\nfb\\nba\\nbe\\nee\\ngf\\ncf\\nag\\nga\\nca\\n\", \"ke\\n20\\nzk\\nra\\nbq\\nqz\\nwt\\nzg\\nmz\\nuk\\nge\\nuv\\nud\\nfd\\neh\\ndm\\nsk\\nki\\nfv\\ntp\\nat\\nfb\\n\", \"hh\\n50\\nag\\nhg\\ndg\\nfh\\neg\\ngh\\ngd\\nda\\nbh\\nab\\nhf\\ndc\\nhb\\nfe\\nad\\nec\\nac\\nfd\\nca\\naf\\ncg\\nhd\\neb\\nce\\nhe\\nha\\ngb\\nea\\nae\\nfb\\nff\\nbe\\nch\\nhh\\nee\\nde\\nge\\ngf\\naa\\ngg\\neh\\ned\\nbf\\nfc\\nah\\nga\\nbd\\ncb\\nbg\\nbc\\n\", \"id\\n50\\nhi\\ndc\\nfg\\nee\\ngi\\nhc\\nac\\nih\\ndg\\nfc\\nde\\ned\\nie\\neb\\nic\\ncf\\nib\\nfa\\ngc\\nba\\nbe\\nga\\nha\\nhg\\nia\\ndf\\nab\\nei\\neh\\nad\\nii\\nci\\ndh\\nec\\nif\\ndi\\nbg\\nag\\nhe\\neg\\nca\\nae\\ndb\\naa\\nid\\nfh\\nhh\\ncc\\nfb\\ngb\\n\", \"fe\\n50\\nje\\nbi\\nbg\\ngc\\nfb\\nig\\ndf\\nji\\ndg\\nfe\\nfc\\ncf\\ngf\\nai\\nhe\\nac\\nch\\nja\\ngh\\njf\\nge\\ncb\\nij\\ngb\\ncg\\naf\\neh\\nee\\nhd\\njd\\njb\\nii\\nca\\nci\\nga\\nab\\nhi\\nag\\nfj\\nej\\nfi\\nie\\ndj\\nfg\\nef\\njc\\njg\\njh\\nhf\\nha\\n\", \"rn\\n50\\nba\\nec\\nwg\\nao\\nlk\\nmz\\njj\\ncf\\nfa\\njk\\ndy\\nsz\\njs\\nzr\\nqv\\ntx\\nwv\\nrd\\nqw\\nls\\nrr\\nvt\\nrx\\nkc\\neh\\nnj\\niq\\nyi\\nkh\\nue\\nnv\\nkz\\nrn\\nes\\nua\\nzf\\nvu\\nll\\neg\\nmj\\ncz\\nzj\\nxz\\net\\neb\\nci\\nih\\nig\\nam\\nvd\\n\", \"ee\\n100\\nah\\nfb\\ncd\\nbi\\nii\\nai\\nid\\nag\\nie\\nha\\ndi\\nec\\nae\\nce\\njb\\ndg\\njg\\ngd\\ngf\\nda\\nih\\nbd\\nhj\\ngg\\nhb\\ndf\\ned\\nfh\\naf\\nja\\nci\\nfc\\nic\\nji\\nac\\nhi\\nfj\\nch\\nbc\\njd\\naa\\nff\\nad\\ngj\\nej\\nde\\nee\\nhe\\ncf\\nga\\nia\\ncg\\nbb\\nhc\\nbe\\ngi\\njf\\nbg\\naj\\njj\\nbh\\nfe\\ndj\\nef\\ngb\\nge\\ndb\\nig\\ncj\\ndc\\nij\\njh\\nei\\ndd\\nib\\nhf\\neg\\nbf\\nfg\\nab\\ngc\\nfd\\nhd\\ngh\\neh\\njc\\neb\\nhh\\nca\\nje\\nbj\\nif\\nea\\nhg\\nfa\\ncc\\nba\\ndh\\ncb\\nfi\\n\", \"if\\n100\\njd\\nbc\\nje\\nhi\\nga\\nde\\nkb\\nfc\\ncd\\ngd\\naj\\ncb\\nei\\nbf\\ncf\\ndk\\ndb\\ncg\\nki\\ngg\\nkg\\nfa\\nkj\\nii\\njf\\njg\\ngb\\nbh\\nbg\\neh\\nhj\\nhb\\ndg\\ndj\\njc\\njb\\nce\\ndi\\nig\\nci\\ndf\\nji\\nhc\\nfk\\naf\\nac\\ngk\\nhd\\nae\\nkd\\nec\\nkc\\neb\\nfh\\nij\\nie\\nca\\nhh\\nkf\\nha\\ndd\\nif\\nef\\nih\\nhg\\nej\\nfe\\njk\\nea\\nib\\nck\\nhf\\nak\\ngi\\nch\\ndc\\nba\\nke\\nad\\nka\\neg\\njh\\nja\\ngc\\nfd\\ncc\\nab\\ngj\\nik\\nfg\\nbj\\nhe\\nfj\\nge\\ngh\\nhk\\nbk\\ned\\nid\\nfi\\n\", \"kd\\n100\\nek\\nea\\nha\\nkf\\nkj\\ngh\\ndl\\nfj\\nal\\nga\\nlj\\nik\\ngd\\nid\\ncb\\nfh\\ndk\\nif\\nbh\\nkb\\nhc\\nej\\nhk\\ngc\\ngb\\nef\\nkk\\nll\\nlf\\nkh\\ncl\\nlh\\njj\\nil\\nhh\\nci\\ndb\\ndf\\ngk\\njg\\nch\\nbd\\ncg\\nfg\\nda\\neb\\nlg\\ndg\\nbk\\nje\\nbg\\nbl\\njl\\ncj\\nhb\\nei\\naa\\ngl\\nka\\nfa\\nfi\\naf\\nkc\\nla\\ngi\\nij\\nib\\nle\\ndi\\nck\\nag\\nlc\\nca\\nge\\nie\\nlb\\nke\\nii\\nae\\nig\\nic\\nhe\\ncf\\nhd\\nak\\nfb\\nhi\\ngf\\nad\\nba\\nhg\\nbi\\nkl\\nac\\ngg\\ngj\\nbe\\nlk\\nld\\naj\\n\", \"ab\\n1\\nab\\n\", \"ya\\n1\\nya\\n\", \"ay\\n1\\nyb\\n\", \"ax\\n2\\nii\\nxa\\n\", \"hi\\n1\\nhi\\n\", \"ag\\n1\\nag\\n\", \"th\\n1\\nth\\n\", \"sb\\n1\\nsb\\n\", \"hp\\n1\\nhp\\n\", \"ah\\n1\\nah\\n\", \"ta\\n1\\nta\\n\", \"tb\\n1\\ntb\\n\", \"ab\\n5\\nca\\nda\\nea\\nfa\\nka\\n\", \"ac\\n1\\nac\\n\", \"ha\\n2\\nha\\nzz\\n\", \"ok\\n1\\nok\\n\", \"bc\\n1\\nbc\\n\", \"az\\n1\\nzz\\n\", \"ab\\n2\\nba\\ntt\\n\", \"ah\\n2\\nap\\nhp\\n\", \"sh\\n1\\nsh\\n\", \"az\\n1\\nby\\n\", \"as\\n1\\nas\\n\", \"ab\\n2\\nab\\ncd\\n\", \"ab\\n2\\nxa\\nza\\n\", \"ab\\n2\\net\\nab\\n\", \"ab\\n1\\naa\\n\", \"ab\\n2\\nab\\nde\\n\", \"ah\\n2\\nba\\nha\\n\", \"ha\\n3\\ndd\\ncc\\nha\\n\", \"oo\\n1\\nox\\n\", \"ab\\n2\\nax\\nbx\\n\", \"ww\\n4\\nuw\\now\\npo\\nko\\n\", \"ay\\n1\\nay\\n\", \"yo\\n1\\nyo\\n\", \"ba\\n1\\nba\\n\", \"qw\\n1\\nqw\\n\", \"la\\n1\\nla\\n\", \"ab\\n2\\nbb\\nbc\\n\", \"aa\\n2\\nab\\nac\\n\", \"ah\\n2\\nbb\\nha\\n\", \"ya\\n42\\nab\\nac\\nad\\nae\\naf\\nag\\nah\\nai\\nak\\naj\\nba\\nbc\\nbd\\nbe\\nbf\\nbg\\nbh\\nbi\\nbk\\nbj\\ncb\\nca\\ncd\\nce\\ncf\\ncg\\nch\\nci\\nck\\ncj\\ndb\\ndc\\nda\\nde\\ndf\\ndg\\ndh\\ndi\\ndk\\ndj\\nef\\nek\\n\", \"ab\\n3\\nab\\nxx\\nyy\\n\", \"ab\\n2\\nab\\ncc\\n\", \"sa\\n2\\nxx\\nas\\n\", \"ma\\n1\\nma\\n\", \"ba\\n1\\nbb\\n\", \"bc\\n1\\nab\\n\", \"fa\\n1\\nfa\\n\", \"ap\\n1\\nap\\n\", \"ab\\n1\\nbb\\n\", \"bk\\n1\\nbk\\n\", \"xy\\n2\\nxy\\naa\\n\", \"ab\\n2\\nza\\nbz\\n\"], \"outputs\": [\"YES\\n\", \"NO\\n\", \"YES\\n\", \"YES\\n\", \"YES\\n\", \"YES\\n\", \"NO\\n\", \"YES\\n\", \"NO\\n\", \"NO\\n\", \"YES\\n\", \"YES\\n\", \"YES\\n\", \"NO\\n\", \"YES\\n\", \"YES\\n\", \"NO\\n\", \"YES\\n\", \"NO\\n\", \"NO\\n\", \"NO\\n\", \"YES\\n\", \"NO\\n\", \"YES\\n\", \"NO\\n\", \"YES\\n\", \"YES\\n\", \"YES\\n\", \"YES\\n\", \"YES\\n\", \"YES\\n\", \"YES\\n\", \"YES\\n\", \"YES\\n\", \"YES\\n\", \"YES\\n\", \"YES\\n\", \"YES\\n\", \"NO\\n\", \"YES\\n\", \"YES\\n\", \"YES\\n\", \"YES\\n\", \"YES\\n\", \"YES\\n\", \"YES\\n\", \"YES\\n\", \"YES\\n\", \"NO\\n\", \"YES\\n\", \"YES\\n\", \"YES\\n\", \"YES\\n\", \"NO\\n\", \"YES\\n\", \"NO\\n\", \"YES\\n\", \"NO\\n\", \"YES\\n\", \"YES\\n\", \"NO\\n\", \"YES\\n\", \"NO\\n\", \"YES\\n\", \"YES\\n\", \"YES\\n\", \"NO\\n\", \"NO\\n\", \"NO\\n\", \"YES\\n\", \"YES\\n\", \"YES\\n\", \"YES\\n\", \"YES\\n\", \"NO\\n\", \"NO\\n\", \"YES\\n\", \"NO\\n\", \"YES\\n\", \"YES\\n\", \"YES\\n\", \"YES\\n\", \"NO\\n\", \"NO\\n\", \"YES\\n\", \"YES\\n\", \"NO\\n\", \"YES\\n\", \"YES\\n\", \"YES\\n\"]}",
"style": "rule"
} |
Dataset Summary
This dataset is a high-quality subset of the Klear-Reasoner Code RL dataset, derived from the RL data used in the rllm project. Part of this data contributed to training Klear-Reasoner’s code reasoning models. The dataset is carefully cleaned and filtered to include only reliable samples suitable for reinforcement learning. Models trained with this dataset have shown substantial performance improvements across various code reasoning benchmarks. You can load the dataset via the Hugging Face datasets library:
from datasets import load_dataset
dataset = load_dataset("Kwai-Klear/KlearReasoner-CodeSub-15K")
| Resource | Link |
|---|---|
| 📝 Preprints | Paper |
| 🤗 Daily Paper | Paper |
| 🤗 Model Hub | Klear-Reasoner-8B |
| 🤗 Dataset Hub | Math RL |
| 🤗 Dataset Hub | Code RL |
| 🐛 Issues & Discussions | GitHub Issues |
| 📧 Contact | suzhenpeng13@163.com |
Data Fields
- data_source (string) — The source identifier for the sample.
- prompt (list of dict) — The input prompt, stored as a list of message objects in chat format.
- ability (string) — The skill or task category associated with the sample.
- reward_model (dict) — Information about the ground truth or reward signal.
- ground_truth (string) — The expected correct answer (may include LaTeX formatting).
- style (string) — The method or type of evaluation, e.g., "rule".
- index_level_0 (int) — An internal index or unique identifier for the sample.
Demonstration of Data Quality
This dataset contains exclusively high-quality, filtered samples.
All samples have been selected to ensure accurate reward signals for reinforcement learning, following the gradient-preserving clipping policy optimization (GPPO) method introduced in our paper. Models trained using this dataset achieve strong generalization and reliable performance on a range of math reasoning tasks.
Citation
If you find this work helpful, please cite our paper:
@misc{su2025cegppocontrollingentropygradientpreserving,
title={CE-GPPO: Controlling Entropy via Gradient-Preserving Clipping Policy Optimization in Reinforcement Learning},
author={Zhenpeng Su and Leiyu Pan and Minxuan Lv and Yuntao Li and Wenping Hu and Fuzheng Zhang and Kun Gai and Guorui Zhou},
year={2025},
eprint={2509.20712},
archivePrefix={arXiv},
primaryClass={cs.LG},
url={https://arxiv.org/abs/2509.20712},
}
@article{DBLP:journals/corr/abs-2508-07629,
author = {Zhenpeng Su and
Leiyu Pan and
Xue Bai and
Dening Liu and
Guanting Dong and
Jiaming Huang and
Wenping Hu and
Fuzheng Zhang and
Kun Gai and
Guorui Zhou},
title = {Klear-Reasoner: Advancing Reasoning Capability via Gradient-Preserving
Clipping Policy Optimization},
journal = {CoRR},
volume = {abs/2508.07629},
year = {2025},
url = {https://doi.org/10.48550/arXiv.2508.07629},
doi = {10.48550/ARXIV.2508.07629},
eprinttype = {arXiv},
eprint = {2508.07629},
timestamp = {Sat, 13 Sep 2025 14:46:27 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2508-07629.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
- Downloads last month
- 92