On Sunday, April 7, 2019 at 6:57:20 PM UTC+5:30, Ralph Furmaniak wrote: > Thanks for the problems! All were unique and clever and interesting, and I’m > looking forward to the rest of the rounds. > > One issue with the solution to the first problem in the analysis: The > constructive solution can result in 0s, eg: 10 would be decomposed as 10+0 > but the problem statement says that A and B must be positive integers. > There’s a bit of casework needed to make the solution always output positive > integers (number contains a 4, number has at least two non-zero digits, > number starts with a 1, 5, or anything else)
It was mentioned in the problem statement that multiple solutions may exist and in that case, we may output any one of them. I implemented a different logic that was giving a pair of integer which satisfies the constraint of not having any digit as 4 in any numbers in pair and sum of both numbers should be equal to the given count of jamCoin. Was that necessary to implement only that logic which is given in the "Analysis" section of the problem under heading "Constructive"? I continue to get "Wrong Answer" result again and again as I try to submit the solution. -- You received this message because you are subscribed to the Google Groups "Google Code Jam" group. To unsubscribe from this group and stop receiving emails from it, send an email to [email protected]. To post to this group, send email to [email protected]. To view this discussion on the web visit https://groups.google.com/d/msgid/google-code/b39c8d4b-1594-4786-8f0c-968785e64eff%40googlegroups.com. For more options, visit https://groups.google.com/d/optout.
