the number of position

HowardLin

于 2016-04-14 10:17:14 发布

阅读量506

点赞数

CC 4.0 BY-SA版权

分类专栏： sicily 简单编程

本文链接：https://blog.youkuaiyun.com/HowardLin/article/details/51149355

简单编程同时被 2 个专栏收录

6 篇文章

订阅专栏

sicily

3 篇文章

订阅专栏

本文介绍了一种通过已知条件来确定某人在队伍中可能的位置的方法。具体来说，已知队伍中有n个人，且该人前面至少有A人，后面至少有B人，求解可能的位置数量。

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

Description
Jesse 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 less than B people standing behind him.

Find the number of different positions Jesse 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.

Sample Input
Copy sample input to clipboard
10 2 4
Sample Output
4

#include<iostream>
using namespace std;

int main()
{
    int num;
    while(cin >> num){
        int a, b;
        cin >> a >> b ;
        int result = num - a - b;
        cout << result << endl;
    }

    return 0;
}

we know that Jesse stands in line of people, and there are no less than A people standing in front of him, and no less than B people standing behind him.
so when there are exactly A and B in the problem, we can get the max.
then problem is solved