Problem:


﻿Score: 100 points

Problem Statement

There is a farm whose length and width are A yard and B yard, respectively. A farmer, John, made a vertical road and a horizontal road inside the farm from one border to another, as shown below: (The gray part represents the roads.)

What is the area of this yard excluding the roads? Find it.

Note

It can be proved that the positions of the roads do not affect the area.

Constraints

A is an integer between 2 and 100 (inclusive).

B is an integer between 2 and 100 (inclusive).

Input

Input is given from Standard Input in the following format:

A B

Output

Print the area of this yard excluding the roads (in square yards).

Sample Input 1

2 2

Sample Output 1

1

In this case, the area is 1 square yard.

Sample Input 2

5 7

Sample Output 2

24

In this case, the area is 24 square yards. 



Sample input:
2 2


Sample output:
1

Submission status: Accepted

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

Submission status: Accepted

Solution code:
x,y = map(int,input().split())

print((x-1)*(y-1))

Submission status: Accepted

Solution code:
r,c=map(int,input().split())
res=(r-1)*(c-1)
print(res)

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
import itertools
sys.setrecursionlimit(10**5)
stdin = sys.stdin
bisect_left = bisect.bisect_left
bisect_right = bisect.bisect_right
def LI(): return list(map(int, stdin.readline().split()))
def LF(): return list(map(float, stdin.readline().split()))
def LI_(): return list(map(lambda x: int(x)-1, stdin.readline().split()))
def II(): return int(stdin.readline())
def IF(): return float(stdin.readline())
def LS(): return list(map(list, stdin.readline().split()))
def S(): return list(stdin.readline().rstrip())
def IR(n): return [II() for _ in range(n)]
def LIR(n): return [LI() for _ in range(n)]
def FR(n): return [IF() for _ in range(n)]
def LFR(n): return [LI() for _ in range(n)]
def LIR_(n): return [LI_() for _ in range(n)]
def SR(n): return [S() for _ in range(n)]
def LSR(n): return [LS() for _ in range(n)]
mod = 1000000007
inf = float('INF')

#A
def A():
    a, b = LI()
    print((a-1)*(b-1))
    return

#B
def B():
    return

#C
def C():
    return

#D
def D():
    return

#E
def E():
    return

#F
def F():
    return

#G
def G():
    return

#H
def H():
    return

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
A,B = [int(i) for i in input().split()]
X = (A * B) - (A + B) + 1
print(X)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
A,B=(int(i) for i in input().split())
print(A*B-A-B+1)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
#ABC106 A

a,b = map(int,input().split())
print((a-1)*(b-1))

Submission status: Accepted

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

Submission status: Accepted

Solution code:

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
A, B = map(int, input().split())

S = A * B
S -= A + B - 1

print(S)

Submission status: Accepted

Solution code:
a, b = map(int,input().split())
#ls = list(map(int,input().split()))
#n = int(input())
#s = input()

print((a-1)*(b-1))

Submission status: Accepted

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

Submission status: Accepted

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

print(a*b-(a+b-1))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
[A,B] = list(map(int, input().split()))
print((A - 1) * (B - 1))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

A, B = nl()
print(A*B - A - B + 1)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
A, B = map(int,input().split())

print ( (A-1) * (B-1) )

Submission status: Accepted

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

Submission status: Accepted

Solution code:
ab = input().split()
a = int(ab[0])
b = int(ab[1])
s = (a-1)*(b-1)
print(s)

Submission status: Accepted

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


def solve(A: int, B: int):
    print((A-1)*(B-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()
    A = int(next(tokens))  # type: int
    B = int(next(tokens))  # type: int
    solve(A, B)

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:

a, b = [ int(v) for v in input().split() ]
print((a-1)*(b-1))

Submission status: Accepted

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

# PROCESS
answer = (n-1) * (k-1)

# OUTPUT
print(answer)

Submission status: Accepted

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


abc()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
A, B = map(int, input().split())

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

Submission status: Accepted

Solution code:
A,B = map(int, input().split())

print((A-1) * (B-1))

Submission status: Accepted

Solution code:
A,B = [int(i) for i in input().split()]
print((A-1) * (B-1))

Submission status: Accepted

Solution code:
A,B = map(int,input().split())

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

Submission status: Accepted

Solution code:
A, B = [int(ab) for ab in input().split()]
print((A-1) * (B-1))

Submission status: Accepted

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

S = (a-1) * (b-1)

print(S)

Submission status: Accepted

Solution code:
A, B = map(int, input().split())

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

Submission status: Accepted

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

Submission status: Accepted

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

a, b = map(int, input().split())

print((a-1)*(b-1))

Submission status: Accepted

Solution code:
A, B = map(int,input().split())

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

Submission status: Accepted

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


print(int((a-1)*(b-1)))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
import sys
import copy
import collections
from bisect import bisect_left
from bisect import bisect_right
from collections import defaultdict
from heapq import heappop, heappush
	
def main():
	A, B = map(int, input().split(" "))
	
	print((A-1)*(B-1))
	
	
if __name__ == "__main__":
	main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys, os

f = lambda:list(map(int,input().split()))
if 'local' in os.environ :
    sys.stdin = open('./input.txt', 'r')

def solve():
    a, b= f()
    print((a-1)*(b-1))

solve()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

print(b*c-b-c+1)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from sys import stdin

A, B = [int(x) for x in stdin.readline().rstrip().split()]

print((A - 1) * (B - 1))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
"""
A - Garden
https://atcoder.jp/contests/abc106/tasks/abc106_a

"""
import sys


def solve(A, B):
    return (A*B) - A - B + 1


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


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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys


def input():
    return sys.stdin.readline()[:-1]

# N = int(input())
# A = [int(x) for x in input().split()]
# a, b, c = map(int, input().split())
# name1 = str(input())
# alph = {"A": 1, "B": 2, "C": 3, "D": 4, "E": 5}


a,b=map(int,input().split())
print(a*b-a-b+1)

Submission status: Accepted

Solution code:
A, B = [int(i) for i in input().split()]
print((A-1) * (B-1))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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


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():
    a, b = intin()
    print(a * b - a - b + 1)



if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
x,y = map(int,input().split())

print(x*y - x - y +1)

Submission status: Accepted

Solution code:
A,B=[int(a) for a in input().split(" ")]
print((A-1)*(B-1))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
A, B = map(int, input().split())

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

print((a * b) - ( a + b - 1))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

m=a*b-a-b+1

print(int(m))

Submission status: Accepted

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

Submission status: Accepted

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

print(int((a-1)*(b-1)))

Submission status: Accepted

Solution code:
nums = [(int(i) - 1) for i in input().split()] 

print(nums[0] * nums[1])

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
import sys
from math import *
from itertools import *
from collections import *
from functools import *
try:
    from math import gcd
except Exception:
    from fractions import gcd


def solve(A: int, B: int):
    return A * B - A - B + 1


def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    A = int(next(tokens))  # type: int
    B = int(next(tokens))  # type: int
    result = solve(A, B)
    print(result)

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
# coding: utf-8
# Your code here!
A,B = map(int, input().split(' '))

print((A-1)*(B-1))

Submission status: Accepted

Solution code:
import sys
input = sys.stdin.readline

a, b = map(int, input().split())

print((a-1)* (b-1))

Submission status: Accepted

Solution code:

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

if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
[A,B] = list(map(int,input().split()))
print((A-1)*(B-1))

Submission status: Accepted

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


def solve(A: int, B: int):
    ret = A * B - (A + B - 1)
    print(ret)
    return


def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    A = int(next(tokens))  # type: int
    B = int(next(tokens))  # type: int
    solve(A, B)

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
ablist=input().split()
a=int(ablist[0])
b=int(ablist[1])
ans=(a-1)*(b-1)
print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import functools

import os

INF = float('inf')


def inp():
    return int(input())


def inpf():
    return float(input())


def inps():
    return input()


def inl():
    return list(map(int, input().split()))


def inlf():
    return list(map(float, input().split()))


def inls():
    return input().split()


def debug(fn):
    if not os.getenv('LOCAL'):
        return fn

    @functools.wraps(fn)
    def wrapper(*args, **kwargs):
        print('DEBUG: {}({}) -> '.format(
            fn.__name__,
            ', '.join(
                list(map(str, args)) +
                ['{}={}'.format(k, str(v)) for k, v in kwargs.items()]
            )
        ), end='')
        ret = fn(*args, **kwargs)
        print(ret)
        return ret

    return wrapper

a, b = inl()
print((a-1)*(b-1))

Submission status: Accepted

Solution code:
# ABC106A - Garden
a, b = list(map(int, input().rstrip().split()))
print((a - 1) * (b - 1))

Submission status: Accepted

Solution code:
A, B = (int(i) for i in input().split())

print((A-1)*(B-1))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

print ((A -1) * (B-1))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

A, B = map(int, input().split())

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#106 A

A,B= map(int,input().split())

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

Submission status: Accepted

Solution code:
A,B = map(int,input().split())

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
A, B = map(int, input().split())

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def main():
	A, B = map(int, input().split())

	print((A-1)*(B-1))


if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import numpy as np

class Calculator:
    def __init__(self, arr):
        self.arr = arr

    def get_result(self):
        return (self.arr[0] - 1) * (self.arr[1] - 1)

def main():
    A, B, = map(int, input().split())
    arr = np.array([A, B], dtype=int)
    calc = Calculator(arr)
    print(calc.get_result())

if __name__ == "__main__":
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
A, B = map(int, input().split())

road = A + B - 1

print(A * B - road)

Submission status: Accepted

Solution code:
#!/usr/bin/python

def main():
    A, B = [int(x) for x in input().split()]
    print((A-1)*(B-1))


if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

A, B = map(int, input().split())

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

Submission status: Accepted

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

Submission status: Accepted

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

ans = (a - 1) * (b - 1)
print(ans)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
import sys
import itertools
import collections
import functools
import math
from queue import Queue
# import numpy as np
INF = float("inf")


def solve(A: int, B: int):
    print((A-1)*(B-1))
    return


def main():

    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    A = int(next(tokens))  # type: int
    B = int(next(tokens))  # type: int
    solve(A, B)


if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from collections import Counter
from functools import reduce
import fractions
import math
import statistics
import sys
import time
sys.setrecursionlimit(10**7)
INF = 10 ** 18
MOD = 10 ** 9 + 7
def LI(): return [int(x) for x in sys.stdin.readline().split()]  # LIST INT
def LF(): return [float(x) for x in sys.stdin.readline().split()]  # LIST FLOAT
def LS(): return sys.stdin.readline().split()  # LIST STRING
def MI(): return map(int, sys.stdin.readline().split())  # MAP INT
def II(): return int(sys.stdin.readline())  # INPUT INT
def IS(): return input()  # INPUT STRING
def P(x): return print(x)
def C(x): return Counter(x)
def GCD_LIST(numbers):  # greatest common divisor
    return reduce(fractions.gcd, numbers)
def LCM_LIST(numbers):  # least common multiple
    return reduce(LCM, numbers)
def LCM(m, n):
    return (m * n // fractions.gcd(m, n))


a, b = MI()
P((a-1) * (b-1))

Submission status: Accepted

Solution code:
def main():
    A, B = map(int, input().split(' '))
    print((A-1) * (B-1))

main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# 2019/04/02
# AtCoder Beginner Contest 106 - A

a, b = map(int, input().split())

print((a-1)*(b-1))

Submission status: Accepted

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

Submission status: Accepted

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

print((a - 1) * (b - 1))

Submission status: Accepted

Solution code:
A,B = map(int,input().split())

ans = A*B-(A+B-1)

print(ans)

Submission status: Accepted

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

a, b = map(int,input().split())

print(a*b - a - b + 1)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
A,B = map(int,input().split())

S = A * B
print(S - A - B + 1)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a, b = [int(item) for item in input().split()]

print((a-1) * (b-1))

Submission status: Accepted

Solution code:
a_yard, b_yard = map(int, input().split())

area = (a_yard - 1) * (b_yard - 1)

print(area)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a, b = map(int, raw_input().split())
x = a - 1
y = b - 1
print x * y

Submission status: Accepted

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

Submission status: Accepted

Solution code:
i = list(map(int, input().split()))
A = i[0]
B = i[1]

a = A - 1
b = B - 1

print(a * b)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
ri = lambda: int(input())
rl = lambda: list(map(int,input().split()))
rr = lambda N: [ri() for _ in range(N)]
YN = lambda b: print('YES') if b else print('NO')
yn = lambda b: print('Yes') if b else print('No')
OE = lambda x: print('Odd') if x%2 else print('Even')
INF = 10**18

A,B=rl()
print((A-1)*(B-1))

Submission status: Accepted

Solution code:
num = input().split(' ')
a = int(num[0]) - 1
b = int(num[1]) - 1
print(a*b)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a, b = (int(i) for i in input().split())  

print(a*b-(a+b-1))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
A,B= (int(_) for _ in input().split()) 
print((A-1)*(B-1))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
h, w = map(int, input().split())
print(h * w - h - w + 1)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a,b=[int(i) for i in input().split()]
c=a-1
d=b-1
print(c*d)

Submission status: Accepted

Solution code:
def garden(A: int, B: int) -> int:
    return (A - 1) * (B - 1)


if __name__ == "__main__":
    A, B = map(int, input().split())
    ans = garden(A, B)
    print(ans)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# /user/bin/python
# -*- coding: utf-8 -*-
import sys 


a,b = map(int, sys.stdin.readline().rstrip().split())
print((a-1)*(b-1))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

print((n-1)*(k-1))

Submission status: Accepted

Solution code:
def solve(string):
    a, b = map(int, string.split())
    return str((a - 1) * (b - 1))


if __name__ == '__main__':
    print(solve(input()))

Submission status: Accepted

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

ans = (A - 1) * (B - 1)

print(ans)
print()

Submission status: Accepted

Solution code:
# https://atcoder.jp/contests/abc106/tasks/abc106_a
a, b = [int(x) for x in input().split()]
print(a * b - (a + b - 1))

Submission status: Accepted

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

Submission status: Accepted

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


if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
A,B=(int(i) for i in input().split())
print((A-1)*(B-1))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
nums=input().split(" ")
print((int(nums[0])-1)*(int(nums[1])-1))

Submission status: Accepted

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

Submission status: Accepted

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

print((a * b) - (a + b - 1))

Submission status: Accepted

Solution code:
from sys import stdin
a, b = [int(x) for x in stdin.readline().rstrip().split()]
print(a*b-(b+(a-1)))

Submission status: Accepted

Solution code:
def main():
    A, B = map(int, input().split())
    S_all = A * B
    S_road = A + B - 1
    print(S_all - S_road)


if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
a,b = (int(x) for x in input().split())

a=a-1
b=b-1

print(a*b)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def main() -> None:
    A, B = map(int, input().split())
    print((A - 1) * (B - 1))


if __name__ == '__main__':
    main()

Submission status: Accepted

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


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 [int(x) for x in sys.stdin.readline().split()]
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 main():
    A, B = LI()
    print(A*B - A - B + 1)

main()

Submission status: Accepted

Solution code:
A,B=map(int, input().split())

result=(A-1)*(B-1)

print(result)

Submission status: Accepted

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

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