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 Go (1.6) (judge verdict: Accepted)

package main

import (
	"fmt"
	"strconv"
)

func main() {
	var n, k string
	fmt.Scan(&n, &k)

	c, _ := strconv.Atoi(n)
	s := newSlice(0, c, 1)

	p := 0
	intK, _ := strconv.Atoi(k)
	i := 0
	for i < len(s) {
		if i+intK <= len(s) {
			p++
		}
		i++
	}
	fmt.Println(p)
}

func newSlice(start, count, step int) []int {
	s := make([]int, count)
	for i := range s {
		s[i] = start
		start += step
	}
	return s
}