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 Java8 (OpenJDK 1.8.0) (judge verdict: Runtime Error)

import java.util.*;

public class Main{
	public static void main(String[] args){
    	Scanner scan = new Scanner(System.in);
      	int n = scan.nextInt();
      	String[] arr = new String[n];
      	for (int i= 0; i < n; i ++){
        	arr[i] = scan.next();
        }
      	int countB = 0;
      	int countA = 0;
      	int countAB = 0;
      	for(int j = 0; j < n; j++){
         	if(arr[j].substring(arr[j].length()-1).contains("A")){
            	countA ++;
            }
			if(arr[j].substring(0,1).contains("B")){
            	countB ++;
            }
          	for(int k = 0;k < arr[j].length() -1; k ++){
            	if(arr[j].substring(k,k + 1).contains("A") && arr[j].substring(k + 1,k + 2).contains("B")){
                	countAB ++;
                }
            }	
        }
      	int min = Math.min(countA, countB);
      	int mottomin = Math.min(min, n);
      	System.out.print(mottomin + countAB);
      	
    }

}