626C.md (1564B)
1 Source: https://codeforces.com/problemset/problem/626/C 2 3 C. Block Towers 4 5 time limit per test 6 7 2 seconds 8 9 memory limit per test 10 11 256 megabytes 12 13 input 14 15 standard input 16 17 output 18 19 standard output 20 21 Students in a class are making towers of blocks. Each student makes a (non-zero) tower by stacking pieces lengthwise on top of each other. *n* of the students use pieces made of two blocks and *m* of the students use pieces made of three blocks. 22 23 The students don’t want to use too many blocks, but they also want to be unique, so no two students’ towers may contain the same number of blocks. Find the minimum height necessary for the tallest of the students' towers. 24 25 Input 26 27 The first line of the input contains two space-separated integers *n* and *m* (0 ≤ *n*, *m* ≤ 1 000 000, *n* + *m* > 0) — the number of students using two-block pieces and the number of students using three-block pieces, respectively. 28 29 Output 30 31 Print a single integer, denoting the minimum possible height of the tallest tower. 32 33 Examples 34 35 Input 36 37 ``` 38 1 3 39 ``` 40 41 Output 42 43 ``` 44 9 45 ``` 46 47 Input 48 49 ``` 50 3 2 51 ``` 52 53 Output 54 55 ``` 56 8 57 ``` 58 59 Input 60 61 ``` 62 5 0 63 ``` 64 65 Output 66 67 ``` 68 10 69 ``` 70 71 Note 72 73 In the first case, the student using two-block pieces can make a tower of height 4, and the students using three-block pieces can make towers of height 3, 6, and 9 blocks. The tallest tower has a height of 9 blocks. 74 75 In the second case, the students can make towers of heights 2, 4, and 8 with two-block pieces and towers of heights 3 and 6 with three-block pieces, for a maximum height of 8 blocks.