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 = input().split()
a = int(a)
b = int(b)
ans = (a-1)*(b-1)
print(ans)

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 = [int(x) for x in input().split()]
 
print(a * b - a - b + 1)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
def square():
    x,y=[int(i) for i in input().split()]
    print( x*y-x-y+1)

square()

Submission status: Accepted

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

print(int(res))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
A,B = map(int, raw_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(i) for i 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:
l = input().split()
a = int(l[0]) -1
b = int(l[1]) -1

print(a * b)

Submission status: Accepted

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

def main():
    a, b = [int(x) for x in sys.stdin.readline().rstrip().split()]
    print((a-1)*(b-1))
    

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
input_lines = input().split()
a = int(input_lines[0])
b = int(input_lines[1])

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

Submission status: Accepted

Solution code:
l = input().split()
S = 4*(((int(l[0])-1)/2) *((int(l[1])-1)/2))
print(int(S))

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())
A-=1
B-=1
print(A*B)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys,collections,math;sys.setrecursionlimit(10**7)
def Is(): return [int(x) for x in sys.stdin.readline().split()]
def Ss(): return sys.stdin.readline().split()
def I(): return int(sys.stdin.readline())
def S(): return input()

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

Submission status: Accepted

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

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 = (int(i) for i in input().split())

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

Submission status: Accepted

Solution code:
import sys

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()
    [A, B] = [long(input_raw[0]), long(input_raw[1])]
    print (A-1)*(B-1)
if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
a=input().split();print((int(a[0])-1)*(int(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-1)*(b-1))

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
line = input().split(" ")
a = int(line[0])
b = int(line[1])

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
l = input().split()
A = int(l[0])
B = int(l[1])
print((A * B)- A -B + 1)

Submission status: Accepted

Solution code:
#!/Library/Frameworks/Python.framework/Versions/3.5/bin/python3

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
AB = input()

A = int(AB.split(" ")[0])
B = int(AB.split(" ")[1])
ans = (A-1)*(B-1)
print(ans)

Submission status: Accepted

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

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:
inputs = raw_input().replace("\n", "")
input1, input2 = map(int, inputs.split(" "))
print (input1 - 1) * (input2 - 1)

Submission status: Accepted

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

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

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

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

Submission status: Accepted

Solution code:
l = map(int, raw_input().split())
#print(l)

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#encoding utf-8

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

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

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())
ans = (a-1)*(b-1)
print(ans)

Submission status: Accepted

Solution code:
a, b = map(int, input().split())
if a == 2 or b == 2:
    print(1)
else:
    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*b - a - b + 1)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
l = input().split()
A = int(l[0])
B = int(l[1])

total = A * B
michi = A + B - 1
hatake = total - michi


print(hatake)

Submission status: Accepted

Solution code:
#!/usr/bin/env python

a, b = (int(v) for v in input().strip().split())

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

Submission status: Accepted

Solution code:
A = raw_input()
B = A.split()

numA = int(B[0])
numB = int(B[1])

men = numA*numB-numA-numB+1

print men

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a, b = [int(_) for _ 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]=[int(i) for i in input().split()]
print((a-1)*(b-1))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s = input()
a, b = [int(x) for x in s.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:
inp = input()
l = list(map(int, inp.split()))
a = l[0]
b = l[1]

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

print(a[0] * a[1] - (1 * a[0]) - (1 * a[1]) + 1)

Submission status: Accepted

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

    return a * b - a - b + 1


print(abc106_a())

Submission status: Accepted

Solution code:
def main():
    a, b = [int(x) for x in input().rstrip().split()]

    print((a-1) * (b-1))
        
if __name__ == '__main__':
    main()

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
#coding: utf-8

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

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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


if __name__ == '__main__':
    main()

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-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:
# -*- coding: utf-8 -*-
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:
B = input().split()
A = int(B[0])-1
B = int(B[1])-1
print(A*B)

Submission status: Accepted

Solution code:
_ = str(input()).split(" ")
A, B = int(_[0]), int(_[1])

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

Submission status: Accepted

Solution code:
def menseki(a, b):
    return a * b - (1 * b + 1 * a - 1)

if __name__ == '__main__':
    la, lb = map(int, input().split())
    print(menseki(la, lb))

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
def SolveABC106A(A,B):
    print (int(A)-1) * (int(B)-1)

A, B = map(int, raw_input().split())
SolveABC106A(A,B)

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
import logging
import time


class Solver:
    def __init__(self):
        self.a = 0
        self.b = 0

    # 入力
    def input_value(self):
        # self.n = int(input())
        # self.A, self.B = map(int, input().split())
        # self.A = list(map(int, input().split()))
        # self.a, self.b, self.c = map(int, [input() for i in range(4)])
        # self.t = [None] * self.n
        self.a, self.b = map(int, input().split())

    @staticmethod
    def run(a, b):
        return a * b - a - b + 1

    @staticmethod
    def test():
        start_time = time.time()

        assert Solver.run(2) == 2, 'Error.'

        elapsed_time = time.time() - start_time
        logging.debug('elapsed_time: {0}'.format(elapsed_time) + '[sec]')


if __name__ == '__main__':
    logging.basicConfig(level=logging.DEBUG)

    solver = Solver()
    # Solver.test()

    solver.input_value()
    ans = solver.run(solver.a, solver.b)
    print(str(ans))

Submission status: Accepted

Solution code:
List = list(map(int, input().split()))
a = List[0]
b = List[1]
# a = int(input())
# b = int(input())

s = a*b - (a+b) +1

print(s)

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:
# your code goes here
buf = input().split()
A = int(buf[0])
B = int(buf[1])
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=  list(map(int,input().split(" ")))
print((A-1)*(B-1))

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 = [int(item) for item in input().split(" ")]
print((a-1)*(b-1))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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 = list(map(int,input().split()))

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

Submission status: Accepted

Solution code:
A, B = map(int, input().split())
ans = A * B
ans = ans - (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:
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())

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

print(area)

Submission status: Accepted

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

Submission status: Accepted

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

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

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

print(tmp)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from sys import stdin, stdout

input = lambda: stdin.readline()
write = stdout.write

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

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

main()

Submission status: Accepted

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

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:
from sys import exit, setrecursionlimit, stderr
from functools import reduce
from itertools import *
from collections import defaultdict
from bisect import bisect

def read():
  return int(input())

def reads():
  return [int(x) for x in input().split()]

A, B = reads()

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

Submission status: Accepted

Solution code:
#a = int(input())
#b = int(input())
a, b = [int(i) for i in 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 = list(map(int, input().split()))

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

print(S)

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
# Garden

i = input().split(' ')
a = int(i[0])
b = int(i[1])

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

Submission status: Accepted

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

Submission status: Accepted

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


def main(a, b):
    retval = a * b - a * 1 - b * 1 +  1 * 1
    print(retval)
    
if __name__ == '__main__':
    try:
        a, b = list(map(int,input().strip().split(" ")))
        main(a, b)
    except EOFError:
        pass

Submission status: Accepted

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

Submission status: Accepted

Solution code:
l=list(map(int,input().split()))
a=l[0]
b=l[1]
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(x) for x in input().split()]


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

Submission status: Accepted

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

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


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
# -*- 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:
A, B = (int(s) for s in input().split(" "))

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

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 = 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 + 1 * B - 1)
print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

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


if __name__ == '__main__':
    main()

Submission status: Accepted

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


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

    
print(ans)

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

C = A*B - A - B +1

print(C)

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

print(listA[0]*listA[1]-(listA[0]+listA[1]-1))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
import math,string,itertools,fractions,heapq,collections,re,array,bisect

def s():
    return input()
def n():
    return int(input())
def d():
    return float(input())

def ls():
    return input().split()
def ln():
    return map(int, input().split())
def ld():
    return map(float, input().split())

def fs():
    return [input() for i in range(input())]
def fn():
    return [int(input()) for i in range(input())]
def fd():
    return [float(input()) for i in range(input())]

A,B = ln()


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]=[int(i) for i in input().split()]

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

Submission status: Accepted

Solution code:
line = input().split()
A = int(line[0])
B = int(line[1])

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 i1():
 return int(input())
def i2():
 return [int(i) for i in input().split()]

[a,b]=i2()
print(a*b-a-b+1)

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
def run(a, b):
    return (a-1)*(b-1)


def read_line():
    a, b = input().split()
    a = int(a)
    b = int(b)
    return (a, b)


def main():
    a, b = read_line()
    print(run(a, b))


if __name__ == '__main__':
    main()

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
a, b = tuple(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 = [int(v) for v in input().split()]

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

Submission status: Accepted

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

total = a * b - (a + b - 1)

print(total)

Submission status: Accepted

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

def main():
    a, b = map(int, input().split())
    #a = int(input())
    #b = int(input())

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

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(" "))
A -= 1
B -= 1
print(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:
import sys
stdin = sys.stdin
ni = lambda: int(ns())
na = lambda: list(map(int, stdin.readline().split()))
ns = lambda: stdin.readline().rstrip()

A, B=na()

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-1)*(B-1))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
X,Y=map(int,input().split())

ans=X*Y-(X+Y-1)

print(ans)

Submission status: Accepted

Solution code:
# # N = int(input())
A, B = map(int, input().split())
# A = list(map(int, input().split()))
# d = [list(map(int, input().split())) for _ in range(N)]
# s = input()

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

Submission status: Accepted

Solution code:
data = input()
xy = data.split()

rd = int(xy[0])+int(xy[1])-1

ans = int(xy[0])*int(xy[1])-rd

print(ans)

Submission status: Accepted

Solution code:
from sys import stdin


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


if __name__ == '__main__':
    main()

Submission status: Accepted

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

# なんこか入力
a,b = map(int, input().split())

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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


def main():
    a, b = map(int, input().split())

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


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
import bisect
import heapq
import math
import random
import sys
from collections import Counter, defaultdict, deque
from decimal import ROUND_CEILING, ROUND_HALF_UP, Decimal
from functools import lru_cache, reduce
from itertools import combinations, combinations_with_replacement, product, permutations
from operator import add, mul, sub

sys.setrecursionlimit(10000)


def read_int():
    return int(input())


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


def read_float():
    return float(input())


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


def read_str():
    return input().strip()


def read_str_n():
    return list(map(str, input().split()))


def error_print(*args):
    print(*args, file=sys.stderr)


def mt(f):
    import time

    def wrap(*args, **kwargs):
        s = time.time()
        ret = f(*args, **kwargs)
        e = time.time()

        error_print(e - s, 'sec')
        return ret

    return wrap


@mt
def slv(A, B):
    return A*B - (A+B) + 1


def main():
    A, B = read_int_n()
    print(slv(A, B))


if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
num = [int(num) for num in input().split()]
s = num[0]
t = num[1]
print((s-1)*(t-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:
A, B = map(int, input().split())
result = (B-1) * (A-1)
print(result)

Submission status: Accepted

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

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:
A,B = (int(i) for i in input().split())
print((A-1)*(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
A, B = list(map(int, input().split()))

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

Submission status: Accepted

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

if __name__ == '__main__':
    print(main())

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().strip().split())

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

Submission status: Accepted

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

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

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())
c = (a-1)*(b-1)
print(c)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
def inpl(): return map(int, input().split())
A, B = inpl()
print((A-1)*(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())
c=(a*b)-(b+a-1)
print(c)

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

print((B-1)*(C-1))

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# coding=utf-8

if __name__ == '__main__':
    A, B = map(int, input().split())
    print((A - 1) * (B - 1))

Submission status: Accepted

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

def LI(): return list(map(int, input().split()))
def LI_(): return list(map(lambda x: int(x) - 1, input().split()))
def LF(): return list(map(float, input().split()))
def LS(): return input().split()
def I(): return int(input())
def F(): return float(input())
def S(): return input()

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

Submission status: Accepted

Solution code:
x,y = [int(x) for x in input().split()]
print((x-1)*(y-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-1)*(b-1)
print(res)

Submission status: Accepted

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

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


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

#if :
#    print("Yes")
#else:
#    print("No")

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,raw_input().split())
print a*b - a-b+1

Submission status: Accepted

Solution code:
import numpy as np
import math

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

Submission status: Accepted

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