A centipede has 40 left feet and 40 right feet. It keeps a left slippers and b right slippers under its bed. Every morning the centipede puts on the slippers. It pokes its first left foot under the bed and puts on a random slipper, doing it in one second. If the slipper is left, the centipede passes to shoeing the second left foot. Otherwise, it takes off the slipper and puts it on any unshod right foot, spending one more second, so that it takes two seconds altogether to put on such a slipper. If there are no unshod right feet, the centipede throws the slipper to a corner of the room, also in one second, so that two seconds are spent altogether for this slipper. The process is continued until all the left feet are in left slippers. Then the centipede starts shoeing its right feet until all of them are shod.
Today the centipede has got out of bed on the wrong side, so it is preparing for the worst. How many seconds will it need for shoeing?
Input
The only line contains the integers a and b (40 ≤ a, b ≤ 100).
Output
Output the number of seconds the centipede will need for shoeing in the worst case.
题目大意：http://www.nocow.cn/index.php/Translate:URAL/1876（中文题意）
思路：挺有意思的一道题目。
考虑最快情况，第一种最坏情况很明显，就是把右脚的鞋子全穿一遍，然后再穿完左脚，耗时2b+40。
第二种情况，先穿完左脚，再穿完右脚？不不不，还有更糟糕的情况，先给右脚穿好39只，耗时39*2，然后给左脚穿完鞋子，耗时40，再给右脚最后一只脚穿，把剩下的左脚鞋子都上一遍，耗时2（a-40)，然后穿上，耗时1。总耗时39*2+2(a-40)+1。
代码（0.046S）：
a, b = map(int, raw_input().split(' '))
print max(2 * b + 40, 39 * 2 + 40 + 2 * (a - 40) + 1)