| Submit | All submissions | Best solutions | Back to list |
BSCXOR - 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 |
hide comments
|
|||||
|
2018-01-31 20:39:45
I agree with @jitendrakk. It gives a LOAD of confidence |
|||||
|
2017-03-23 10:24:21
You can check whether two integers are the same or not to take advantage of XOR. |
|||||
|
2017-03-21 17:03:25
what is the meaning of this question? Can anyone pls tell me |
|||||
|
2016-10-14 16:13:44
I like it very much ;) |
|||||
|
2016-08-06 23:21:39
This problem gave me confidence. Thank you! |
|||||
|
2016-02-22 19:57:59
Including test cases with more than two numbers on a line, e.g. "1 0 1 1 0 1", would make it more interesting. |
|||||
|
2015-10-21 18:49:06
Its belongs to basic levels. |
|||||
|
2015-09-17 22:18:30
Should be moved to tutorials ^_^.... |
|||||
RSS