Search found 5 matches

by brainless_the_swiss
Tue Feb 26, 2013 12:09 pm
Forum: Volume 107 (10700-10799)
Topic: 10722 - Super Lucky Numbers
Replies: 25
Views: 9577

Re: 10722 - Super Lucky Numbers

Dear all, I would use your help for a very similar challenge : http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&problem=3191 I read a few posts before : You are counting some occurences of 13 more than once if you say, AB contains 13, and CD are any digit, then ...
by brainless_the_swiss
Tue Feb 26, 2013 1:37 am
Forum: Volume 120 (12000-12099)
Topic: 12040 - Again Lucky Numbers
Replies: 1
Views: 1369

12040 - Again Lucky Numbers

Dear all, It would be great if someone helps me with this challenge : http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&problem=3191 When the number M cannot "overlap" itself, it is not a big deal to compute it recursively. By "overlapping itself", here is an exa...
by brainless_the_swiss
Sun Feb 24, 2013 12:22 am
Forum: Volume 120 (12000-12099)
Topic: 12045 - Fun with Strings
Replies: 2
Views: 1133

Re: 12045 fun with strings - WA !

Finally got AC !!!

The trick is that there are more conditions on L_1 and L_2 (the lengths of first and second string resp.) :

L_1 <= L_2 <= 2*L_1
by brainless_the_swiss
Thu Feb 21, 2013 8:23 pm
Forum: Volume 120 (12000-12099)
Topic: 12045 - Fun with Strings
Replies: 2
Views: 1133

Re: 12045 fun with strings - WA !

Dear reader, If you solved or tried this challenge, can you please tell me if my reasoning is correct ? If so, do you think there is tricky test cases ? Here is an URL to the statement : http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&problem=3196 Thank you in ...
by brainless_the_swiss
Sat Feb 16, 2013 2:32 am
Forum: Volume 120 (12000-12099)
Topic: 12045 - Fun with Strings
Replies: 2
Views: 1133

12045 - Fun with Strings

Dear all, I keep on having wrong answer for this one. The basic idea behind this challenge is simple : the length a string is the sum of the lengths of the 2 previous strings. Hence if we find the lengths of strings 1 and 2, by using Fibonacci numbers, we can compute the length of every arbitrary st...

Go to advanced search