11548 - Blackboard Bonanza

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

Moderator: Board moderators

Experienced poster
Posts: 136
Joined: Sat Nov 29, 2008 8:01 am
Location: narayangong,bangladesh.

Re: 11548 - Blackboard Bonanza

Post by sazzadcsedu »

Thank u Mr.sohel for ur help.Acc.
Life is more complicated than algorithm.
For Hints: http://salimsazzad.wordpress.com

New poster
Posts: 17
Joined: Thu Jul 01, 2010 11:55 am

Re: 11548 - Blackboard Bonanza

Post by receme »

Darko wrote:
The original statement was something like: Given N strings, find two that can give you the largest number of matched characters between them if you write one underneath the another. You can see that there are so many problems with that statement but, in retrospect, it would have been less confusing if we just left it that way.
Thanks Darko.... your post is really helpful. I got ac in 0.804 sec. :)

New poster
Posts: 4
Joined: Fri May 22, 2015 8:20 am

Re: 11548 - Blackboard Bonanza

Post by vatsa_17 »

can anyone give me test caes....iam getting WA....here's my code http://ideone.com/4GJJm3

Post Reply

Return to “Volume 115 (11500-11599)”