303292: CF638A. Home Numbers

Memory Limit:256 MB Time Limit:1 S
Judge Style:Text Compare Creator:
Submit:0 Solved:0

Description

Home Numbers

题意翻译

一条街道上有n栋房屋。每两栋房屋之间距离为1。(Vasya与1或n的距离也为1。) 奇数的房子位于街道的一侧,从街道的开头到结束编号为1到n-1。 偶数的房子位于街道的另一边,从街道尽头到它的开头编号为2到n。 Vasya要从街道的开始,到家a。1个距离需要1秒。请问Vasya到家a需要几秒?

题目描述

The main street of Berland is a straight line with $ n $ houses built along it ( $ n $ is an even number). The houses are located at both sides of the street. The houses with odd numbers are at one side of the street and are numbered from $ 1 $ to $ n-1 $ in the order from the beginning of the street to the end (in the picture: from left to right). The houses with even numbers are at the other side of the street and are numbered from $ 2 $ to $ n $ in the order from the end of the street to its beginning (in the picture: from right to left). The corresponding houses with even and odd numbers are strictly opposite each other, that is, house $ 1 $ is opposite house $ n $ , house $ 3 $ is opposite house $ n-2 $ , house $ 5 $ is opposite house $ n-4 $ and so on. ![](https://cdn.luogu.com.cn/upload/vjudge_pic/CF638A/465c6da36d6364a73bfba4e34106f098b28c7b09.png)Vasya needs to get to house number $ a $ as quickly as possible. He starts driving from the beginning of the street and drives his car to house $ a $ . To get from the beginning of the street to houses number $ 1 $ and $ n $ , he spends exactly $ 1 $ second. He also spends exactly one second to drive the distance between two neighbouring houses. Vasya can park at any side of the road, so the distance between the beginning of the street at the houses that stand opposite one another should be considered the same. Your task is: find the minimum time Vasya needs to reach house $ a $ .

输入输出格式

输入格式


The first line of the input contains two integers, $ n $ and $ a $ ( $ 1<=a<=n<=100000 $ ) — the number of houses on the street and the number of the house that Vasya needs to reach, correspondingly. It is guaranteed that number $ n $ is even.

输出格式


Print a single integer — the minimum time Vasya needs to get from the beginning of the street to house $ a $ .

输入输出样例

输入样例 #1

4 2

输出样例 #1

2

输入样例 #2

8 5

输出样例 #2

3

说明

In the first sample there are only four houses on the street, two houses at each side. House $ 2 $ will be the last at Vasya's right. The second sample corresponds to picture with $ n=8 $ . House $ 5 $ is the one before last at Vasya's left.

Input

题意翻译

一条街道上有n栋房屋。每两栋房屋之间距离为1。(Vasya与1或n的距离也为1。) 奇数的房子位于街道的一侧,从街道的开头到结束编号为1到n-1。 偶数的房子位于街道的另一边,从街道尽头到它的开头编号为2到n。 Vasya要从街道的开始,到家a。1个距离需要1秒。请问Vasya到家a需要几秒?

加入题单

算法标签: