There is a magic number 3025! In problem analysis, it is mentioned that the actual maximum possible sum of the second group numbers is 3025 under the problem's constraint Now I can't figure out what is the logic behind this. I understood we need to see numbers upto X - 29940 and X but can someone explain reasons behind 3025 and how it is derived.
-- -- You received this message because you are subscribed to the Google Groups Code Jam group. To post to this group, send email to google-code@googlegroups.com. To unsubscribe from this group, send email to google-code+unsubscr...@googlegroups.com. For more options, visit this group at https://groups.google.com/d/forum/google-code?hl=en --- 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 google-code+unsubscr...@googlegroups.com. To view this discussion on the web visit https://groups.google.com/d/msgid/google-code/7b8fd0c8-931d-4007-b485-7db39ce8a695n%40googlegroups.com.
