Introduce 2 to get to 5, introduce 4 to get to 9, introduce 8 to get to 17, and then eat the motes.
On Sat, May 4, 2013 at 8:30 PM, Mutley <[email protected]> wrote: > On Saturday, May 4, 2013 12:09:49 PM UTC-7, Mutley wrote: > > Can someone please run this and let me what test cases fail? My code had > no problems with the sample test cases provided for Problem A. Thanks in > advance. > > > > Here is my small dataset: > > > > 100 > > 3 8 > > 5 6 9 4 8 2 1 7 > > 3 1 > > 2 > > 3 10 > > 2 4 8 16 32 64 100 100 100 100 > > 3 10 > > 1 4 4 4 4 4 4 4 4 4 > > 100 1 > > 100 > > 3 5 > > 11 20 60 22 100 > > 2 10 > > 100 100 100 100 100 100 100 100 100 100 > > 3 5 > > 100 100 100 100 100 > > 3 4 > > 1 6 12 49 > > 2 6 > > 9 64 19 16 81 80 > > 1 10 > > 100 100 100 100 100 100 100 100 100 100 > > 1 10 > > 1 1 1 1 1 1 1 1 1 1 > > 1 3 > > 3 5 6 > > 4 2 > > 7 2 > > 2 4 > > 4 3 56 19 > > 13 3 > > 54 1 1 > > 5 8 > > 66 93 47 17 92 51 15 44 > > 9 9 > > 1 6 52 2 14 83 76 45 1 > > 13 5 > > 3 83 3 66 36 > > 4 5 > > 52 51 89 10 28 > > 5 6 > > 12 1 93 53 2 16 > > 16 9 > > 39 4 16 60 4 1 18 9 93 > > 20 6 > > 96 50 11 72 2 77 > > 2 8 > > 50 4 1 1 94 10 50 11 > > 17 6 > > 16 27 82 49 90 5 > > 23 5 > > 33 27 33 75 43 > > 2 5 > > 16 59 6 23 28 > > 25 6 > > 9 25 82 28 75 23 > > 1 2 > > 61 2 > > 23 1 > > 98 > > 4 9 > > 12 25 71 1 22 1 31 2 37 > > 1 1 > > 54 > > 1 1 > > 15 > > 10 5 > > 2 2 86 45 60 > > 3 6 > > 30 17 3 16 34 62 > > 10 6 > > 54 34 43 6 2 11 > > 6 9 > > 10 56 70 93 32 61 82 25 44 > > 4 2 > > 24 74 > > 6 1 > > 54 > > 20 6 > > 33 33 46 7 58 54 > > 12 3 > > 9 30 40 > > 12 3 > > 60 99 2 > > 1 2 > > 5 29 > > 2 3 > > 3 14 60 > > 9 7 > > 53 35 9 12 62 1 1 > > 6 9 > > 52 12 9 15 26 65 63 26 31 > > 22 7 > > 26 6 60 5 47 21 23 > > 7 6 > > 24 9 77 38 37 4 > > 12 1 > > 48 > > 8 4 > > 1 49 67 19 > > 13 3 > > 76 10 26 > > 4 9 > > 84 2 86 1 4 30 71 6 11 > > 17 3 > > 1 27 35 > > 13 9 > > 95 23 13 18 9 26 3 21 5 > > 17 8 > > 99 38 1 43 1 1 1 7 > > 4 3 > > 30 56 47 > > 14 1 > > 19 > > 19 3 > > 9 19 6 > > 1 1 > > 49 > > 15 3 > > 34 1 75 > > 22 6 > > 80 30 1 23 66 54 > > 20 3 > > 53 10 74 > > 1 7 > > 4 97 85 27 24 50 10 > > 19 8 > > 3 98 2 92 1 3 90 18 > > 23 8 > > 35 80 25 96 1 18 62 69 > > 7 7 > > 94 18 61 1 28 27 16 > > 12 3 > > 51 84 1 > > 10 1 > > 21 > > 5 1 > > 13 > > 2 6 > > 3 15 1 91 44 1 > > 11 2 > > 69 40 > > 6 6 > > 26 2 2 17 4 30 > > 4 6 > > 23 20 7 87 5 8 > > 15 5 > > 55 70 1 47 49 > > 2 5 > > 3 4 5 44 11 > > 1 7 > > 84 33 41 43 52 60 16 > > 19 1 > > 57 > > 16 1 > > 13 > > 10 3 > > 78 1 2 > > 12 2 > > 27 7 > > 2 3 > > 68 7 6 > > 5 5 > > 1 13 35 41 59 > > 18 6 > > 9 67 41 20 1 7 > > 4 2 > > 72 13 > > 13 1 > > 3 > > 9 5 > > 47 3 29 43 9 > > 24 1 > > 42 > > 2 7 > > 33 95 79 17 30 95 2 > > 4 8 > > 15 19 4 5 1 70 4 29 > > 1 1 > > 76 > > 1 1 > > 17 > > 15 5 > > 70 33 90 34 94 > > 7 1 > > 3 > > 14 9 > > 16 1 22 51 93 57 4 1 15 > > 12 4 > > 92 1 2 73 > > 19 1 > > 12 > > 6 9 > > 26 63 35 18 16 91 31 16 56 > > 7 6 > > 80 7 2 96 34 2 > > 19 7 > > 75 4 1 5 64 18 4 > > 15 9 > > 56 12 4 42 1 2 6 9 8 > > > > Here is my output file: > > Case #1: 0 > > Case #2: 0 > > Case #3: 0 > > Case #4: 1 > > Case #5: 1 > > Case #6: 5 > > Case #7: 10 > > Case #8: 5 > > Case #9: 3 > > Case #10: 6 > > Case #11: 10 > > Case #12: 10 > > Case #13: 3 > > Case #14: 1 > > Case #15: 4 > > Case #16: 1 > > Case #17: 8 > > Case #18: 1 > > Case #19: 3 > > Case #20: 5 > > Case #21: 3 > > Case #22: 0 > > Case #23: 1 > > Case #24: 5 > > Case #25: 0 > > Case #26: 1 > > Case #27: 5 > > Case #28: 0 > > Case #29: 2 > > Case #30: 1 > > Case #31: 2 > > Case #32: 1 > > Case #33: 1 > > Case #34: 3 > > Case #35: 6 > > Case #36: 1 > > Case #37: 2 > > Case #38: 2 > > Case #39: 1 > > Case #40: 1 > > Case #41: 1 > > Case #42: 2 > > Case #43: 2 > > Case #44: 3 > > Case #45: 1 > > Case #46: 1 > > Case #47: 0 > > Case #48: 1 > > Case #49: 1 > > Case #50: 3 > > Case #51: 2 > > Case #52: 2 > > Case #53: 2 > > Case #54: 0 > > Case #55: 1 > > Case #56: 3 > > Case #57: 1 > > Case #58: 0 > > Case #59: 1 > > Case #60: 2 > > Case #61: 1 > > Case #62: 2 > > Case #63: 7 > > Case #64: 1 > > Case #65: 0 > > Case #66: 6 > > Case #67: 2 > > Case #68: 1 > > Case #69: 1 > > Case #70: 3 > > Case #71: 2 > > Case #72: 1 > > Case #73: 3 > > Case #74: 4 > > Case #75: 5 > > Case #76: 7 > > Case #77: 1 > > Case #78: 0 > > Case #79: 1 > > Case #80: 1 > > Case #81: 3 > > Case #82: 4 > > Case #83: 0 > > Case #84: 2 > > Case #85: 0 > > Case #86: 1 > > Case #87: 1 > > Case #88: 7 > > Case #89: 1 > > Case #90: 1 > > Case #91: 1 > > Case #92: 5 > > Case #93: 0 > > Case #94: 0 > > Case #95: 2 > > Case #96: 0 > > Case #97: 9 > > Case #98: 2 > > Case #99: 1 > > Case #100: 0 > > Federico, Jango, > Thank you for your responses. I think I missed the idea somewhere. > > For eg: > 3 5 > 11 20 60 22 100 > > The largest mote size I can introduce here is 2 since the mote 3 cannot > eat up any size larger than 2. Eating the mote 2 will still take us to 5, > from which it is impossible to consume the smallest mote 11. Hence I > decided to reject all the 5 motes. > > Could anyone please clarify how the answer would be 3 as mentioned by > Federico? > > -- > 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/msg/google-code/-/L_t9dwdaF_wJ. > For more options, visit https://groups.google.com/groups/opt_out. > > > -- 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]. For more options, visit https://groups.google.com/groups/opt_out.
