| ENG RUS | Timus Online Judge |
Обсуждение задачи 1761. Двоичный палиндром[MSU Detritus] freopen Very funny problem [1] // Задача 1761. Двоичный палиндром 25 авг 2010 03:05 I wrote suffix automaton, and with it's help i found solution in 5 lines. Юлия Re: Very funny problem // Задача 1761. Двоичный палиндром 21 июн 2018 19:31 Hello!How are you?You are very clever!Help me,please))My problem is "Runtime error" bsu.mmf.team OMG, this problem is too easy!!!! [3] // Задача 1761. Двоичный палиндром 19 мар 2010 22:17 It's unbelieveable, how couldn't I solve it during the contest. Just brute-force for finding answers for smalls n... tyomitch Re: OMG, this problem is too easy!!!! // Задача 1761. Двоичный палиндром 13 фев 2013 19:32 Hmm no, not so easy, if you do it with pen and paper, it's too easy to overlook the palindromes. You need the results for N<40 before the generic solution becomes obvious. Юлия Re: OMG, this problem is too easy!!!! // Задача 1761. Двоичный палиндром 21 июн 2018 19:28 Hello!How are you?You are very clever!Help me,please)I'm confused.My problem is "Runtime error" Юлия Re: OMG, this problem is too easy!!!! // Задача 1761. Двоичный палиндром 21 июн 2018 19:28 Hello!How are you?You are very clever!Help me,please)I'm confused.My problem is "Runtime error" Андрей Hello. The problem of very big number. [1] // Задача 1761. Двоичный палиндром 17 янв 2017 21:21 Hello) I can't understand how to work with n = 2^1 000 000, cause it's very big number. I think, this problem can be solved at stage of converting entered number, but don't know exactly how) Андрей No subject // Задача 1761. Двоичный палиндром 5 мар 2017 01:10 I understood. The right way is not at converting entered binary number to decimal. Roman Atangulov (Moscow SU) It's simple to get AC, but is there any evidence of the fact? [1] // Задача 1761. Двоичный палиндром 21 мар 2010 20:33 Edited by author 21.03.2010 20:34 Ilya Zvigintsev [Tomsk PU] Re: It's simple to get AC, but is there any evidence of the fact? // Задача 1761. Двоичный палиндром 11 мар 2012 05:44 Yes, there is. Oracle[Lviv NU] DELETED // Задача 1761. Двоичный палиндром 20 авг 2011 01:35 Edited by author 26.08.2011 14:16 Gio Pataraia [Tbilisi SU] I dont understand the probem.. [2] // Задача 1761. Двоичный палиндром 25 апр 2011 15:54 how they got 11011100101 from 101? AterLux Re: I dont understand the probem.. [1] // Задача 1761. Двоичный палиндром 25 апр 2011 20:38 they "Write the integers from 1 to 101 in binary notation successively from left to right" i.e 1 10 11 100 101 Gio Pataraia [Tbilisi SU] Re: I dont understand the probem.. // Задача 1761. Двоичный палиндром 27 апр 2011 04:14 thanks,understand :)) but i see that such given string will be very anormous when n is also big.. how this problem can be solved? i have no idea :( for such a big n_s :((
|