Module: Operasi Bit (C++)


Problem

12 /13


2^n+2^m

Problem

Cari hasil tambah dua kuasa berbeza bagi 2 hanya menggunakan operasi bitwise. Khususnya, anda tidak boleh menggunakan operasi tambah.

Input: Dua nombor tidak sama diberikan: n dan m, tidak melebihi 31.
Output: Paparkan nilai jumlah 2n+2m.< br />
Contoh

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!

# Input Output
1 1 2 6