Left
Statement
Goal
This is a reverse only problem, so I'm not describing it here in order to allow you to try to figure it out (or you can just check the solution).If the problem is duplicated just comment and I'll remove this :)
Input
Line 1: A positive integer A
Line 2: A positive integer B
Line 2: A positive integer B
Output
A single line containing an integer
Constraints
Example
Input
0 0
Output
0
Game modes
Reverse
Test cases
Test 1 Test
Input
0
0
Output
0
Validator 1 Validator
Input
0
1
Output
0
Test 2 Test
Input
1
0
Output
1
Validator 2 Validator
Input
2
0
Output
2
Test 3 Test
Input
1
1
Output
2
Validator 3 Validator
Input
2
1
Output
4
Test 4 Test
Input
1
2
Output
4
Validator 4 Validator
Input
8
2
Output
32
Test 5 Test
Input
4
3
Output
32
Validator 5 Validator
Input
3
3
Output
24
Test 6 Test
Input
2
3
Output
16
Validator 6 Validator
Input
5
3
Output
40
Test 7 Test
Input
31
1
Output
62
Validator 7 Validator
Input
63
1
Output
126
Test 8 Test
Input
256
5
Output
8192
Validator 8 Validator
Input
4
5
Output
128
Test 9 Test
Input
71928
4
Output
1150848
Validator 9 Validator
Input
239890
5
Output
7676480
Test 10 Test
Input
1
30
Output
1073741824
Validator 10 Validator
Input
1
29
Output
536870912
Solution language
Solution
Stub generator input