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 (GCC 5.4.1) (judge verdict: Wrong Answer)

#include<stdio.h>
#include <string.h>
#include <stdlib.h>


int main (){
    
  int a,b,t,tmp;
  int ans,n;
  int v[50];
  int c[50];
  
  scanf("%d　%d",&n,&a);
  
  ans = n - a +1;
  
  


	
  printf("%d",ans);
      return 0;
  
}