How to Solve Sum vs XOR by c#

 The Solution:

        long k =1;

        while(n/2 != 0)

        {

              long dv = n%2;

              if(dv == 0)

              {

                k *=2;   

              }

              n = n/2;

        }

        return k;

    }

The Problem Statement:

Given an integer , find each  such that:

where  denotes the bitwise XOR operator. Return the number of 's satisfying the criteria.

Example

There are four values that meet the criteria:

Return .

Function Description

Complete the sumXor function in the editor below.

sumXor has the following parameter(s):
- int n: an integer

Returns
- int: the number of values found

Input Format

A single integer, .

Constraints

Subtasks

•  for  of the maximum score.

Output Format

Sample Input 0

5

Sample Output 0

2

Explanation 0

For , the  values  and  satisfy the conditions:

Sample Input 1

10

Sample Output 1

4

Explanation 1

For , the  values , , , and  satisfy the conditions: