A - Consecutive Integers

Problem Statement
Snuke has N integers: 1,2,…,N. He will choose K of them and give those to Takahashi.How many ways are there to choose K consecutive integers?ConstraintsAll values in input are integers.1≤K≤N≤50
Input
Input is given from Standard Input in the following format:N K

Output
Print the answer.

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

Sample Input 2
Copy
13 3
Sample Output 2
Copy
11

#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<string>
#include<ctime>
#include<cmath>
#include<map>
#include<stack>
#include<set>
#include<queue>
#include<vector>
#include<iostream>
#include<algorithm>
#define ll long long
#define dd double
using namespace std;
int main() {
	ll n, m;
	cin >> n >> m;
	cout << n - m + 1 << endl;
}