Codeforces Beta Round #92 (Div. 2) / 124A The number of positions (简单数学)
2013-08-22 22:22
393 查看
A. The number of positions
http://codeforces.com/problemset/problem/124/A
time limit per test
0.5 second
memory limit per test
256 megabytes
input
standard input
output
standard output
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.
Sample test(s)
input
output
input
output
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.
http://codeforces.com/problemset/problem/124/A
time limit per test
0.5 second
memory limit per test
256 megabytes
input
standard input
output
standard output
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.
Sample test(s)
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.
/*30ms,0KB*/ #include<cstdio> #include<algorithm> using namespace std; int main() { int n, a, b; scanf("%d%d%d", &n, &a, &b); printf("%d", n - max(a + 1, n - b) + 1); return 0; }
相关文章推荐
- Codeforces Beta Round #92 (Div. 2) / 124A The number of positions 【简单模拟】【水题】
- CodeForces-124A-The number of positions
- CodeForces-124A-The number of positions
- zoj2818 Root of the Problem 简单数学 开方
- POJ 2242 The Circumference of the Circle 简单数学
- Codeforces Round #426 (Div. 2) C. The Meaningless Game(简单数学)
- hdu 4727 The Number Off of FFF (简单题。。难点是理解题意)
- hdoj the Sum of Cube 5053 (简单数学)
- hdu 1492 The number of divisors(约数) about Humble Numbers (数学:排列组合)
- CodeForces - 27E Number With The Given Amount Of Divisors (DFS+数学)
- [2013山东ACM省赛] The number of steps (概率DP,数学期望)
- HDU 1492 The number of divisors(约数) about Humble Numbers(数学题)
- Codeforces Round #171 (Div. 2) D. The Minimum Number of Variables
- hdu 4727 The Number Off of FFF 简单题( 2013 ACM/ICPC Asia Regional Online —— Warmup2 1012)
- HDU 3006 The Number of set -- 简单巧妙的位运算
- 求逆序数(the number of inversions)(数学)
- The number of positions
- Codeforces Beta Round #27 (Codeforces format, Div. 2) E. Number With The Given Amount Of Divisors 反素数
- [2013山东ACM]省赛 The number of steps (可能DP,数学期望)
- A. The number of positions