Eating Soup

题意翻译

有一个长度为$n$的环，求删除$m$个点后剩余连通块数最大值

题目描述

The three friends, Kuro, Shiro, and Katie, met up again! It's time for a party... What the cats do when they unite? Right, they have a party. Since they wanted to have as much fun as possible, they invited all their friends. Now $ n $ cats are at the party, sitting in a circle and eating soup. The rules are simple: anyone having finished their soup leaves the circle. Katie suddenly notices that whenever a cat leaves, the place where she was sitting becomes an empty space, which means the circle is divided into smaller continuous groups of cats sitting next to each other. At the moment Katie observes, there are $ m $ cats who left the circle. This raises a question for Katie: what is the maximum possible number of groups the circle is divided into at the moment? Could you help her with this curiosity? You can see the examples and their descriptions with pictures in the "Note" section.

输入输出格式

输入格式

The only line contains two integers $ n $ and $ m $ ( $ 2 \leq n \leq 1000 $ , $ 0 \leq m \leq n $ ) — the initial number of cats at the party and the number of cats who left the circle at the moment Katie observes, respectively.

输出格式

Print a single integer — the maximum number of groups of cats at the moment Katie observes.

输入输出样例

输入样例 #1

7 4

输出样例 #1

3

输入样例 #2

6 2

输出样例 #2

2

输入样例 #3

3 0

输出样例 #3

1

输入样例 #4

2 2

输出样例 #4

0

说明

In the first example, originally there are $ 7 $ cats sitting as shown below, creating a single group: At the observed moment, $ 4 $ cats have left the table. Suppose the cats $ 2 $ , $ 3 $ , $ 5 $ and $ 7 $ have left, then there are $ 3 $ groups remaining. It is possible to show that it is the maximum possible number of groups remaining. In the second example, there are $ 6 $ cats sitting as shown below: At the observed moment, $ 2 $ cats have left the table. Suppose the cats numbered $ 3 $ and $ 6 $ left, then there will be $ 2 $ groups remaining ( $ \{1, 2\} $ and $ \{4, 5\} $ ). It is impossible to have more than $ 2 $ groups of cats remaining. In the third example, no cats have left, so there is $ 1 $ group consisting of all cats. In the fourth example, all cats have left the circle, so there are $ 0 $ groups.

题意翻译

有一个长度为$n$的环，求删除$m$个点后剩余连通块数最大值