## 11452 - Dancing the Cheeky-Cheeky

All about problems in Volume 114. If there is a thread about your problem, please use it. If not, create one with its number in the subject.

Moderator: Board moderators

Rupak
New poster
Posts: 8
Joined: Mon Jan 15, 2007 6:53 am

### 11452 - Dancing the Cheeky-Cheeky

plz ... give me some I/O
_______________________________________
http://acm.uva.es/problemset/usersnew.php?user=6114

mmonish
Experienced poster
Posts: 109
Joined: Sun Mar 11, 2007 2:55 pm
Location: SUST

### Re: 11452 - Dancing the Cheeky-Cheeky

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
New poster
Posts: 8
Joined: Mon Jan 15, 2007 6:53 am

### Re: 11452 - Dancing the Cheeky-Cheeky

passed these cases, but still WA

get acc, thanks
Last edited by Rupak on Sun Jun 15, 2008 9:11 am, edited 1 time in total.
_______________________________________
http://acm.uva.es/problemset/usersnew.php?user=6114

andmej
Experienced poster
Posts: 158
Joined: Sun Feb 04, 2007 7:45 pm
Location: Medellin, Colombia

### Re: 11452 - Dancing the Cheeky-Cheeky

Runtime errors in Pascal are reported as Wrong Answers by the online judge. Be careful.

Are you dreaming right now?
http://www.dreamviews.com

lazyboy
New poster
Posts: 17
Joined: Tue Jul 08, 2008 3:19 am

### Re: 11452 - Dancing the Cheeky-Cheeky[getting TLE]

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
New poster
Posts: 17
Joined: Tue Jul 08, 2008 3:19 am

### Re: 11452 - Dancing the Cheeky-Cheeky

Code: Select all

``````Accepted....
``````
Thanks jurajz.
Last edited by lazyboy on Wed Mar 18, 2009 11:31 pm, edited 1 time in total.

jurajz
Learning poster
Posts: 69
Joined: Sat Sep 02, 2006 7:30 pm
Location: Slovakia

### Re: 11452 - Dancing the Cheeky-Cheeky

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
Experienced poster
Posts: 150
Joined: Fri May 06, 2011 11:37 am

### Re: 11452 - Dancing the Cheeky-Cheeky

Code: Select all

``````7
112231112231112
1122311122311
111
11111211111211111
41241222234123412311123141213121212124124122223412341231112314121312121212412412222341234123111231412
12121212121212121212121212121212
123443211234432112344
``````

Code: Select all

``````23111223...
12231112...
11111111...
21111121...
13121212...
12121212...
32112344...
``````
You tried your best and you failed miserably. The lesson is 'never try'. -Homer Simpson