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



Sample input:
3 2


Sample output:
2

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
import numpy as np
# 整数の入力
n, k = map(int, input().split())
numlist = np.arange(1,n+1)
j = 0
if k == 1:
    print(n)
else:
    for i in range(0,n-1):
        a = numlist[i:i+k]
        if a[k-1] == n:
            j += 1
            break
        else:
            j += 1
            pass
    print(j)

Submission status: Accepted

Solution code:

def main():
    N, K = map(int, [int(x) for x in input().split()])
    return print(N-K+1)


if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
N, K = [int(x) for x in input().split(' ')]

output = N - K + 1

print(int(output))

Submission status: Accepted

Solution code:
n = list(map(int, input().split()))
a =[]
c = 1
b = []

for i in range(1, n[0]+1):
    b.append(i)

for j in range(1, n[1]+1):
    a.append(j)

for k in range(b[-1]):
    if b[-1] == a[-1]:
        print(c)
        break
    else:
        a[-1] += 1
        c += 1

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-

def infinite_product(n, k):
    inpr = 1
    if k == 0:
        k = 1
    
    for i in range(n, k+1):
        inpr *= i
    
    return inpr


s = input().split()
N = int(s[0])
K = int(s[1])

print(N-K+1)

Submission status: Accepted

Solution code:
n,k = [int(i) for i in input().split()]
print(n-k+1)

Submission status: Accepted

Solution code:
p=input().rstrip().split(' ')
if int(p[0])==int(p[1]):
    print(1)
elif int(p[1])>int(p[0]):
    print(0)
else:
    print(int(p[0])-int(p[1])+1)

Submission status: Accepted

Solution code:
def main():
    A, B = [int(i) for i in input().split()]
    print(A - B + 1)
if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
# coding: utf-8
import sys
# import bisect
# import math
# import numpy as np


"""Template"""


class IP:
    """
    入力を取得するクラス
    """
    def __init__(self):
        self.input = sys.stdin.readline

    def I(self):
        """
        1文字の取得に使います
        :return: int
        """
        return int(self.input())

    def S(self):
        """
        1文字の取得(str
        :return: str
        """
        return self.input()

    def IL(self):
        """
        1行を空白で区切りリストにします(int
        :return: リスト
        """
        return list(map(int, self.input().split()))

    def SL(self):
        """
        1行の文字列を空白区切りでリストにします
        :return: リスト
        """
        return list(map(str, self.input().split()))

    def ILS(self, n):
        """
        1列丸々取得します(int
        :param n: 行数
        :return: リスト
        """
        return [int(self.input()) for _ in range(n)]

    def SLS(self, n):
        """
        1列丸々取得します（str
        :param n: 行数
        :return: リスト
        """
        return [self.input() for _ in range(n)]

    def SILS(self, n):
        """
        Some Int LineS
        横に複数、縦にも複数
        :param n: 行数
        :return: list
        """
        return [self.IL() for _ in range(n)]

    def SSLS(self, n):
        """
        Some String LineS
        :param n: 行数
        :return: list
        """
        return [self.SL() for _ in range(n)]


class Idea:
    def __init__(self):
        pass

    def HF(self, p):
        """
        Half enumeration
        半分全列挙です
        pの要素の和の組み合わせを作ります。
        ソート、重複削除行います
        :param p: list : 元となるリスト
        :return: list : 組み合わせられた和のリスト
        """
        return sorted(set(p[i] + p[j] for i in range(len(p)) for j in range(i, len(p))))

    def Bfs2(self, a):
        """
        bit_full_search2
        bit全探索の改良版
        全探索させたら2進数のリストと10進数のリストを返す
        :return: list２つ : １個目 2進数(16桁)  2個目 10進数
        """
        # 参考
        # https://blog.rossywhite.com/2018/08/06/bit-search/
        # https://atcoder.jp/contests/abc105/submissions/4088632
        value = []
        for i in range(1 << len(a)):
            output = []

            for j in range(len(a)):
                if self.bit_o(i, j):
                    """右からj+1番目のiが1かどうか判定"""
                    # output.append(a[j])
                    output.append(a[j])
            value.append([format(i, 'b').zfill(16), sum(output)])

        value.sort(key=lambda x: x[1])
        bin = [value[k][0] for k in range(len(value))]
        val = [value[k][1] for k in range(len(value))]
        return bin, val

    def S(self, s, r=0, m=-1):
        """
        ソート関係行います。色々な設定あります。
        :param s: 元となるリスト
        :param r: reversするかどうか 0=False 1=True
        :param m: （2次元配列）何番目のインデックスのソートなのか
        :return: None
        """
        r = bool(r)
        if m == -1:
            s.sort(reverse=r)
        else:
            s.sort(reverse=r, key=lambda x: x[m])

    def bit_n(self, a, b):
        """
        bit探索で使います。0以上のときにTrue出します
        自然数だからn
        :param a: int
        :param b: int
        :return: bool
        """
        return bool((a >> b & 1) > 0)

    def bit_o(self, a, b):
        """
        bit探索で使います。1のときにTrue出すよ
        oneで1
        :param a: int
        :param b: int
        :return: bool
        """
        return bool(((a >> b) & 1) == 1)

    def ceil(self, x, y):
        """
        Round up
        小数点切り上げ割り算
        :param x: int
        :param y: int
        :return: int
        """
        return -(-x//y)

    def ave(self, a):
        """
        平均を求めます
        :param a: list
        :return: int
        """
        return sum(a) / len(a)

    def xor(self, x1, x2):
        return int(bin(x1 ^ x2), 2)


"""ここからメインコード"""


def main():
    # 1文字に省略
    r, e = range, enumerate
    ip = IP()
    id = Idea()

    """この下から書いてね"""
    n, k = ip.IL()
    print(n-k+1)



main()

Submission status: Accepted

Solution code:
n,k=[int(i) for i in input().split()]
print(n-k+1)

Submission status: Accepted

Solution code:
N, K = map(int, input().split())
print(N-(K-1))

Submission status: Accepted

Solution code:
n,k = input().split()
N = int(n)
K = int(k)
print(N-K+1)

Submission status: Accepted

Solution code:
N, K = [int(c) for c in input().split()]
print(N - K + 1)

Submission status: Accepted

Solution code:
n, k = list(map(int, input().split()))
print(n - ( k -1))

Submission status: Accepted

Solution code:
#https://atcoder.jp/contests/diverta2019/tasks/diverta2019_a
# -*- coding: utf-8 -*-

n,k = map(int,input().split())

answer = n-k+1
if n < k :
        answer = 0
print( answer )

Submission status: Accepted

Solution code:
N, K = map(int, input().split())

ans = N - K + 1
print(ans)

Submission status: Accepted

Solution code:
N,K = map(int,input().split())
print(N - (K-1))

Submission status: Accepted

Solution code:
import sys
import itertools

N, K = map(int, sys.stdin.readline().split())

ans = N - K + 1

print(ans)

Submission status: Accepted

Solution code:
N,K = map(int,input().split())

print(N-(K-1))

Submission status: Accepted

Solution code:
n,k = map(int,input().split()) 
print ((n-k)+1)

Submission status: Accepted

Solution code:
n,m=list(map(int,input().split()))
print(n-m+1)

Submission status: Accepted

Solution code:
N, K= map(int, input().split())

print(N+1-K)

Submission status: Accepted

Solution code:
Array = [int(x) for x in input().split()]
N = Array[0]
K = Array[1]

print(N-(K-1))

Submission status: Accepted

Solution code:
n,k=map(int,input().split())

for i in range(k):
      nm=[i,1+i ]
for j in range (n):
      nm1=[i,1+i]
print(n-k+1)

Submission status: Accepted

Solution code:
N, K = list(map(int, input().split(' ')))

print(N - (K-1))

Submission status: Accepted

Solution code:

N,K= list(map(int,input().split()))
print(N-K+1)

Submission status: Accepted

Solution code:
a = raw_input()
n,k = a.split(" ")
print int(n)-int(k)+1

Submission status: Accepted

Solution code:
n,k=map(int, input().split()) 
a = range(1, n)
k = k - 1
print(len([a[i:i+k] for i in range(n-k)]))

Submission status: Accepted

Solution code:
n, k = [int(i) for i in input().split()]
print(n - k + 1)

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-

N, K = map(int, raw_input().split())

print str(N-K+1)

Submission status: Accepted

Solution code:
n, k = map(int, input().split())
print(max(0, n - k + 1))

Submission status: Accepted

Solution code:
from sys import stdin

A, B = stdin.readline().rstrip().split()

print(int(A) - int(B) + 1)

Submission status: Accepted

Solution code:
n, k = (int(i) for i in input().split())
print(n-k+1)

Submission status: Accepted

Solution code:
N, K =map(int,input().split())
print(N-(K-1))

Submission status: Accepted

Solution code:
a, b = map(int, input().split())
ans = 0

for i in range(1, a+1):
    if i + b - 1 <= a:
        ans = ans + 1

print(ans)

Submission status: Accepted

Solution code:
import sys
import random
import itertools
sys.setrecursionlimit(20000000)
input = sys.stdin.readline
n,k = map(int,input().split())
print(n-k+1)

Submission status: Accepted

Solution code:
n, k = (int(i) for i in input().split()) 
a =  n - k + 1
print( a)

Submission status: Accepted

Solution code:
import collections as c
ip = lambda : map(int, input().split())

#################
N,K = ip()
print(N-K+1)

Submission status: Accepted

Solution code:
N,K= map(int, input().split())
print(N-K +1)

Submission status: Accepted

Solution code:
n, k = map(int,input().split() )
count = 0
for i in range(0,n+1):
    #print("ifの前","i+k=",i+k)
    if i + k <= n:
        count+=1
    else:
        pass
print(count)

Submission status: Accepted

Solution code:
N,K = (int(i) for i in input().split())
n = [i for i in range(1,N+1)]
ans = []
for i in range(len(n)-K+1):
    tmp = []
    for j in range(K):
        tmp.append(n[j+i])
    ans.append(tmp)
print(len(ans))

Submission status: Accepted

Solution code:
n, k = [int(_) for _ in input().split()]
print(n-k+1)

Submission status: Accepted

Solution code:
n, m = map(int, input().split())
print(n - m + 1)

Submission status: Accepted

Solution code:
def main():
    n, k = map(int, input().split())

    print(n-k+1)


if __name__=='__main__':
    main()

Submission status: Accepted

Solution code:
# https://atcoder.jp/contests/diverta2019/tasks/diverta2019_a
import itertools
from collections import Counter
from collections import defaultdict
import bisect


def main():
    N, K = map(int, input().split())
    print(N - K + 1)

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
n,k=map(int, input().split())
print(n-(k-1))

Submission status: Accepted

Solution code:
N, K = [int(s) for s in input().split()]

print(N-K+1)

Submission status: Accepted

Solution code:
n, k = map(int, input().split(" "))
print(n-k+1)

Submission status: Accepted

Solution code:
N, K = map(int, input().split())
l = []
count = 0
j = 0
for i in range(1,N+1):
  l.append(i)
while True:
  j += 1
  if j + K-2 >= len(l):
    break
  count += 1
print(count)

Submission status: Accepted

Solution code:
def combinations(N, K):
    N = int(N)
    K = int(K)
    if N == K:
        return 1
    else:
        return N - K + 1
    
N, K = input().split(' ')

print(combinations(N, K))

Submission status: Accepted

Solution code:
a, b = map(int,input().split())
print(a-b+1)

Submission status: Accepted

Solution code:
###############################################################################

from sys import stdout
from bisect import bisect_left as binl
from copy import copy, deepcopy


mod = 1


def intin():
    input_tuple = input().split()
    if len(input_tuple) <= 1:
        return int(input_tuple[0])
    return tuple(map(int, input_tuple))


def intina():
    return [int(i) for i in input().split()]


def intinl(count):
    return [intin() for _ in range(count)]


def modadd(x, y):
    global mod
    return (x + y) % mod


def modmlt(x, y):
    global mod
    return (x * y) % mod


def lcm(x, y):
    while y != 0:
        z = x % y
        x = y
        y = z
    return x


def combination(x, y):
    assert(x >= y)

    if y > x // 2:
        y = x - y

    ret = 1

    for i in range(0, y):
        j = x - i
        i = i + 1

        ret = ret * j
        ret = ret // i

    return ret


def get_divisors(x):
    retlist = []
    for i in range(1, int(x**0.5) + 3):
        if x % i == 0:
            retlist.append(i)
            retlist.append(x // i)
    return retlist


def get_factors(x):
    retlist = []
    for i in range(2, int(x**0.5) + 3):
        while x % i == 0:
            retlist.append(i)
            x = x // i
    retlist.append(x)
    return retlist


def make_linklist(xylist):
    linklist = {}
    for a, b in xylist:
        linklist.setdefault(a, [])
        linklist.setdefault(b, [])
        linklist[a].append(b)
        linklist[b].append(a)
    return linklist


def calc_longest_distance(linklist, v=1):
    distance_list = {}
    distance_count = 0
    distance = 0
    vlist_previous = []
    vlist = [v]
    nodecount = len(linklist)

    while distance_count < nodecount:
        vlist_next = []
        for v in vlist:
            distance_list[v] = distance
            distance_count += 1
            vlist_next.extend(linklist[v])
        distance += 1
        vlist_to_del = vlist_previous
        vlist_previous = vlist
        vlist = list(set(vlist_next) - set(vlist_to_del))

    max_distance = -1
    max_v = None
    for v, distance in distance_list.items():
        if distance > max_distance:
            max_distance = distance
            max_v = v

    return (max_distance, max_v)


def calc_tree_diameter(linklist, v=1):
    _, u = calc_longest_distance(linklist, v)
    distance, _ = calc_longest_distance(linklist, u)
    return distance


###############################################################################


def main():
    n, k = intin()
    print(n - k + 1)


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
N,K = map(int, input().split())
print(N-K+1)

Submission status: Accepted

Solution code:
n, k = [int(n) for n in input().split()]
print(n - k + 1)

Submission status: Accepted

Solution code:
l = list(map(int,input().split()))

print(l[0] - l[1] + 1)

Submission status: Accepted

Solution code:
# from itertools import combinations


def main(N, K):
    # nums = [i for i in range(N)]
    # return len(list(combinations(nums, K)))

    return N - K + 1


if __name__ == "__main__":
    N, K = list(map(int, input().split()))
    print(main(N, K))

Submission status: Accepted

Solution code:
n,k = map(int,input().split())
c = 0
print(n-k+1)

Submission status: Accepted

Solution code:
import numpy as np

n,k=list(map(int,input().split()))
print(n-k+1)

Submission status: Accepted

Solution code:
n, k = [int(i) for i in input().split(" ")]
print(n - k + 1)

Submission status: Accepted

Solution code:
N,K = map(int,input().split())
A = N-K+1
print(A)

Submission status: Accepted

Solution code:
n,k = map(int,input().split())
print(n-(k-1))

Submission status: Accepted

Solution code:
n = input().split()

max_num = int(n[0])
kernel = int(n[1])

print(max_num - kernel + 1)

Submission status: Accepted

Solution code:
# coding: utf-8
# Your code here!

inp = input().split()
N = int(inp[0])
K = int(inp[1])

c = N - K + 1

print(c)

Submission status: Accepted

Solution code:
line = input().split(" ")
N = int(line[0])
M = int(line[1])

count = 0
    
for i in range(1, N+1):
    for j in range(M):
        if i+j > N:
            break
        if j == M-1:
            count += 1

print(count)

Submission status: Accepted

Solution code:
N,K = (int(i) for i in input().split())
print (N - K + 1)

Submission status: Accepted

Solution code:
N,K = list(map(int,input().split(" ")))

ans = N-K+1
print(ans)

Submission status: Accepted

Solution code:
N, K = map(int, input().split(" "))
print(N - K + 1)

Submission status: Accepted

Solution code:
N,K=(int(i) for i in input().split())
print(N-K+1)

Submission status: Accepted

Solution code:
n,k=list(map(int,input().split()))
print(n-k+1)

Submission status: Accepted

Solution code:
list = [int(i) for i in input().split()]
print(list[0] - list[1] +1)

Submission status: Accepted

Solution code:
n,k = map(int,input().split())
flag = True
count = 0
while flag:
    if k <= n:
        count += 1
        k += 1
    else:
        flag = False
print(count)

Submission status: Accepted

Solution code:
n , k = map(int , input().split())
ans = n - k + 1
print(ans)

Submission status: Accepted

Solution code:
N, K = map(int,input().split())

print(int( N - (K - 1) ) )

Submission status: Accepted

Solution code:
N, K = map(int, input().split())
t = N - K + 1
print(t)

Submission status: Accepted

Solution code:
N, K =  map(int,input().split())
print(N-K+1)

Submission status: Accepted

Solution code:

v = [int(d) for d in input().split()]
#f = []

#for e in range(v[0]):
#    f.append(list(input()))

print(v[0]-v[1]+1)

Submission status: Accepted

Solution code:
import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,copy,functools
import random

sys.setrecursionlimit(10**7)
inf = 10**20
eps = 1.0 / 10**10
mod = 10**9+7
dd = [(-1,0),(0,1),(1,0),(0,-1)]
ddn = [(-1,0),(-1,1),(0,1),(1,1),(1,0),(1,-1),(0,-1),(-1,-1)]

def LI(): return list(map(int, sys.stdin.readline().split()))
def LLI(): return [list(map(int, l.split())) for l in sys.stdin.readlines()]
def LI_(): return [int(x)-1 for x in sys.stdin.readline().split()]
def LF(): return [float(x) for x in sys.stdin.readline().split()]
def LS(): return sys.stdin.readline().split()
def I(): return int(sys.stdin.readline())
def F(): return float(sys.stdin.readline())
def S(): return input()
def pf(s): return print(s, flush=True)
def pe(s): return print(str(s), file=sys.stderr)


def main():
    a,b = LI()

    return max(a - b + 1, 0)


print(main())

Submission status: Accepted

Solution code:
N, M = map(int, input().split())
print (N-M+1)

Submission status: Accepted

Solution code:
#!.//usr/bin/env python3
import sys


def solve(N: int, K: int):
    print(N-(K-1))
    return


# Generated by 1.1.4 https://github.com/kyuridenamida/atcoder-tools  (tips: You use the default template now. You can remove this line by using your custom template)
def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    N = int(next(tokens))  # type: int
    K = int(next(tokens))  # type: int
    solve(N, K)

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
import math

n,k = (int(i) for i in input().split()) 
print(n-k+1)

Submission status: Accepted

Solution code:
a,b = [ int(x) for x in input().split() ]
print( a-b+1 )

Submission status: Accepted

Solution code:
def main():
    NK = list(map(int, input().split()))
    N, K = NK[0], NK[1]
    ans = 0
    while N >= K:
        N = N - 1
        ans += 1
    print(ans)
main()

Submission status: Accepted

Solution code:
N, K = [int(x) for x in input().split()]

x = [i for i in range(1, N+1)]

summ = 0

for i, n in enumerate(x):
	if i + K <= len(x):
		summ=summ+1

print(summ)

Submission status: Accepted

Solution code:
n, k = map(int, input().split())
print(n - k  + 1)

Submission status: Accepted

Solution code:
def main():
    N, K = map(int, input().split())
    ans = 0
    print(N - K + 1)


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
n,k = map(int, input().strip().split())

print(n-k+1)

Submission status: Accepted

Solution code:
l = list(map(int, input().split(' ')))

#num = int(input())
#S = str(input())
print(l[0]-l[1]+1)

Submission status: Accepted

Solution code:
N, K = map(int, input().split())


def calc_pattern_of_continuious_integers(N, K):
    return N - K + 1


print(calc_pattern_of_continuious_integers(N, K))

Submission status: Accepted

Solution code:
import math
def main():
    N, K = map(int, input().split())
    count = 0
    flag = True
    while flag:
        if N - K < 0:
            flag = False
        else:
            N -= 1
            count += 1
    print(count)
main()

Submission status: Accepted

Solution code:
n,r= map(int, input().split())
c=0
for i in range(1,n+1):
    if i+r<=n+1:
        c+=1
    else:
        exit
        
print(c)

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
# スペース区切りの整数の入力
N, K = map(int, input().split())
# 出力
print("{}".format(N-K+1))

Submission status: Accepted

Solution code:
'''
A - Consecutive Integers
'''

import itertools

n, k = map(int, input().split())

ans = 0
for i in range(1, n+1):
    if i + k - 1 <= n:
        ans += 1

print(ans)

Submission status: Accepted

Solution code:
n,k = map(int,input().split())

ans = n-k+1

print(ans)

Submission status: Accepted

Solution code:


n,k = map(int,input().split(" "))


arr = [i for i in range(1,n+1)]
# print(arr)
c = 0

for i in range(0,n-k+1):
	# print(arr[i:i+k])
	c += 1

print(c)

Submission status: Accepted

Solution code:
N,K=map(int,input().split())

ans=N-K+1

print(ans)

Submission status: Accepted

Solution code:
N, K = list(map(int, input().split())) # 整数
print(N-K+1)

Submission status: Accepted

Solution code:
n,k = list(map(int, input().split()))
print(str(n-k+1))

Submission status: Accepted

Solution code:
N, K= map(int, input().split())

print(N-K+1)

Submission status: Accepted

Solution code:
N,K = list(map(int,input().strip().split(" ")))
out = N - K + 1
print(out)

Submission status: Accepted

Solution code:
N, K = map(int, input().split())

n = []
for i in range(N):
    n.append(i)

num = 0
ind = 0
while (len(n) - K) >= 0:
    n.pop(0)
    num += 1

print(num)

Submission status: Accepted

Solution code:
N, K = map(int, input().split())

print(N- K+1)

Submission status: Accepted

Solution code:
n,k=map(int, input().split())
print(n-k+1)

Submission status: Accepted

Solution code:
# 最初にKとるとすると残りはN-K個ぶん進める

n, k = map(int, input().split())
print(n-k+1)

Submission status: Accepted

Solution code:
N,K = list(map(int,input().split()))
num = N - K + 1
print(num)

Submission status: Accepted

Solution code:
import os, sys, re, math

n,k = input().split(' ')
print(int(n)-int(k)+1)

Submission status: Accepted

Solution code:
# coding: utf-8
n, k = map(int, input().split())
print(n-k+1)

Submission status: Accepted

Solution code:
l = []
l = list(map(int,input().split()))

ans = l[0] - l[1] + 1
print(ans)

Submission status: Accepted

Solution code:
n,k = map(int,input().split())
print(n -k + 1)

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
import sys

p = [int(i) for i in input().split()]

print(p[0] - p[1] + 1)

Submission status: Accepted

Solution code:
N, K = [int(elem) for elem in input().split()]

print(N - K + 1)

Submission status: Accepted

Solution code:
# coding: utf-8
# Your code here!
num = input().split()
num1 = int(num[0])
retu = int(num[1])
kazu = 0
hint=[]
for i in range(num1):
    hint.append(i)
while len(hint) >= retu:
    kazu+=1
    hint.pop(0)
print(kazu)

Submission status: Accepted

Solution code:
#https://atcoder.jp/contests/diverta2019/tasks/diverta2019_a

NK = [int(i) for i in input().split()]

print(NK[0]-NK[1]+1)

Submission status: Accepted

Solution code:
import sys
from collections import deque
import copy
import math
def get_read_func(fileobject):
    if fileobject == None :
        return raw_input
    else:
        return fileobject.readline



def main():
    if len(sys.argv) > 1:
        f = open(sys.argv[1])
    else:
        f = None
    read_func = get_read_func(f);
    input_raw = read_func().strip().split()
    [N, K] = [int(input_raw[0]), int(input_raw[1])]
    print N - K + 1

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
n, k = [int(c) for c in input().split()]

print(n-k+1)

Submission status: Accepted

Solution code:
s = input().split(" ")
s = [int(s[i]) for i in range(2)]
A = s[0]
B = s[1]
print(A - B + 1)

Submission status: Accepted

Solution code:
n,k = map(int,input().split())
n1 = n + 1
ans = 0
for i in range(1,n1):
    if n >= k:
        ans += 1
        n -= 1
    else:
        break
print(ans)

Submission status: Accepted

Solution code:

N, K = list(map(int, input().split()))

print(N - K + 1)

Submission status: Accepted

Solution code:
all=1;
s = input()

s = s.split(" ")
n = int(s[0])
k = int (s[1])
answer = n-(k-1)
print(answer)

Submission status: Accepted

Solution code:
n= list(map(int,input().split()))

count = 0
for i in range(n[0]):
  next = i + (n[1]-1)
  # print(i, next, n[0])
  if(next >= n[0]):
    break
    
  count += 1
  
print(count)

Submission status: Accepted

Solution code:
N, K = [int(x) for x in input().split()]
print(N-K+1)

Submission status: Accepted

Solution code:
n, k = map(int, input().split())
x = n -k + 1
print(x)

Submission status: Accepted

Solution code:
def main():
    n, k = list(map(int, input().split()))
    print(n-k+1)


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
n, k = map(int, input().split())
c = n - k + 1
print(c)

Submission status: Accepted

Solution code:
#! usr/bin/env python
# -*- coding: utf-8 -*-

from collections import deque
import heapq
import math
import bisect


def main():
    N, K = map(int, input().split())
    print(N-K+1)


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
"""
Created on Sat Apr 20 20:47:47 2019

@author: Owner
"""

# -*- coding: utf-8 -*-
"""
Created on Sat Apr 13 09:53:12 2019

@author: Owner
"""
import numpy as np
import sys
import collections
import scipy.misc
import math
from operator import itemgetter
import itertools
import copy
import bisect

#素因数を並べる
def prime_decomposition(n):
  i = 2
  table = []
  while i * i <= n:
    while n % i == 0:
      n /= i
      table.append(int(i))
    i += 1
  if n > 1:
    table.append(int(n))
  return table   
# 桁数を吐く
def digit(i):
    if i > 0:
        return digit(i//10) + [i%10]
    else:
        return []
    
def getNearestValueIndex(list, num):
    """
    概要: リストからある値に最も近い値のインデックスを取得する関数
    @param list: データ配列
    @param num: 対象値
    @return 対象値に最も近い値
    """

    # リスト要素と対象値の差分を計算し最小値のインデックスを取得
    idx = np.abs(np.asarray(list) - num).argmin()
    return idx

def find_index(l, x, default=False):
    if x in l:
        return l.index(x)
    else:
        return default


"""
N, X = map(int, input().split())

x = list(map(int, input().split()))

P = [0]*N
Y = [0]*N
for n in range(N):
    P[n], Y[n] = map(int, input().split())

# 多次元配列の宣言（あとでintにすること。）（タプルにすること。）
dp = np.zeros((N+1, 4,4,4))
    
all(nstr.count(c) for c in '753')

# 複数配列を並び替え
ABT = zip(A, B, totAB)
result = 0
# itemgetterには何番目の配列をキーにしたいか渡します
sorted(ABT,key=itemgetter(2))
A, B, totAB = zip(*ABT)
A.sort(reverse=True)

# 2進数のbit判定
(x >> i) & 1

# dp最小化問題
dp = [np.inf]*N
for n in range(N):
    if n == 0:
        dp[n] = 0
    else:
        for k in range(1,K+1):
            if n-k >= 0:
                dp[n] = min(dp[n], dp[n-k] + abs(h[n]-h[n-k]))
            else:
                break
# 累積和
add = 1 # 問題によって決まる
res = 0
sums = [0]*(len(nums)+1)
for i in range(len(nums)):
    sums[i+1] = sums[i] + nums[i]
for i in range(0, len(nums), 2):
    left = i
    right = min(i+add, len(nums))
    tmp = sums[right] - sums[left]
    res = max(tmp, res)

#２分探索
li, ri = bisect.bisect_left(p_ac, l[i]-1), bisect.bisect_right(p_ac, r[i]-1)    

#ソート関数
org_list = [3, 1, 4, 5, 2]
new_list = sorted(org_list)
print(org_list)
print(new_list)
# [3, 1, 4, 5, 2]
# [1, 2, 3, 4, 5]

#Distance Transformation
    for h in range(0,H):
        for w in range(0,W):
            if h == 0 and w == 0:
                pass
            elif h == 0:
                D[H-h-1][W-w-1]= min(D[H-h-1][W-w-1], D[H-h-1][W-w]+1)
            elif w == 0:   
                D[H-h-1][W-w-1]= min(D[H-h-1][W-w-1], D[H-h][W-w-1]+1)
            else:
                D[H-h-1][W-w-1]= min(D[H-h-1][W-w-1], D[H-h][W-w-1]+1, D[H-h-1][W-w]+1, D[H-h][W-w]+2)
            d_max = max(D[H-h-1][W-w-1], d_max)

"""
N, K = list(map(int, input().split()))
def main(): 
    print(N-K+1)
                
                
                
            
            
                

    
if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
from collections import defaultdict, deque, Counter
def inpl(): return list(map(int, input().split()))

N, K = inpl()
print(N-K+1)

Submission status: Accepted

Solution code:
n, k = map(int,input().split())

print(n-k+1)

Submission status: Accepted

Solution code:
N, K = list(map(int, input().split()))

print(N - (K - 1))

Submission status: Accepted

Solution code:
n, k = map(int, input().split())
count = 0
for i in range(1, n+1):
  if i+k <= n+1:
    count+=1
print(count)

Submission status: Accepted

Solution code:
# coding: utf-8
# Your code here!
 
N, K = map(int, input().rstrip().split(' '))
print(N - K + 1)

Submission status: Accepted

Solution code:
def input_from_console():
    n, k = map(int, input().split())

    return n, k


def nCr(n,r):
    f = math.factorial
    return f(n) / f(r) / f(n-r)


def main():
    n, k = input_from_console()
    print(n-k+1)



if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
num, target = map(int, input().split())

print(num - target + 1)
exit(0)

Submission status: Accepted

Solution code:
n,k =map(int,input().split())
print(n-k+1)

Submission status: Accepted

Solution code:
n, k = map(int, input().split())

ans = n - k +1
print(ans)

Submission status: Accepted

Solution code:
N , K = (int(x) for x in input().split())
ans = N - K + 1
print(ans)

Submission status: Accepted

Solution code:
l = [int(i) for i in input().split(' ')]
print(l[0] - (l[1]-1))

Submission status: Accepted

Solution code:
N, K = input().split()
N = int(N)
K = int(K)
print(N - K + 1)

Submission status: Accepted

Solution code:
N, K =  map(int, input().split())
print(N-(K-1))

Submission status: Accepted

Solution code:
[N,K] = list(map(int,input().split()))
print(N-K+1)

Submission status: Accepted

Solution code:
n, k = map(int, input().split())
ans = 0
ans = n - k + 1
print(ans)

Submission status: Accepted

Solution code:
a = input().split()
print(int(a[0])-int(a[1])+1)

Submission status: Accepted

Solution code:
N,K=(int(i) for i in input().split())


print(N-K+1)

Submission status: Accepted

Solution code:
N,K=map(int, input().split())
print(N-K+1)

Submission status: Accepted

Solution code:
[n, k] = input().split(' ')
print(int(n) - int(k) + 1)

Submission status: Accepted

Solution code:
n,k = map(int,input().split())

print(n - k + 1)

Submission status: Accepted

Solution code:
N,K = map(int,input().split())


s = []
for i in range(1,N + 1):
    s.append(str(i))

tmp = [''.join(s[i:i+K]) for i in range(len(s)-K+1)]


print(len(tmp))

Submission status: Accepted

Solution code:
# coding: utf-8
N, K = map(int, input().split())
print(N - K + 1)

Submission status: Accepted

Solution code:
import math
N,K = map(int,input().split())
print(N-K+1)

Submission status: Accepted

Solution code:
A,B=map(int,input().split())
print(A-B+1)

Submission status: Accepted

Solution code:
N, K = (int(i) for i in input().split())

print(N - K + 1)

Submission status: Accepted

Solution code:
N, K = map(int,input().split(" "))
print(N - K + 1)

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
n,k = map(int, input().split())
print(n-k+1)