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:
#!/usr/bin/env python3

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())

print(n-(k-1))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
 
import math
import itertools
import sys
import copy
 
# 入力
#A, B, C, D = map(int, input().split())
#L = list(map(int, input().split()))
#S = list(str(input()))
#N = int(input())
#S = str(input())
N, K = map(int, input().split())

print (N-K+1)

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
import sys, math, itertools, collections, bisect
input = lambda: sys.stdin.buffer.readline().rstrip().decode('utf-8')
inf = float('inf') ;mod = 10**9+7
mans = inf ;ans = 0 ;count = 0 ;pro = 1

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

Submission status: Accepted

Solution code:
def main():
    N,K = map(int,input().split())
    print(N+1-K)
if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
from sys import stdin

a,b = [int(x) for x in stdin.readline().rstrip().split()]

print(a-b+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())
# print(a-b+1)

cnt = 0
for i in range(a):
    for j in range(i, a):
        if j - i + 1 == b:
            cnt += 1

print(cnt)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a = list(map(int,input().split()))
N=a[0]
K=a[1]

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 = map(int, input().split())
print(N - K + 1)

Submission status: Accepted

Solution code:
def main(n: int, k: int):
    print(n - k + 1)


if __name__ == "__main__":
    n, k = map(int, input().split())

    main(n, k)

Submission status: Accepted

Solution code:
import sys


def solve():
    readline = sys.stdin.buffer.readline
    mod = 10 ** 9 + 7
    n, k = list(map(int, readline().split()))
    print(n - k + 1)


if __name__ == '__main__':
    solve()

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

ans = N - K + 1
print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

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(max(0,n-k+1))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# diverta 2019 Programming Contest: A – Consecutive Integers
n, k = [int(s) for s in input().split()]
print(n - k + 1)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def slove():
    import sys
    input = sys.stdin.readline
    n, k = list(map(int, input().rstrip('\n').split()))
    print(n - k + 1)


if __name__ == '__main__':
    slove()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
input = sys.stdin.readline
 
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())
r = N-K++1
print(r)

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
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:
# coding: utf-8
# Your code here!

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

# print(N)
# print(K)

print(N - (K - 1))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N, K = [int(_) for _ 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())
ans = N - K + 1
print(ans)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def solve(n, k):
    return n - k + 1

n, k = map(int, input().split())
print(solve(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:
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, k = map(int, input().split())
Answer = n - k + 1
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, M = map(int, input().split())
ans = N-M+1
print(ans)

Submission status: Accepted

Solution code:
#n = int(input())
#m = int(input())
#k = int(input())
#n, m = map(int, input().split())
n,  k = map(int, input().split())
#a = list(map(int, input().split()))
#table = []
'''
for i in range h:
    temp = list(map(int, input().split()))
    table.append(temp)
'''
print(n-k+1)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n, m = list(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:
#!usr/bin/env python3
from collections import defaultdict
from collections import deque
from heapq import heappush, heappop
import sys
import math
import bisect
import random
def LI(): return list(map(int, sys.stdin.readline().split()))
def I(): return int(sys.stdin.readline())
def LS():return list(map(list, sys.stdin.readline().split()))
def S(): return list(sys.stdin.readline())[:-1]
def IR(n):
    l = [None for i in range(n)]
    for i in range(n):l[i] = I()
    return l
def LIR(n):
    l = [None for i in range(n)]
    for i in range(n):l[i] = LI()
    return l
def SR(n):
    l = [None for i in range(n)]
    for i in range(n):l[i] = S()
    return l
def LSR(n):
    l = [None for i in range(n)]
    for i in range(n):l[i] = LS()
    return l
sys.setrecursionlimit(1000000)
mod = 1000000007

#A
def A():
    n,k = LI()
    print(n-k+1)
    return

#B
def B():
    n = I()

    return

#C
def C():
    n = I()

    return

#D
def D():
    n = I()

    return

#E
def E():
    n = I()

    return

#F
def F():
    n = I()

    return

#G
def G():
    n = I()

    return

#H
def H():
    n = I()

    return

#I
def I_():
    n = I()

    return

#J
def J():
    n = I()

    return

#Solve
if __name__ == "__main__":
    A()

Submission status: Accepted

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

ans = 0

for i in range(N):
  if i+K <= N:
    ans += 1
  else:
    break

print(ans)

Submission status: Accepted

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

print(N-(K-1))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# coding: utf-8
# submission # - User: herp_sy
# https://atcoder.jp/contests/

import math
import statistics

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

Submission status: Accepted

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

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(" "))
print(N - K + 1)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n, k = [ int(v) for v 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:
n, k = [int(i) for i in input().split()]
print(n - k + 1)

Submission status: Accepted

Solution code:

nl = lambda: list(map(int, input().split()))
sl = lambda: input().split()
n = lambda: int(input())
s = lambda: input()

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

Submission status: Accepted

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

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

print n-(k-1)

Submission status: Accepted

Solution code:
from collections import defaultdict, Counter
from itertools import product, groupby, count, permutations, combinations
from math import pi, sqrt
from collections import deque
from bisect import bisect, bisect_left, bisect_right
from string import ascii_lowercase
from functools import lru_cache
import sys
sys.setrecursionlimit(10000)
INF = float("inf")
YES, Yes, yes, NO, No, no = "YES", "Yes", "yes", "NO", "No", "no"
dy4, dx4 = [0, 1, 0, -1], [1, 0, -1, 0]
dy8, dx8 = [0, -1, 0, 1, 1, -1, -1, 1], [1, 0, -1, 0, 1, 1, -1, -1]


def inside(y, x, H, W):
    return 0 <= y < H and 0 <= x < W


def ceil(a, b):
    return (a + b - 1) // b


# aとbの最大公約数
def gcd(a, b):
    if b == 0:
        return a
    return gcd(b, a % b)


# aとbの最小公倍数
def lcm(a, b):
    g = gcd(a, b)
    return a / g * b


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


if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

print(N + 1 - K)

Submission status: Accepted

Solution code:
n, k = tuple(int(x) for x in raw_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())
print(N-K+1)

Submission status: Accepted

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

"""
import sys


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


def main(args):
    N, K = map(int, input().split())
    ans = solve(N, K)
    print(ans)


if __name__ == '__main__':
    main(sys.argv[1:])

Submission status: Accepted

Solution code:
# -*- coding:utf-8 -*-
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)

Submission status: Accepted

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

print(n - (k - 1))

Submission status: Accepted

Solution code:
from collections import defaultdict
import sys,heapq,bisect,math,itertools,string,queue,datetime
sys.setrecursionlimit(10**8)
INF = float('inf')
mod = 10**9+7
eps = 10**-7
def inpl(): return list(map(int, input().split()))
def inpl_str(): return list(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:
a,b = map(int, input().split())
print("{}".format(a-b+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 =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:
from sys import exit

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 = map(int,input().split())
print(N - M + 1)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

#print "integers are: ", n, k,  n-k

print n-k +1

Submission status: Accepted

Solution code:
import sys,heapq
from collections import deque,defaultdict
printn = lambda x: sys.stdout.write(x)
inn = lambda : int(input())
inl   = lambda: list(map(int, input().split()))
inm   = lambda:      map(int, input().split())
DBG = True # and False
def ddprint(x):
  if DBG:
    print(x)

n,k = inm()
print(n-k+1)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import numpy as np

# input
l = list(map(int, input().split()))
A = l[0] # Aの値が出力される
B = l[1] # Bの値が出力される

print( A - (B-1) )

Submission status: Accepted

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

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 = int(input())

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

ans = N - (K - 1)

print (ans)

Submission status: Accepted

Solution code:
'''input
3 2
'''

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,K=map(int,input().split())
#num_list=[x for x in range(1,N)]
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:
import sys

def main(inp):
    n,k = map(int,next(inp).split())
    return n-k+1
  
print(main(sys.stdin))

Submission status: Accepted

Solution code:
N, K = map(int, input().strip().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:
read = input
n, k = map(int, read().split())
print(n-k+1)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# div2019A - Consecutive Integers
n, k = list(map(int, input().rstrip().split()))
print(n - k + 1)

Submission status: Accepted

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

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:
N, K = map(int, input().split())
print(N - (K - 1))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n, k = list(map(int, 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:
N,K = map(int,input().split())
print(N - K + 1)

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
import numpy as np
import math
import statistics as sta



def main():
    num=list(map(int,input().split()))
    ans=num[0]-num[1]+1
    print(ans)


if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# coding: utf-8

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

N = l[0]
K = l[1]

print(N - K + 1)

Submission status: Accepted

Solution code:
print(eval(input().replace(" ","+1-")))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
def input(): return sys.stdin.readline().strip()

mi = lambda: map(int, input().split())

M, N = mi()

print(M-N+1)

Submission status: Accepted

Solution code:
n=input().split()
n[0]=int(n[0])
n[1]=int(n[1])
answer=n[0]-n[1]+1
if answer<=0:
    print("0")
else:
    print(answer)

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 = (int(x) for x in input().split())
print(str(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:
#def solver():
inputdata=input().split()
n=int(inputdata[0])
k=int(inputdata[1])
pointer=1
while pointer +k <= n:
  pointer = pointer +1

if n < k:
  print("0")
else:
  print(pointer)

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
# -*- coding: utf-8 -*-
import sys

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

Submission status: Accepted

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


if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N, K = 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 = 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, k =map(int, input().split())
print(n - k + 1)

Submission status: Accepted

Solution code:
n,k = map(int, input().split())
ans = 0
num = [i for i in range(1, k+1)]
while num[-1] <= n:

    num = [i+1 for i in num]
    ans += 1
print(ans)

Submission status: Accepted

Solution code:
print((lambda x,y:x-y+1)(*map(int,input().split())))

Submission status: Accepted

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

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())
print(N - K + 1)

Submission status: Accepted

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

print(N - K + 1)

Submission status: Accepted

Solution code:
i = list(map(int, input().split()))
print(i[0]-i[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:
tmp = input()
nul = tmp.rfind(' ')
n = int(tmp[:nul:])
k = int(tmp[nul + 1::])

print(n - (k - 1))

Submission status: Accepted

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

#print(math.factorial(N)//(math.factorial(K)*math.factorial(N-K)))
print(N-K+1)

Submission status: Accepted

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

answer = a[0] -	a[1] + 1

print(answer)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import math

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

Submission status: Accepted

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

a = N+1-K
print(a)

Submission status: Accepted

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

print(N + 1 - K)

Submission status: Accepted

Solution code:
from collections import defaultdict
import math


def kari():
    map(int, input().split())
    list(map(int, input().split()))
    math.ceil()

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


if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

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

import sys
import copy

sys.setrecursionlimit(1000000)

# input = sys.stdin.readline

# ~~~~~~~~~~~~~~~~~~~~~_(＾～＾ ｣ ∠)_~~~~~~~~~~~~~~~~~~

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)

ans = n - k + 1
print (ans)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
i = list(map(int, input().split()))
print(i[0] - i[1] + 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:
#!/usr/bin/env python3
# Atcoder necoak answer
# https://atcoder.jp/contests/diverta2019/tasks/diverta2019_a
import itertools

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

Submission status: Accepted

Solution code:
print(eval(input().replace(' ','-~-')))

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()
print(int(n) - int(k) + 1)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
print(eval(input().replace(' ','+1-')))

Submission status: Accepted

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

Submission status: Accepted

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


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


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
i = list(map(int, input().split()))
print(i[0] - i[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:
list = list(map(int,input().split()))
row = list[0]
col = list[1]
print((row-col)+1)

Submission status: Accepted

Solution code:
def solve():
    N,K = list(map(int,input().split())) 
    if K <= N:
        print(N-K+1)
    else:
        print(0)

solve()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#Consecutive Integers 

list1 = input().split()
print(int(list1[0]) - int(list1[1]) + 1)

Submission status: Accepted

Solution code:
n,k = [int(x) for x in input().strip().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:
NK = input().split()
NK = [int(s) for s in NK]

out = (NK[0] - NK[1]) + 1

print(out)

Submission status: Accepted

Solution code:
t = input()
l = t.split(" ")
N = int(l[0])
K = int(l[1])
count = 0
numbers = list(range(1, N+1))
while True:
    if len(numbers) >= K:
        numbers.pop(0)
        count = count + 1
    else:
        print(count)
        break

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:
A,B=map(int, input().split())
print(A-B+1)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a,b = list(map(int,input().split()))
print(a-b+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 = 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())

diff = n - k + 1
print(diff)

Submission status: Accepted

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

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:
# coding:utf-8

if __name__=="__main__":
  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:
y,z = map(int, input().split())
print(y + 1 - z )

Submission status: Accepted

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

Submission status: Accepted

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

import numpy as np
import scipy as sp

def main():
    try:
        input_list = input().split()
        N = int(input_list[0])
        K = int(input_list[1])
        print(N-K+1);
    except:
        pass

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
N, K = map(int, input().split())
ans = 0
for i in range(1, N + 1):
  if i + K - 1 <= N:
    ans += 1
  else:
    break

print('{}'.format(ans))

Submission status: Accepted

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

Submission status: Accepted

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

print(N-K+1)

Submission status: Accepted

Solution code:
# AtCoder Grand Contest 033
# https://atcoder.jp/contests/agc033
import sys

s2nn = lambda s: [int(c) for c in s.split(' ')]
ss2nn = lambda ss: [int(s) for s in list(ss)]
ss2nnn = lambda ss: [s2nn(s) for s in list(ss)]
i2s = lambda: sys.stdin.readline().rstrip()
i2n = lambda: int(i2s())
i2nn = lambda: s2nn(i2s())
ii2ss = lambda n: [sys.stdin.readline() for _ in range(n)]
ii2nn = lambda n: ss2nn(ii2ss(n))
ii2nnn = lambda n: ss2nnn(ii2ss(n))



def main():
    N, K = i2nn()
    print(N - K + 1)
main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
inp = input()
n, m = map(int, inp.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:



n, k = [int(i) for i in input().split()]

print(n-k+1)

Submission status: Accepted

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

ans = int(N-K+1)

print(ans)

Submission status: Accepted

Solution code:
def consecutive_integers(N: int, K: int)->int:
    return N - (K-1)


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

    ans = consecutive_integers(N, K)
    print(ans)

Submission status: Accepted

Solution code:
b, c = map(int, input().split())

print(b - c + 1)

Submission status: Accepted

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

print(n-(k-1))

Submission status: Accepted

Solution code:
from sys import stdin

N = [int(x) for x in stdin.readline().rstrip().split()]

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

Submission status: Accepted

Solution code:
inp = list(map(int,input().split()))
n = inp[0]
k = inp[1]

n -= k
count = 1

while(n != 0):
    n -= 1
    count += 1

print(count)

Submission status: Accepted

Solution code:
if __name__ == '__main__':
    N, K = map(int, input().split())

    answer = N - K + 1
    print(answer)

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())

z = 0
flag = True

for i in range(1, n+1):
    for j in range(1, k+1):
        if(j+z > n):
            flag = False
            break
    if(flag == True):
        z+=1

print(z)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n, k = list(int(x) for x in input().split())

ans = 0

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

print(ans)

Submission status: Accepted

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

Y = N - K + 1

print(Y)