Hello Everyone, I wasn't able to solve the large input for this problem during the competition, so I have been trying since. I looked into some solutions and adapted my bruteforce for the small input to the large one, but it is not working. I submitted for the small set and it works, but when it comes to the large, some of my outputs are smaller than the correct outputs (I checked against correct solutions).
I am just using bitmasks, (instead of strings, which is what the first few submissions were based on) so this might be causing the problem, however, L <= 40, and long long can use up to 63 bits. Here is my code: http://ideone.com/4c47Xe I would really appreciate if someone could give me a hand with this, or if my understanding of bitmasks is not correct. Thank you!! -- Andrés Felipe Ruiz -- 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/CAFe%2BQ0o%3DNBHT9RoQkWrTzrRo4QFYfpHtp4Cqqh1sZ_Nr5y5Y9A%40mail.gmail.com. For more options, visit https://groups.google.com/d/optout.
