DMOJ · odd

The Odd Number

This C++ solution uses bitwise xor for DMOJ odd The Odd Number. Read the reasoning, inspect the code, or try your own test case below.

oddBitwiseBitwise XORC++16 lines
Solution218of 248
Open official problem ↗ Download C++ file ↓ Search the library → Open full Code Lab ↗ Report an issue ↗

Approach

Bitwise XOR

The Odd Number matches the paired values with one odd occurrence and the XOR solution.

Bitwise

Problem and code

Useful links.

Written by benbenyaojifen. Try the problem first, then compare your approach with the code.

Open official problem ↗View exact source file ↗
Implementation

the_odd_number.cpp

C++

    #include <cstdio>
     
    using namespace std;
     
    int main() {
        int n;
        scanf("%d", &n);
        int result = 0;
        for (int i = 0; i < n; i++) {
            int x;
            scanf("%d", &x);
            result ^= x;
        }
        printf("%d\n", result);
        return 0;
    }
        

Did this explanation save you time? I'm a Grade 11 student building this free library to make difficult algorithms easier to understand.

Buy me a coffee ↗Keep studying →

Test this problem

Run your code here.

Paste your code, run a test case, compare the output, or trace selected values.

Full trace, comparison & stress testing ↗
StatusReady
Output
No run yet.
Diagnostics
No diagnostics yet.

Each run is isolated and has strict limits. Passing one test does not guarantee the judge will accept the solution.