@robin, your answer seems wrong for many of the cases. Would it be possible to show the program so that we can figure out where the mistake might be? For example, Case #5, i am getting 9946662
Here is the code I had written ... just in case .. http://pastebin.com/C1muXM9U On 10 May 2011 20:19, Umer Farooq <[email protected]> wrote: > For practice questions, does everyone receive same input ? Or do they give > different input files every time you download an input set?? > > On Tue, May 10, 2011 at 7:43 PM, robin john <[email protected]> wrote: >> >> Hello, >> Kindly try with this input sample. Also attached the output. >> Shall wait for your reply. I really would like to know, have also attached >> the 'C' source code. Please try and let me know if the output is different. >> Regards, Robin. >> >> On Mon, May 9, 2011 at 10:22 PM, Paul Smith <[email protected]> >> wrote: >>> >>> Everyone gets different inputs I think, so you probably need to post >>> the input as well as the output. >>> >>> In fact the easiest thing to do is download someone else's answer, run >>> their answer, run your answer, and compare for differences. >>> >>> Paul Smith >>> >>> [email protected] >>> >>> >>> >>> On Mon, May 9, 2011 at 3:16 PM, robin john <[email protected]> wrote: >>> > Hello >>> > Can anybody kindly upload prob C output or let me know how my output is >>> > wrong ? >>> > Am sure my logic is right. [Comparing xor's of the 2 divided group such >>> > that >>> > they are same and printing highest such possible sum as value] >>> > Reg, robin. >>> > >>> > On Sun, May 8, 2011 at 12:50 PM, vivek dhiman <[email protected]> >>> > wrote: >>> >> >>> >> Lucky! >>> >> >>> >> You are right. >>> >> >>> >> if xor of two lists is same. (say xor1 = xo2) >>> >> >>> >> So the exor of these two wil be 0 (xor (xor1,xor2) = 0) >>> >> Or in other words lists can be divided if the xor of all the elements >>> >> is >>> >> zero. >>> >> >>> >> :) >>> >> >>> >> >>> >> >>> >> On Sun, May 8, 2011 at 8:17 AM, keshav agarwal <[email protected]> >>> >> wrote: >>> >>> >>> >>> please tell me of my logic was correct or i just got lucky to get it >>> >>> correct >>> >>> >>> >>> if xor to a list of nos. is zero only then the division is possible >>> >>> in this case patrick can be given the one candy with lowest value >>> >>> while >>> >>> sean keeps the rest >>> >>> >>> >>> if xor(n nos.)=0 >>> >>> then (nth no.) xor (xor of n-1 nos.)=0 >>> >>> >>> >>> so patrick gets the nth candy and sean keeps the rest >>> >>> >>> >>> -- >>> >>> You received this message because you are subscribed to the Google >>> >>> Groups >>> >>> "google-codejam" group. >>> >>> To post to this group, send email to [email protected]. >>> >>> To unsubscribe from this group, send email to >>> >>> [email protected]. >>> >>> For more options, visit this group at >>> >>> http://groups.google.com/group/google-code?hl=en. >>> >> >>> >> >>> >> >>> >> -- >>> >> Regards >>> >> Vivek Dhiman >>> >> >>> >> -- >>> >> You received this message because you are subscribed to the Google >>> >> Groups >>> >> "google-codejam" group. >>> >> To post to this group, send email to [email protected]. >>> >> To unsubscribe from this group, send email to >>> >> [email protected]. >>> >> For more options, visit this group at >>> >> http://groups.google.com/group/google-code?hl=en. >>> > >>> > -- >>> > You received this message because you are subscribed to the Google >>> > Groups >>> > "google-codejam" group. >>> > To post to this group, send email to [email protected]. >>> > To unsubscribe from this group, send email to >>> > [email protected]. >>> > For more options, visit this group at >>> > http://groups.google.com/group/google-code?hl=en. >>> > >>> >>> -- >>> You received this message because you are subscribed to the Google Groups >>> "google-codejam" group. >>> To post to this group, send email to [email protected]. >>> To unsubscribe from this group, send email to >>> [email protected]. >>> For more options, visit this group at >>> http://groups.google.com/group/google-code?hl=en. >>> >> >> -- >> You received this message because you are subscribed to the Google Groups >> "google-codejam" group. >> To post to this group, send email to [email protected]. >> To unsubscribe from this group, send email to >> [email protected]. >> For more options, visit this group at >> http://groups.google.com/group/google-code?hl=en. > > > > -- > Umer > > -- > You received this message because you are subscribed to the Google Groups > "google-codejam" group. > To post to this group, send email to [email protected]. > To unsubscribe from this group, send email to > [email protected]. > For more options, visit this group at > http://groups.google.com/group/google-code?hl=en. > -- You received this message because you are subscribed to the Google Groups "google-codejam" group. To post to this group, send email to [email protected]. To unsubscribe from this group, send email to [email protected]. For more options, visit this group at http://groups.google.com/group/google-code?hl=en.
