Problem:
Score : 100 points

Problem Statement

Snuke has N integers: 1,2,\ldots,N.
He will choose K of them and give those to Takahashi.

How many ways are there to choose K consecutive integers?

Constraints

All values in input are integers.

1 \leq K \leq N \leq 50

Input

Input is given from Standard Input in the following format:

N K

Output

Print the answer.

Sample Input 1

3 2

Sample Output 1

2

There are two ways to choose two consecutive integers: (1,2) and (2,3).

Sample Input 2

13 3

Sample Output 2

11

Solution in C++14 (GCC 5.4.1) (judge verdict: Wrong Answer)

#include<bits/stdc++.h>
using namespace std;
int main()
{
	int N,ans = 0,A = 0,B = 0;
	char s[15];
	cin>>N;
	for (int i = 1;i <= N; ++i)
	{
		cin>>s;
		char * s0 = s;
		if (*s0 == 'B') ++B;
		while (*(s0 + 1))
		{
			if (*s0 == 'A'&&*(s0 + 1) == 'B') ++ans;
			++s0;
		}
		if (*s0 == 'A') ++A;
	}
	ans += min(A,B);
	cout<<ans;
}