codeforces 124A The number of positions

风吹过的烟花

于 2017-07-25 16:15:04 发布

阅读量404

点赞数

CC 4.0 BY-SA版权

分类专栏： ACM算法_水题文章标签：水题

本文链接：https://blog.youkuaiyun.com/zhang__liuchen/article/details/76080906

ACM算法_水题专栏收录该内容

76 篇文章

订阅专栏

本文探讨了Petr在线中可能占据的位置数量问题，输入包括队伍总人数及Petr前后的最少和最多人数限制，通过算法计算并输出所有符合条件的位置数目。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

点击打开链接

Petr stands in line of n people, but he doesn't know exactly which position he occupies. He can say that there are no less than a people standing in front of him and no more than b people standing behind him. Find the number of different positions Petr can occupy.

Input

The only line contains three integers n, a and b (0 ≤ a, b < n ≤ 100).

Output

Print the single number — the number of the sought positions.

   Examples
 
     input
   
3 1 1

     output
   
2

     input
   
5 2 3

     output
   
3

Note

The possible positions in the first sample are: 2 and 3 (if we number the positions starting with 1).

In the second sample they are 3, 4 and 5.

题意：求几种情况，从前和从后数取最小的。

#include<stdio.h>
#include<algorithm>
using namespace std;
int main()
{
    int n,a,b;
    scanf("%d%d%d",&n,&a,&b);
    printf("%d\n",min(n-a,b+1));
    return 0;
}