Draft paper submission deadline is extended: TMFCS-10
The 2010 International Conference on Theoretical and Mathematical
Foundations of Computer Science (TMFCS-10) (website:
http://www.PromoteResearch.org)
will be held during 12-14 of July 2010 in Orlando, FL, USA. TMFCS is
an important event in
The XOR solution is better than the SUM method as SUM could result in
overflow and hence wrong answer, which would not happen with XOR solution.
Please correct me if i m wrong.
On Mon, Feb 1, 2010 at 11:31 AM, Anil Kishore anil.dai...@gmail.com wrote:
This is clearly explained in the previous
Yes Doing XOR Is much better idea. Using SUM method we may face overflow
problem which could be solved by strin implementation of a Number(extra
memory)
So its better to go with first solution.-
Atul
On Thu, Feb 4, 2010 at 11:05 PM, Agraj Mangal agraj@gmail.com wrote:
The XOR solution is
I think this works if elements are sorted . Is it correct?
On Mon, Feb 1, 2010 at 5:07 PM, sachin sachin_mi...@yahoo.co.in wrote:
A way to solve this problem would be using xor(exclusive OR)
xor all the elements from 1 to n.Call it A
xor all the elements of the array into a variable B
Now
No. This works for all cases. Xor is commutative.
On 2010-2-5 13:37, srinivas chintagunta wrote:
I think this works if elements are sorted . Is it correct?
On Mon, Feb 1, 2010 at 5:07 PM, sachin sachin_mi...@yahoo.co.in
mailto:sachin_mi...@yahoo.co.in wrote:
A way to solve this problem
Yup Terence is right.
On Fri, Feb 5, 2010 at 11:42 AM, Terence technic@gmail.com wrote:
No. This works for all cases. Xor is commutative.
On 2010-2-5 13:37, srinivas chintagunta wrote:
I think this works if elements are sorted . Is it correct?
On Mon, Feb 1, 2010 at 5:07 PM, sachin
