BSCXOR - XOR


Given two logic values p and q (0 or 1) please compute p XOR q.

Example

Input:
1 1

Output:
0

hide comments
mizel: 2020-12-02 02:04:23

<0.5kb of code and explanations snipped>

[NG]: It's not that complicated and you´re not that smart. Yes, there are other people in the world that can do a xor b on their own.

Last edit: 2020-12-02 02:52:58
mrk_cppcs: 2020-06-26 14:25:32

Easy, i did this in 2 minutes. Pozdrawiam :D

kartikeysm2001: 2020-05-28 09:10:55

Eazypeazy

krishp: 2020-05-04 21:08:41

After 2.5 hours, I finally figured it out. Thank you for this problem : )

afreakingmind: 2019-09-15 19:27:22

It just need a single line of code for solution
System.out.print(a ^ b);

singhaditya97: 2019-08-31 17:59:16

Took me three hours to understand but AC in one go. I believe I am one of the best programmers in the world !!

rohan811: 2019-07-20 08:24:27

worst problem....please move to tutorials so that one's time isnt wasted.

aman321: 2019-04-10 22:06:57

Boosts the confidence level.

topsekret: 2018-01-31 20:39:45

I agree with @jitendrakk. It gives a LOAD of confidence

rp_shinya: 2017-03-23 10:24:21

You can check whether two integers are the same or not to take advantage of XOR.


Added by:kuszi
Date:2014-01-08
Time limit:1s
Source limit:50000B
Memory limit:1536MB
Cluster: Cube (Intel G860)
Languages:All except: ASM64
Resource:Thanks to Mostafa 36a2