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

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

Re: 11548 - Blackboard Bonanza

Post by sazzadcsedu » Wed Apr 21, 2010 6:39 am

Thank u Mr.sohel for ur help.Acc.
Life is more complicated than algorithm.
http://felix-halim.net/uva/hunting.php?id=32359
For Hints: http://salimsazzad.wordpress.com

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

Re: 11548 - Blackboard Bonanza

Post by receme » Sat Jan 22, 2011 10:27 am

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. :)

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

Re: 11548 - Blackboard Bonanza

Post by vatsa_17 » Mon May 25, 2015 8:37 pm

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)”