Module: Bit Operations (C++)


Problem

12 /13


2^n+2^m

Problem

Find the sum of two different powers of 2 using only bitwise operations. In particular, you cannot use the addition operation.

Input: Two unequal numbers are given: n and m, not exceeding 31.
Output: Display the value of the sum 2n+2m.< br />
Examples
# Input Output
1 1 2 6

time 1000 ms
memory 256 Mb
Rules for program design and list of errors in automatic problem checking

Teacher commentary

Your Program

Attach a file with the source code of the program:

or select a programming language and type your program

Auto

       

Program check result To check the solution of the problem, you need to register or log in!