Public submissions
Source code of every submission to this problem in this contest will be visible for everyone since 2014-01-08 17:04:54.

BSCXOR - XOR

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

Example

Input:
1 1

Output:
0

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
Public source code since: 2014-01-08 17:04:54

hide comments
2014-03-27 18:31:58 Bektur Atabekov
what is the meaning of XOR?
2014-02-20 11:48:07 Achmet ibn Rashid
In BF I get TLE despite the program being quite simple (my own interpreter would run it instantly) and in whitespace I get NZEC, I guess because the numbers are on the same line. So I solved it using sed :-|

Edit: Got both BF and WSPC solutions; in BF beware negative numbers since wrapping around seems to take forever. In WSPC don't use number I/O.

Last edit: 2014-02-20 12:20:39
2014-02-06 19:18:30 kuszi
@sai avinash duddupudi: it depends on the programming language
2014-02-06 09:13:16 Sai Avinash Duddupudi
can we directly use a xor symbol here???
2014-01-21 06:37:24 Varuni Garg
why there is always compilation error
© Spoj.com. All Rights Reserved. Spoj uses Sphere Engine™ © by Sphere Research Labs.