# Check if a number can be represented as sum of non zero powers of 2

Given an integer N, the task is to check whether N can be represented as the sum of powers of 2 where all the powers are > 0 i.e. 20 cannot contribute to the sum.

Examples:

Input: N = 10
Output: 1
23 + 21 = 10

Input: N = 9
Output: 0

## Recommended: Please try your approach on {IDE} first, before moving on to the solution.

Approach: There are two cases:

1. When N is even then it can always be represented as the sum of powers of 2 when power > 0.
2. When N is odd then it can never be represented as the sum of powers of 2 if 20 is not included in the sum.

Below is the implementation of the above approach:

## C++

 `// C++ implementation of the approach ` `#include ` `using` `namespace` `std; ` ` `  `// Function that return true if n ` `// can be represented as the sum ` `// of powers of 2 without using 2^0 ` `bool` `isSumOfPowersOfTwo(``int` `n) ` `{ ` `    ``if` `(n % 2 == 1) ` `        ``return` `false``; ` `    ``else` `        ``return` `true``; ` `} ` ` `  `// Driver code ` `int` `main() ` `{ ` `    ``int` `n = 10; ` `    ``if` `(isSumOfPowersOfTwo(n)) ` `        ``cout << ``"Yes"``; ` `    ``else` `        ``cout << ``"No"``; ` ` `  `    ``return` `0; ` `} `

## Java

 `// Java implementation of the approach ` `class` `GFG { ` ` `  `    ``// Function that return true if n ` `    ``// can be represented as the sum ` `    ``// of powers of 2 without using 2^0 ` `    ``static` `boolean isSumOfPowersOfTwo(``int` `n) ` `    ``{ ` `        ``if` `(n % 2 == 1) ` `            ``return` `false``; ` `        ``else` `            ``return` `true``; ` `    ``} ` ` `  `    ``// Driver code ` `    ``public` `static` `void` `main(String args[]) ` `    ``{ ` `        ``int` `n = 10; ` `        ``if` `(isSumOfPowersOfTwo(n)) ` `            ``System.out.print(``"Yes"``); ` `        ``else` `            ``System.out.print(``"No"``); ` `    ``} ` `} `

## Python3

 `# Python3 implementation of the approach  ` ` `  `# Function that return true if n  ` `# can be represented as the sum  ` `# of powers of 2 without using 2^0 ` `def` `isSumOfPowersOfTwo(n): ` `    ``if` `n ``%` `2` `=``=` `1``: ` `        ``return` `False` `    ``else``: ` `        ``return` `True` ` `  `# Driver code ` `n ``=` `10` `if` `isSumOfPowersOfTwo(n): ` `    ``print``(``"Yes"``) ` `else``: ` `    ``print``(``"No"``) ` ` `  `# This code is contributed ` `# by Shrikant13 `

## C#

 `// C# implementation of the approach ` `using` `System; ` ` `  `class` `GFG { ` ` `  `    ``// Function that return true if n ` `    ``// can be represented as the sum ` `    ``// of powers of 2 without using 2^0 ` `    ``static` `bool` `isSumOfPowersOfTwo(``int` `n) ` `    ``{ ` `        ``if` `(n % 2 == 1) ` `            ``return` `false``; ` `        ``else` `            ``return` `true``; ` `    ``} ` ` `  `    ``// Driver code ` `    ``public` `static` `void` `Main() ` `    ``{ ` `        ``int` `n = 10; ` `        ``if` `(isSumOfPowersOfTwo(n)) ` `            ``Console.WriteLine(``"Yes"``); ` `        ``else` `            ``Console.WriteLine(``"No"``); ` `    ``} ` `} `

## PHP

 ` `

Output:

```Yes
```

Time Complexity: O(1)

My Personal Notes arrow_drop_up Check out this Author's contributed articles.

If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to contribute@geeksforgeeks.org. See your article appearing on the GeeksforGeeks main page and help other Geeks.

Please Improve this article if you find anything incorrect by clicking on the "Improve Article" button below.

Improved By : shrikanth13, Code_Mech

Article Tags :
Practice Tags :

1

Please write to us at contribute@geeksforgeeks.org to report any issue with the above content.