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: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
A,B= (int(x) for x in input().split())
menseki=A*B
tate=1*A
yoko=1*B
goukei=1
nyan=menseki-(tate+yoko)+1

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import math
import collections
import sys

#input = sys.stdin.readline
def I(): return int(input())
def MI(): return map(int, input().split())
def LI(): return list(map(int, input().split()))
def LI2(): return [int(input()) for i in range(n)]
def MXI(): return [[LI()]for i in range(n)]

a,b=MI()
ans=a*b-a-b
print(ans)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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: Wrong Answer

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

print(a*b-a-b)

Submission status: Wrong Answer

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

if '__main__' == __name__:
    resolve()

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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)
if rem == 1:
    print("In this case, the area is", rem, "square yard.")
else:
    print("In this case, the area is", rem, "square yards.")

Submission status: Wrong Answer

Solution code:
x = input()
y = x.split(" ")
A = int(y[0])
B = int(y[1])
rem = (A-1) * (B-1)
rem = int(rem)
print(rem)
print("In this case, the area is", rem, "square yards.")

Submission status: Wrong Answer

Solution code:
x = input()
y = x.split(" ")
A = int(y[0])
B = int(y[1])
rem = (A-1) * (B-1)
print(rem)
print("In this case, the area is", rem, "square yards.")

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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)
print("In this case, the area is", rem, "square yards.")

Submission status: Wrong Answer

Solution code:
x = input()
y = x.split(" ")
A = int(y[0])
B = int(y[1])
total = A * B
roads = A*1 + (B-1)*1
rem = total - roads
rem = int(rem)
print(rem)
print("In this case,the area is", rem, "square yards.")

Submission status: Wrong Answer

Solution code:
x = input()
y = x.split(" ")
a = int(y[0])
b = int(y[1])
total = a * b
roads = a*1 + (b-1)*1
rem = total - roads
rem = int(rem)
print(rem)
print("In this case, the area is", rem, "square yards.")

Submission status: Wrong Answer

Solution code:
x = input()
y = x.split(" ")
y = [int(x) for x in y]
a = y[0]
b = y[1]
total = a * b
roads = a*1 + b*1 - 1
rem = total - roads
rem = int(rem)
print(rem)
print("In this case, the area is", rem, "square yards.")

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

s = n * m

print(s-(n+m))

Submission status: Wrong Answer

Solution code:
print((input().replace("1","")+"1")[0])

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

print(a*b-a-b)

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

Solution code:
import math

# inputList=[]
# for i in range(6):
#     inputNum = input()
#     inputList.append(inputNum)
inputa = input().split()
# inputb = input().split()

# inputa = [int(n) for n in inputa]
# inputa.sort()

a = int(inputa[0])
b = int(inputa[1])
# c = int(inputa[2])

# x = int(inputb[0])
# y = int(inputb[1])

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:

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

s = a*b - a - b
print(s)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

Solution code:
a,b = map(int, input().split())
a = 1
b = 1
for i in range(100):
 a = a + i
 for j in range(100):
  b = b + j
  c = (a-1) * (b-1)
  print(c)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
try:print([i for i in input()[:int(input())]if i!="1"][0])
except:print(1)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import numpy as np

def input_numbers():
    temp = list(map(int, input().split()))
    return temp

def GCD(a, b):
    if(a < b):
        temp = a
        a = b
        b = temp
    a = a % b
    if(a == 0):
        return b
    else:
        return GCD(a, b)

x = input_numbers()

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
a = input()

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
# coding: utf-8

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

if __name__ == "__main__":

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

print(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(x) for x in input().split())
menseki=A*B
nyan=menseki-A-B+1
print(nyan)

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

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


if __name__ == "__main__":
    main()

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 - 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:
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:
import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,random,time,copy,functools
from collections import deque

sys.setrecursionlimit(10**7)
inf = 10**20
mod = 10**9 + 7

DR = [1, -1, 0, 0]
DC = [0, 0, 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 main():
    A, B = LI()
    ans = A * B
    ans -= A 
    ans -= B
    ans += 1
    print(ans)

main()

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 mapt(fn, *args):
    return list(map(fn, *args))


def Input():
    return mapt(int, input().split(" "))


def main():
    a, b = Input()
    print((a-1) * (b-1))


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

Submission status: Accepted

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

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

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

Submission status: Accepted

Solution code:
n,i=map(int,input().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(str(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:
len_a, len_b = map(int, input().split())

total_area = len_a * len_b
road = len_a + len_b - 1
print(total_area - road)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
H, W = map(int, input().split())

print((H-1)*(W-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())

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

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

Submission status: Accepted

Solution code:
import sys
import math

#https://atcoder.jp/contests/agc008/submissions/15248942
sys.setrecursionlimit(10 ** 8)
ini = lambda: int(sys.stdin.readline())
inm = lambda: map(int, sys.stdin.readline().split())
inl = lambda: list(inm())
ins = lambda: sys.stdin.readline().rstrip()
debug = lambda *a, **kw: print("\033[33m", *a, "\033[0m", **dict(file=sys.stderr, **kw))

A,B = inm()

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

Submission status: Accepted

Solution code:
# coding = SJIS

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())
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:
n,m = map(int, input().split())
print((n-1)*(m-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())
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:
import sys
input = sys.stdin.readline
ins = lambda: input().rstrip()
ini = lambda: int(input().rstrip())
inm = lambda: map(int, input().split())
inl = lambda: list(map(int, input().split()))

a, b = inm()
print(a*b - 1*a - 1*b + 1)

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
import sys

read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines
sys.setrecursionlimit(10 ** 9)
INF = 1 << 60
MOD = 1000000007


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

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

    return


if __name__ == '__main__':
    main()

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:
#k = int(input())
#s = input()
#a, b = map(int, input().split())
#s, t = map(str, input().split())
#l = list(map(int, input().split()))
#l = [list(map(int,input().split())) for i in range(n)]
#a = [list(input()) for _ in range(n)]
#a = [int(input()) for _ in range(n)]



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

Submission status: Accepted

Solution code:
n,m=(int(i)-1 for i in input().strip().split(" "))
print(n*m)

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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:
tmp = input().split(" ")
print((int(tmp[0]) - 1) * (int(tmp[1]) - 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
def MI(): return map(int,sys.stdin.readline().rstrip().split())

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

Submission status: Accepted

Solution code:
A, B = map(int,input().rstrip().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:
#import sys
#import numpy as np
import math
#from fractions import Fraction
import itertools
from collections import deque
from collections import Counter
import heapq
from fractions  import gcd
#input=sys.stdin.readline
import bisect
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-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
# Your code here!
a, b = [int(i) for i in input().split()]
s = (a - 1) * (b - 1)

print(s)

Submission status: Accepted

Solution code:
# abc106_a.py
# https://atcoder.jp/contests/abc106/tasks/abc106_a

# A - Garden /
# 実行時間制限: 2 sec / メモリ制限: 1000 MB
# 配点: 100点

# 問題文
# 縦 Aヤード、横 B ヤードの畑がある. 
# 農夫ジョンは, 畑の内部に, 畑の上端と下端を結ぶ縦方向の幅 1 ヤードの道, 畑の左端と畑の右端を結ぶ横方向の幅 1ヤードの道を作った. 
# 畑は下図のようになっている. (灰色の部分が道)
# さて, 道を除いた畑の面積は, 何平方ヤードだろうか? 求めなさい.

# 注意
# 道の位置が変わっても, 道を除く畑の面積が変わらないことが証明できます.

# 制約
#     Aは 2 以上 100以下の整数
#     Bは 2 以上 100以下の整数

# 入力
# 入力は以下の形式で標準入力から与えられる.
# A B

# 出力
# 道を除いた畑の面積 (平方ヤード) を出力しなさい.

# 入力例 1
# 2 2

# 出力例 1
# 1

# この場合, 面積は 1平方ヤードになる.

# 入力例 2
# 5 7

# 出力例 2
# 24

# この場合, 面積は 24平方ヤードになる. 


def calculation(lines):
    A, B = list(map(int, lines[0].split()))
    return [(A-1)*(B-1)]


# 引数を取得
def get_input_lines(lines_count):
    lines = list()
    for _ in range(lines_count):
        lines.append(input())
    return lines


# テストデータ
def get_testdata(pattern):
    if pattern == 1:
        lines_input = ['2 2']
        lines_export = [1]
    if pattern == 2:
        lines_input = ['5 7']
        lines_export = [24]
    return lines_input, lines_export


# 動作モード判別
def get_mode():
    import sys
    args = sys.argv
    if len(args) == 1:
        mode = 0
    else:
        mode = int(args[1])
    return mode


# 主処理
def main():
    mode = get_mode()
    if mode == 0:
        lines_input = get_input_lines(1)
    else:
        lines_input, lines_export = get_testdata(mode)

    lines_result = calculation(lines_input)

    for line_result in lines_result:
        print(line_result)

    # if mode > 0:
    #     print(f'lines_input=[{lines_input}]')
    #     print(f'lines_export=[{lines_export}]')
    #     print(f'lines_result=[{lines_result}]')
    #     if lines_result == lines_export:
    #         print('OK')
    #     else:
    #         print('NG')


# 起動処理
if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:

if __name__ == '__main__':
	
	n,m = map(int,input().split())

	print((n-1)*(m-1))

Submission status: Accepted

Solution code:
# -*- 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:
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("{}".format(a*b - (a+b-1)))

Submission status: Accepted

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

S = a * b

L = a + b - 1

print(S - L)

Submission status: Accepted

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

Submission status: Accepted

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

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:
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines

a, b = map(int, readline().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:
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())
print(A*B-A-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:
x,y=map(int,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:
def main():
 a,b = map(int,input().split())
 print(a * b - a - b + 1)
main()

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
import sys
A,B = map(int,input().split())
if not ( 2 <= A <= 100 and 2 <= B <= 100 ):
    sys.exit()

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

Submission status: Accepted

Solution code:
import sys

input = sys.stdin.readline


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

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

    print(ans)


if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
import sys
rm = lambda: map(int, sys.stdin.buffer.readline().split())

a, b = rm()
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+1-a-b)

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

print((m-1) * (n-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:
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*~-b)

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

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

print(f)

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