eolymp
bolt
Try our new interface for solving problems
Problems

2^k + 2^n

published at 8/5/15, 9:55:54 am

Завдання аналогічне задачі 2733

published at 8/9/22, 11:31:14 pm

В условии сказанно, что k != m, однако в последем тесте это не верно.

The problem statement says that k != m, but in the last test that is not true.

published at 2/16/24, 6:59:04 am

include <bits/stdc++.h>

using namespace std; int main () { int k,n; cin>>k>>n; long long a,eded=2; a=pow(eded,k)+pow(eded,n); cout<<a; }