CF124A.The number of positions

普及/提高-

通过率:0%

AC君温馨提醒

该题目为【codeforces】题库的题目,您提交的代码将被提交至codeforces进行远程评测,并由ACGO抓取测评结果后进行展示。由于远程测评的测评机由其他平台提供,我们无法保证该服务的稳定性,若提交后无反应,请等待一段时间后再进行重试。

题目描述

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

输入格式

The only line contains three integers nn , aa and bb ( 0<=a,b<n<=1000<=a,b<n<=100 ).

输出格式

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

输入输出样例

  • 输入#1

    3 1 1
    

    输出#1

    2
    
  • 输入#2

    5 2 3
    

    输出#2

    3
    

说明/提示

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.

首页