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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys, re, os
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians, acos, atan, asin, log, log10
from itertools import permutations, combinations, product, accumulate
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from fractions import gcd
def debug(*args):
    if debugmode:
        print(*args)
def input(): return sys.stdin.readline().strip()
def STR(): return input()
def INT(): return int(input())
def FLOAT(): return float(input())
def MAP(): return map(int, input().split())
def S_MAP(): return map(str, input().split())
def LIST(): return list(map(int, input().split()))
def S_LIST(): return list(map(str, input().split()))
def lcm(a, b): return a * b // gcd(a, b)
sys.setrecursionlimit(10 ** 9)
inf = sys.maxsize
mod = 10 ** 9 + 7
dx = [0, 0, 1, -1, 1, -1, -1, 1]
dy = [1, -1, 0, 0, 1, -1, 1, -1]
debugmode = False

a, b = MAP()
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:
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())

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def Garden(a , b):

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

def main():
    a , b = map(int , input().split())
    print(Garden(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:
p,q= input().split()
a,b =(int(p), int(q))
print(a*b -a -b +1)

Submission status: Accepted

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

import sys
import math
from bisect import bisect_right as br
from bisect import bisect_left as bl
sys.setrecursionlimit(2147483647)
from heapq import heappush, heappop,heappushpop
from collections import defaultdict
from itertools import accumulate
from collections import Counter
from collections import deque
from operator import itemgetter
from itertools import permutations
mod = 10**9 + 7
inf = float('inf')
def I(): return int(sys.stdin.readline())
def LI(): return list(map(int,sys.stdin.readline().split()))

a,b = LI()
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:
from collections import deque
from collections import Counter
from itertools import product, permutations,combinations
from operator import itemgetter
from heapq import heappop, heappush
from bisect import bisect_left, bisect_right, bisect
#pypyではscipy, numpyは使えない
#from scipy.sparse.csgraph import shortest_path, floyd_warshall, dijkstra, bellman_ford, johnson, minimum_spanning_tree
#from scipy.sparse import csr_matrix, coo_matrix, lil_matrix
#import numpy as np
from fractions import gcd
from math import ceil,floor, sqrt, cos, sin, pi, factorial
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
sys.setrecursionlimit(10**8)
INF = float('inf')
from datetime import datetime as dt

def main():
  a, b = map(int, readline().split())
  print((a-1)*(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:
# ABC 106: A – Garden
a, b = [int(s) for s in input().split()]
print((a - 1) * (b - 1))

Submission status: Accepted

Solution code:
import sys

def resolve():
    H, W = map(int, input().split(" "))
    print((H-1)*(W-1))

if '__main__' == __name__:
    resolve()

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
import itertools
import fractions
def main():
  a,b = map(int,input().split())
  print((a*b) - (1*b + (a-1)*1))
if __name__ == '__main__':
  main()

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.6 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 = 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:
import sys

a, b = map(int, sys.stdin.readline().split())

def main():
    ans = a * b - (a + b - 1)
    print(ans)

if __name__ ==  '__main__':
    main()

Submission status: Accepted

Solution code:
import sys
import copy
import math
import bisect
import pprint
import bisect
from functools import reduce
from copy import deepcopy
from collections import deque

def lcm(x, y):
    return (x * y) // math.gcd(x, y)

if __name__ == '__main__':
    a = [int(i) for i in input().split()]

    print((a[0]-1)*(a[1]-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:
import sys
input = lambda: sys.stdin.readline().rstrip() 

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

if __name__ == '__main__':
    resolve()

Submission status: Accepted

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

Submission status: Accepted

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

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

print(answer)

Submission status: Accepted

Solution code:
# coding: utf-8
A, B = map(int, input().split())
# print(A, B)
ans = (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:
import sys
read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines

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

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


if __name__ == "__main__":
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#!python3

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


def main():
    ans = (A - 1) * (B - 1)
    print(ans)


if __name__ == "__main__":
    main()

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 - b - a + 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)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
a, b = [int(elem) for elem 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:
def main():
    a, b = map(int, input().split())
    ans = a*b - a - b + 1
    print(ans)


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

Submission status: Accepted

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

Submission status: Accepted

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

print(max(0, A*B - A - 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 = list(map(int, input().split()))

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

Submission status: Accepted

Solution code:
def main():
    a,b = map(int,input().split())
    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:
#abc106 a
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-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 = input()
y = x.split(" ")
A = int(y[0])
B = int(y[1])
total = A * B
roads = A + B - 1
rem = total - roads
rem = int(rem)
print(rem)

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
import sys
sys.setrecursionlimit(10**9)
INF=10**18
MOD=10**9+7
def input(): return sys.stdin.readline().rstrip()

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

if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
import os


def main():
    if os.getenv("LOCAL"):
        sys.stdin = open("input.txt", "r")

    A, B = list(map(int, sys.stdin.readline().split()))
    print(A*B-(A+B-1))


if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# Author: cr4zjh0bp
# Created: Mon Mar  9 08:21:56 UTC 2020
import sys
 
stdin = sys.stdin
inf = 1 << 60
mod = 1000000007
 
ni = lambda: int(ns())
nin = lambda y: [ni() for _ in range(y)]
na = lambda: list(map(int, stdin.readline().split()))
nan = lambda y: [na() for _ in range(y)]
nf = lambda: float(ns())
nfn = lambda y: [nf() for _ in range(y)]
nfa = lambda: list(map(float, stdin.readline().split()))
nfan = lambda y: [nfa() for _ in range(y)]
ns = lambda: stdin.readline().rstrip()
nsn = lambda y: [ns() for _ in range(y)]
ncl = lambda y: [list(ns()) for _ in range(y)]
nas = lambda: stdin.readline().split()

A, B = na()

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

Submission status: Accepted

Solution code:
# import bisect
# from collections import Counter, defaultdict, deque
# import copy
# from heapq import heappush, heappop, heapify
# from fractions import gcd
# import itertools
# from operator import attrgetter, itemgetter
# import math

import sys

# import numpy as np

ipti = sys.stdin.readline
MOD = 10 ** 9 + 7
INF = float('INF')
sys.setrecursionlimit(10 ** 5)

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import itertools as it
import collections as col
a,b=map(int,input().split())
print((a*b)-(a+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-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:
tmp=input()
a=int(tmp.split()[0])
b=int(tmp.split()[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=map(int,input().split())
print(a*b-b-a+1)

Submission status: Accepted

Solution code:
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*b-a-b+1)

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

Submission status: Accepted

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

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

Submission status: Accepted

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

x = b[0]
y = b[1]

tA = x * y
rA = x + y - 1

ans = tA - rA
print(ans)

Submission status: Accepted

Solution code:
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())

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
#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 - 1) * (B - 1))

Submission status: Accepted

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

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

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, raw_input().split())
area = (A-1)*(B-1)
print area

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

Submission status: Accepted

Solution code:
def main():
    height, width = map(int, input().split(" "))
    print((height - 1) * (width - 1))


if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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


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


if __name__ == "__main__":
    main()

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

Submission status: Accepted

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

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
a,b = map(int,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:
row, col = map(int, input().split())
print((row-1)*(col-1))

Submission status: Accepted

Solution code:
"""
author : halo2halo
date : 23, Jan, 2020
"""

import sys

# import numpy as np

read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines

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

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

ans = A * B - A - B + 1

print(ans)

Submission status: Accepted

Solution code:
S, T = map(int, input().split())
print(~-S*~-T)

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:
def main():
    from sys import stdin, setrecursionlimit
    setrecursionlimit(10**6)
    r = stdin.readline()[:-1]
    #n = int(stdin.readline()[:-1])   
    #r = [stdin.readline() for i in range(n)]
    #t = [int(stdin.readline()) for i in range(n)]

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

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
import sys

INPUT = lambda: sys.stdin.readline().rstrip()
MAP = lambda: map(int, INPUT().split())

sys.setrecursionlimit(10 ** 9)


def main():
    A, B = MAP()
    print((A - 1)*(B - 1))


if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
import math
import queue
import bisect
import heapq
import time
import itertools

mod = int(1e9+7)

def swap(a,b):
    return (b,a)

def my_round(a,dig=0):
    p = 10 ** dig
    return (a * p * 2 + 1) // 2 / p

def gcd(a,b): #最大公約数
    if (a<b):
        a,b = swap(a,b)
    if (b==0):
        return a
    else:
        return gcd(b,a%b)

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

def divisors(a): # 約数列挙
    divisors = []
    for i in range(1,int(a**0.5)+1):
        if a%i==0:
            divisors.append(i)
            if i!=a//i:
                divisors.append(a//i)
    return divisors

def is_prime(a): #素数判定
    if a<2:
        return False
    elif a==2:
        return True
    elif a%2==0:
        return False
    sqrt_num = int(a**0.5)
    for i in range(3,sqrt_num+1,2):
        if a%i==0:
            return False
    return True

def prime_num(a): #素数列挙
    pn = [2]
    for i in range(3,int(a**0.5),2):
        prime = True
        for j in pn:
            if i%j==0:
                prime = False
                break
        if prime:
            pn.append(i)
    return pn

def prime_fact(a): #素因数分解
    sqrt = math.sqrt(a)
    res = []
    i = 2
    if is_prime(a):
        res.append(a)
    else:
        while a!=1:
            while a%i==0:
                res.append(i)
                a //= i
            i += 1
    return res

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

if __name__=='__main__':
    main()

Submission status: Accepted

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

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

main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

print(int(r))

Submission status: Accepted

Solution code:
num = list(map(int, input().split()))
print((num[0]-1)*(num[1]-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(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*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:
import sys

a, b = map(int, sys.stdin.readline().split())

def main():
    return a * b - (a + b - 1)

if __name__ == '__main__':
    ans = main()
    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(lambda x: int(x), input().split())

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

Submission status: Accepted

Solution code:
A,B=map(int, input().split())  #複数数値入力　「A B」みたいなスペース空いた入力のとき

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:

A, B = [int(_) for _ in 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:
import bisect
import cmath
import heapq
import itertools
import math
import operator
import os
import re
import string
import sys
from collections import Counter, deque, defaultdict
from copy import deepcopy
from decimal import Decimal
from fractions import gcd
from functools import lru_cache, reduce
from operator import itemgetter, mul, add, xor

import numpy as np

if os.getenv("LOCAL"):
    sys.stdin = open("_in.txt", "r")

sys.setrecursionlimit(10 ** 9)
INF = float("inf")
IINF = 10 ** 18
MOD = 10 ** 9 + 7
# MOD = 998244353

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# coding: utf-8

(a,b) = [int(i) - 1 for i in input().rstrip().split(" ")]
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:
import sys
input = sys.stdin.readline
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())
sum = (a-1)*(b-1)
print(sum)

Submission status: Accepted

Solution code:
INT = lambda: int(input())
INTM = lambda: map(int,input().split())
STRM = lambda: map(str,input().split())
STR = lambda: str(input())
LIST = lambda: list(map(int,input().split()))
LISTS = lambda: list(map(str,input().split()))
def do():
    a,b=INTM()
    print(a*b-(a+b-1))
if __name__ == '__main__':
    do()

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

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:
import sys
input = sys.stdin.readline
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 + 1 - a - b)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys 

a,b = map(int, sys.stdin.readline().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 = 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 = [int(x) for x 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-1) * (B-1))

Submission status: Accepted

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

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

print(S)

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

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# ABC106a
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10**6)

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:
import sys
import math
input = sys.stdin.readline


def main():
    sc = Scan()
    a, b = sc.intarr()

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

    print(ans)


def format_str(num):
    if num < 10:
        return "00" + str(num)
    elif num < 100:
        return "0" + str(num)
    else:
        return str(num)


class Scan():

    def intarr(self):
        line = input()
        array = line.split(' ')
        num_array = [int(n) for n in array]
        return num_array

    def intarr_ver(self, n):
        return [int(input()) for _ in range(n)]

    def strarr(self):
        line = input()
        array = line.split(' ')
        array[-1] = array[-1].strip('\n')
        return array


def display(array):
    for a in range(len(array)):
        if len(array) - a != 1:
            print(array[a], end=' ')
        else:
            print(array[a])


def gcd(a, b):  # 最大公約数
    while b:
        a, b = b, a % b
    return a


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


main()

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

Submission status: Accepted

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