11452 - Dancing the Cheeky-Cheeky

[Rupak]

plz ... give me some I/O

[mmonish]

try this cases....
Input:

Code: Select all

6
123412312312341231231234
11
12121
23423423
12123123412123123412123123
23232

Output:

Code: Select all

12312312...
11111111...
21212121...
42342342...
41212312...
32323232...

hope this helps..

[Rupak]

passed these cases, but still WA


get acc, thanks

[andmej]

What's your algorithm?

[lazyboy]

is it possible to input the sequence greater or equal 3 time or smaller than twice.
What would be the reason to get TLE in this problem...

[lazyboy]

Code: Select all

Accepted....

Thanks jurajz.

[jurajz]

Hi lazyboy,

I don't know your idea, but my O(n^2) (n is length of the input string) algorithm pass time limit with no problem (0.010s). Maybe you got infinite loop at some judge test case... Just determine length of the period in O(n^2) and with help of this length write next 8 steps

[plamplam]

Code: Select all

7
112231112231112
1122311122311
111
11111211111211111
41241222234123412311123141213121212124124122223412341231112314121312121212412412222341234123111231412
12121212121212121212121212121212
123443211234432112344

Code: Select all

23111223...
12231112...
11111111...
21111121...
13121212...
12121212...
32112344...