Problem:


Score : 100 points

Problem Statement

It has been decided that a programming contest sponsored by company A will be held, so we will post the notice on a bulletin board.

The bulletin board is in the form of a grid with N rows and N columns, and the notice will occupy a rectangular region with H rows and W columns.

How many ways are there to choose where to put the notice so that it completely covers exactly HW squares?

Constraints

1 \leq H, W \leq N \leq 100

All values in input are integers.

Input

Input is given from Standard Input in the following format:

N
H
W

Output

Print the answer.

Sample Input 1

3
2
3

Sample Output 1

2

There are two ways to put the notice, as follows:

###   ...
###   ###
...   ###

Here, # represents a square covered by the notice, and . represents a square not covered.

Sample Input 2

100
1
1

Sample Output 2

10000

Sample Input 3

5
4
2

Sample Output 3

8



Sample input:
3
2
3


Sample output:
2

Submission status: Accepted

Solution code:
import math

N=int(input())
H=int(input())
W=int(input())

# N,H,W=3,2,3

tate=N-H+1
yoko=N-W+1

# print(tate)
# print(yoko)

print(tate*yoko)

Submission status: Accepted

Solution code:
N = int(input())
H = int(input())
W = int(input())
print(((N - H) + 1) * ((N - W) + 1))

Submission status: Accepted

Solution code:
from math import *
log = lambda *x: print(*x)

def cin(*fn, def_fn=str):
    i, r = 0, []
    if fn:
        def_fn = fn[0]
    for c in input().split(' '):
        r += [(fn[i] if len(fn) > i else def_fn) (c)]
        i += 1
    return r
##################################################

n, = cin(int)
h, = cin(int)
w, = cin(int)

tw, th = 0, 0

while h <= n:
    h += 1
    th += 1

while w <= n:
    tw += 1
    w += 1

log(th * tw)

Submission status: Accepted

Solution code:
n = int(input())
h = int(input())
w = int(input())
print(((n-h)+1)*((n-w)+1))

Submission status: Accepted

Solution code:
n = (int)(input())
h = (int)(input())
w = (int)(input())

print((n-w+1)*(n-h+1))

Submission status: Accepted

Solution code:
N=int(input())
H=int(input())
W=int(input())

n=N-H+1
w=N-W+1

print(n*w)

Submission status: Accepted

Solution code:
n = int(input())
h = int(input())
w = int(input())
print((n - h +1) * (n - w + 1))

Submission status: Accepted

Solution code:
n = int(raw_input())
h = int(raw_input())
w = int(raw_input())
print (n+1-h)*(n+1-w)

Submission status: Accepted

Solution code:
N = int(input())
H = int(input())
W = int(input())

print( ((N-H)+1)*((N-W)+1) )

Submission status: Accepted

Solution code:
N = int(input())

H = int(input())

W = int(input())


ans1 = N  - W + 1
ans2 = N - H + 1

#if ans1 < ans2:
#print(ans1)
#else:
#print(ans2)

ans = ans1 * ans2

print(ans)

Submission status: Accepted

Solution code:
def main():
    N = int(input())
    H = int(input())
    W = int(input())
    count = 0
    for i in range(N):
        for j in range(N):
            if (N - i) >= H and (N - j) >= W:
                count += 1
    print(count)


if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:

n = int(input())
h = int(input())
w = int(input())

ans = (n-h+1)*(n-w+1)


print(ans)

Submission status: Accepted

Solution code:
# coding: utf-8

N = int(input())
H = int(input())
W = int(input())

height = (N + 1) - H
weight = (N + 1) - W

print(height*weight)

Submission status: Accepted

Solution code:
N=int(input())
H=int(input())
W=int(input())
x=(N-W+1)*(N-H+1)
print(x)

Submission status: Accepted

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

n = int(input())
h = int(input())
w = int(input())
x=int(0)

x=(n-h+1)*(n-w+1)

print(x)

Submission status: Accepted

Solution code:
N=int(input())
H=int(input())
W=int(input())
R=(N-H+1)*(N-W+1)
print(R)

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
# 整数の入力
N = int(input())
H = int(input())
W = int(input())

print("{}".format((N-H+1)*(N-W+1)))

Submission status: Accepted

Solution code:
import math

n = int(input())
h = int(input())
w = int(input())

remainder_row = n-h
remainder_col = n-w
total_row = remainder_row + 1
total_col = remainder_col + 1
combi_row = math.factorial(total_row) / math.factorial(remainder_row)
combi_col = math.factorial(total_col) / math.factorial(remainder_col)

print(int(combi_row * combi_col))

Submission status: Accepted

Solution code:
n = int(input())
h = int(input())
w = int(input())
 
ans = (n-h+1) * (n-w+1)
print(ans)

Submission status: Accepted

Solution code:
# https://atcoder.jp/contests/aising2019/tasks/aising2019_a

N = int(input())
H = int(input())
W = int(input())

h_candidate = N - H + 1
w_candidate = N - W + 1

print(h_candidate * w_candidate)

Submission status: Accepted

Solution code:
data = []

for i in range(3):
    data.append(input())
    
N = int(data[0])
H = int(data[1])
W = int(data[2])

print((N-H+1)*(N-W+1))

Submission status: Accepted

Solution code:
import sys, copy, math, collections, itertools

n=int(input())
h=int(input())
w=int(input())

i=n-h+1
j=n-w+1

print(i*j)

Submission status: Accepted

Solution code:
n = int(input())
h = int(input())
w = int(input())
wd = n - w + 1 
hd = n - h + 1
print(wd * hd)

Submission status: Accepted

Solution code:
n=int(input())
h=int(input())
w=int(input())
#print(n,h,w)
print((n-h+1)*(n-w+1))

Submission status: Accepted

Solution code:
N= int(input())
H= int(input())
W= int(input())
print((N-H+1)*(N-W+1))

Submission status: Accepted

Solution code:
def main():
    N = int(input())
    H = int(input())
    W = int(input())

    ans = (N - W + 1) * (N - H + 1)

    print(ans)


if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
from sys import stdin, stdout
from math import sin, tan, cos, pi, atan2, sqrt, acos, atan, factorial
from random import randint

n = int(stdin.readline())
h = int(stdin.readline())
w = int(stdin.readline())

stdout.write(str((n - h + 1) * (n - w + 1)))

Submission status: Accepted

Solution code:
import sys
from collections import deque
import copy
import math
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()
    [N] = [long(input_raw[0])]
    input_raw = read_func().strip().split()
    [H] = [long(input_raw[0])]
    input_raw = read_func().strip().split()
    [W] = [long(input_raw[0])]

    print (N - H + 1) * (N - W + 1)

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
import numpy as np

N = int(input())
H = int(input())
W = int(input())
H_num = N - H + 1
W_num = N - W + 1
num = H_num * W_num
print(num)

Submission status: Accepted

Solution code:
N = int(input())
H = int(input())
W= int(input())
print((N-W+1)*(N-H+1))

Submission status: Accepted

Solution code:
N=int(input())
H=int(input())
W=int(input())
tate=1
yoko=1
if N>W:
    tate=tate+N-W
if N>H:
    yoko=yoko+N-H
print(tate*yoko)

Submission status: Accepted

Solution code:
N = int(input())
H = int(input())
W = int(input())

count = 0
for i in range(N):
    for j in range(N):
        if i + W <= N and j + H <= N:
            count += 1

print(count)

Submission status: Accepted

Solution code:
N = int(input())
H = int(input())
W = int(input())
if H > N or W > N:
	print(0)
else:
	print((N-W+1)*(N-H+1))

Submission status: Accepted

Solution code:
n  = int(input())
h = int(input())
w = int(input())

print((n-h+1) * (n-w+1))

Submission status: Accepted

Solution code:
N=int(input())
H=int(input())
W=int(input())

X=N-H+1
Y=N-W+1


print(X*Y)

Submission status: Accepted

Solution code:
N=input()
H=input()
W=input()

print (N-H+1)*(N-W+1)

Submission status: Accepted

Solution code:
N = int(input())
h = N-int(input())+1
w = N-int(input())+1
print(h*w)

Submission status: Accepted

Solution code:
def question1():
    n = int(input())
    h = int(input())
    w = int(input())
    result =  (n-w+1)*(n-h+1)
    print(result)
    return result

question1()

Submission status: Accepted

Solution code:
N = int(input())

H = int(input())

W = int(input())

a = (N - H + 1) * (N - W + 1)

print(a)

Submission status: Accepted

Solution code:
N = int(input())
H = int(input())
W = int(input())
print((N+1-W) * (N+1-H))

Submission status: Accepted

Solution code:
def main():
  n, h, w = int(input()), int(input()), int(input())
  print((n-h+1)*(n-w+1))


if __name__ == '__main__':
  main()

Submission status: Accepted

Solution code:
N = int(input())
W = int(input())
H = int(input())

print((N - W + 1) * (N - H + 1))

Submission status: Accepted

Solution code:
N=int(input())
H=int(input())
W=int(input())
print( (N-H+1)*(N-W+1) )

Submission status: Accepted

Solution code:
import math as mt
import itertools as it
import functools as ft
import random as rnd

stdin = lambda type_ = "int", sep = " ": list(map(eval(type_), input().split(sep)))
joint = lambda sep = " ", *args: sep.join(str(i) if type(i) != list else sep.join(map(str, i)) for i in args)

n = int(input())
H = int(input())
W = int(input())

print((n - W + 1) * (n - H + 1))

Submission status: Accepted

Solution code:
n = int(input())
h = int(input())
w = int(input())
print(max(n - w + 1, 0) * max(n - h + 1, 0))

Submission status: Accepted

Solution code:
def m():
    N = int(input())
    H = int(input())
    W = int(input())
    return (N-H+1)*(N-W+1)

print(m())

Submission status: Accepted

Solution code:
N = int(input())
H = int(input())
W = int(input())

print((N-(W-1)) * (N-(H-1)))

Submission status: Accepted

Solution code:
N, H, W = int(input()), int(input()), int(input())

print((N - H + 1) * (N - W + 1))

Submission status: Accepted

Solution code:
from sys import stdin
N=int(stdin.readline().rstrip())
H=int(stdin.readline().rstrip())
W=int(stdin.readline().rstrip())
ans=(N-H+1)*(N-W+1)
print(ans)

Submission status: Accepted

Solution code:


n = int(input())
h = int(input())
w = int(input())
ans = 1

if n - h >= 1:
    ans *= (n-h+1)

if n - w >= 1:
    ans *= (n-w+1)

print(ans)

Submission status: Accepted

Solution code:
import sys

import numpy as np


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


def ii(t: type = int):
    return t(input())


def il(t: type = int):
    return list(map(t, input().split()))


def imi(N: int, t: type = int):
    return [ii(t) for _ in range(N)]


def iml(N: int, t: type = int):
    return [il(t) for _ in range(N)]


N = ii()
H = ii()
W = ii()
print((N - H + 1) * (N - W + 1))

Submission status: Accepted

Solution code:
a = [int(input()) for _ in range(3)]
print((a[0]+1-a[1]) * (a[0]+1-a[2]))

Submission status: Accepted

Solution code:
n=int(input())
h=int(input())
w=int(input())

print((n-h+1)*(n-w+1))

Submission status: Accepted

Solution code:
N = int(input())
H = int(input())
W = int(input())

if H <= N: 
  h_ = 1
else:
  h_ = 0
if W <= N: 
  w_ = 1
else:
  w_ = 0

if h_ == 0 or w_ == 0 :
  result = 0
else:
  result  = (h_ + N - H)*(w_ + N - W)
print(result)

Submission status: Accepted

Solution code:
n = int(input())
h = int(input())
w = int(input())
print(max(0, n-h+1) * max(0, n-w+1))

Submission status: Accepted

Solution code:
N = int(input())
H = int(input())
W = int(input())

print((N+1-H)*(N+1-W))

Submission status: Accepted

Solution code:
def piyo():
    a = int(input())
    b = int(input())
    c = int(input())
    ans = (a-b+1)*(a-c+1)
    print(ans)    
    
if __name__ == '__main__':
    piyo()

Submission status: Accepted

Solution code:
n = int(input())
a = int(input())
b = int(input())
print(max(0,(n-a+1)*(n-b+1)))

Submission status: Accepted

Solution code:
N = int(input())
H = int(input())
W = int(input())

a = N - W + 1
b = N - H + 1

a = max(a, 0)
b = max(b, 0)

print (a*b)

Submission status: Accepted

Solution code:
n = int(input())
h = int(input())
w = int(input())
c = 0

for ih in range(h, n + 1):
    for iw in range(w, n + 1):
        c += 1

print(c)

Submission status: Accepted

Solution code:
#!/usr/bin/python

def input_datas():
    n = int(input())
    h = int(input())
    w = int(input())
    return (n, h, w)

def main():
    n, h, w = input_datas()
    print((n-w+1) * (n-h+1))

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
n=int(input())
h=int(input())
w=int(input())

print( (n - h + 1) * (n - w + 1))

Submission status: Accepted

Solution code:
import math
def nCast(number):
    if type(number)==str:
        return int(number)
    for idx in range(0,len(number)):
        if type(number[idx])==str:

            number[idx]=int(number[idx])
        else:
            nCast(number[idx])
    return number
    
def inputArr(w):
    l=list()
    for idx in range(0,w):
        l.append(input().split())
    return l
def inputArr1(w):
    l=list()
    for idx in range(0,w):
        l.append(input())
    return l
 
n=nCast(input())+1
h=nCast(input())
w=nCast(input())

print((n-h)*(n-w))

Submission status: Accepted

Solution code:
# スペース区切りの整数の入力
n = int(input())
h = int(input())
w = int(input())

ans = (n - h + 1) * (n - w + 1)
print(ans)

Submission status: Accepted

Solution code:
n = int(input())
h = int(input())
w = int(input())
print((n - w + 1) * (n - h + 1))

Submission status: Accepted

Solution code:
N = int(input())
H = int(input())
W = int(input())

print((N - H + 1)*(N - W + 1))

Submission status: Accepted

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


def solve():
    N = int(input())
    H = int(input())
    W = int(input())
    res = (N-H+1)*(N-W+1) 
    return str(res)

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

Submission status: Accepted

Solution code:
n1=int(input())
n2=int(input())
n3=int(input())
out=(n1-n2+1)*(n1-n3+1)
print(out)

Submission status: Accepted

Solution code:
N = int(input())
H = int(input())
W = int(input())
P = (N-H+1)*(N-W+1)
print(P)

Submission status: Accepted

Solution code:
n = int(input())
h = int(input())
w = int(input())
ans = (n-h+1)*(n-w+1)
print(ans)

Submission status: Accepted

Solution code:
N = int(input())
H = int(input())
W = int(input())

x = (N+1 -H)*(N+1-W)
print(x)

Submission status: Accepted

Solution code:
N, H, W = [int(input()) for i in range(0, 3)]

print((N - H + 1) * (N - W + 1))

Submission status: Accepted

Solution code:
N = int(input())
H = int(input())
W = int(input())

count = 0
for i in range(N):
    for j in range(N):
        if (N-i >= H) and (N-j >= W):
            count += 1
print(count)

Submission status: Accepted

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

n = int(input())
h = int(input())
w = int(input())

print((n - w + 1) * (n - h + 1))

Submission status: Accepted

Solution code:
n = int(input())
h = int(input())
w = int(input())
height = n - h + 1
width = n - w + 1
print(str(height*width))

Submission status: Accepted

Solution code:
n = int(input())
h = int(input())
w = int(input())

ans = ((n-h)+1) * ((n-w)+1)
print(int(ans))

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
# A
# 
n = int(input())
h = int(input())
w = int(input())
# output
print((n-h+1)*(n-w+1))

Submission status: Accepted

Solution code:
N = int(input())
H = int(input())
W = int(input())

OUTH = N - H + 1
OUTW = N - W + 1

answer = OUTH * OUTW
        
    

print(answer)

Submission status: Accepted

Solution code:
N = int(input())
H = int(input())
W = int(input())

print((N - H +1) * (N - W + 1))

Submission status: Accepted

Solution code:
n = int(input())
h = int(input())
w = int(input())
print((1 + n - w) * (1 + n - h))

Submission status: Accepted

Solution code:
n = int(input())
h = int(input())
w = int(input())

print((n-w+1)*(n-h+1))

Submission status: Accepted

Solution code:
N = int(input())
H = int(input())
W = int(input())
A = (N-H+1)*(N-W+1)
print(A)

Submission status: Accepted

Solution code:
N = int(input())
H = int(input())
W = int(input())
if H > N or W > N:
	print(0)
else:
	print((N - H + 1) * (N - W + 1))

Submission status: Accepted

Solution code:
n = int(input())
h = int(input())
w = int(input())

if(n >= h):
    h1 = n-h+1
else:
    h1 = 0

if(n >= w):
    w1 = n-w+1
else:
    w1 = 0

print(h1 * w1)

Submission status: Accepted

Solution code:
NHW = [int(input()) for _ in range(3)]
print((NHW[0]-NHW[1]+1) * (NHW[0]-NHW[2]+1))

Submission status: Accepted

Solution code:
N = int(input())
W = int(input())
H = int(input())

print((N - W + 1) * (N - H + 1))

Submission status: Accepted

Solution code:
N = int(input())
tate = int(input())
yoko = int(input())
if N - tate == 0:
    tatea = 1
else:
    tatea = N - tate + 1
if N - yoko == 0:
    yokoa = 1
else:
    yokoa = N - yoko + 1
ans = tatea * yokoa
print(ans)

Submission status: Accepted

Solution code:
n = int(input())
h = int(input())
w = int(input())

print(((n-h)+1)*((n-w)+1))

Submission status: Accepted

Solution code:
N = int(input())
H = int(input())
W = int(input())

gyou = N - H + 1
retsu = N - W + 1
result = gyou * retsu

print(result)

Submission status: Accepted

Solution code:
N=int(input())
H=int(input())
W=int(input())

print("%d" % ((N - H + 1) * (N - W + 1)))

Submission status: Accepted

Solution code:
N = int(input())
H = int(input())
W = int(input())


tate = (N-H)+1
yoko = (N-W)+1

print(tate*yoko)

Submission status: Accepted

Solution code:
# coding:utf-8

import sys
# from collections import Counter, defaultdict

INF = float('inf')
MOD = 10 ** 9 + 7

def LI(): return [int(x) for x in sys.stdin.readline().split()]
def LS(): return sys.stdin.readline().split()
def I(): return int(sys.stdin.readline())
def S(): return input()


# mathを使わない切り上げ
def ceil(n, m):
    return -(-n//m)


N = I()
H = I()
W = I()

print((N - H + 1) * (N - W + 1))

Submission status: Accepted

Solution code:
import sys
N,H,W=[int(_) for _ in sys.stdin.readlines()]
print((N - H + 1 )*(N-W+1))

Submission status: Accepted

Solution code:
n = int(input())
h = int(input())
w = int(input())

print((n - w + 1)*(n - h + 1))

Submission status: Accepted

Solution code:
N = int(input().strip())
H = int(input().strip())
W = int(input().strip())

print((N - H + 1) * (N - W + 1))

Submission status: Accepted

Solution code:
#      
import collections, atexit, math, sys, bisect 

sys.setrecursionlimit(1000000)
def getIntList():
    return list(map(int, input().split()))    

try :
    #raise ModuleNotFoundError
    import numpy
    def dprint(*args, **kwargs):
        #print(*args, **kwargs, file=sys.stderr)
        # in python 3.4 **kwargs is invalid???
        print(*args,  file=sys.stderr)
    dprint('debug mode')
except Exception:
    def dprint(*args, **kwargs):
        pass



inId = 0
outId = 0
if inId>0:
    dprint('use input', inId)
    sys.stdin = open('input'+ str(inId) + '.txt', 'r') #标准输出重定向至文件
if outId>0:
    dprint('use output', outId)
    sys.stdout = open('stdout'+ str(outId) + '.txt', 'w') #标准输出重定向至文件
    atexit.register(lambda :sys.stdout.close())     #idle 中不会执行 atexit
    
N, = getIntList()
H, = getIntList()
W, = getIntList()
#print(N)
r =0

r +=  (N-H+1) * (N-W+1)

print(r)

Submission status: Accepted

Solution code:
N=int(input())
H=int(input())
W=int(input())

ans=0

for i in range(N):
    for j in range(N):
        if H-1+i<=N-1 and W-1+j<=N-1:
            ans+=1

print(ans)

Submission status: Accepted

Solution code:
n = int(input())
h = int(input())
w = int(input())
print(max(0,n-h+1)*max(0,n-w+1))

Submission status: Accepted

Solution code:
N = int(input().strip())
H = int(input().strip())
W = int(input().strip())

ans = (N-H+1)*(N-W+1)
print(ans)

Submission status: Accepted

Solution code:
N = int(input())
H = int(input())
W = int(input())
y = N - H + 1
t = N - W + 1
print(y*t)

Submission status: Accepted

Solution code:
N = input()
H = input()
W = input()
print (N-W+1)*(N-H+1)

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
"""
Created on Sat Jan 12 20:43:41 2019

@author: Owner
"""

# -*- coding: utf-8 -*-
"""
Created on Sat Dec 29 18:42:51 2018

@author: Owner
"""

import collections
import scipy.misc
import sys
import numpy as np
import math
from operator import itemgetter
import itertools
#素因数を並べる
def prime_decomposition(n):
  i = 2
  table = []
  while i * i <= n:
    while n % i == 0:
      n /= i
      table.append(int(i))
    i += 1
  if n > 1:
    table.append(int(n))
  return table   
# 桁数を吐く
def digit(i):
    if i > 0:
        return digit(i//10) + [i%10]
    else:
        return []
"""
N, X = map(int, input().split())

x = [0]*N
x[:] = map(int, input().split())

P = [0]*M
Y = [0]*M
for m in range(M):
    P[m], Y[m] = map(int, input().split())
    
all(nstr.count(c) for c in '753')
"""


N = int(input())
H = int(input())
W = int(input())

num = (N-H+1)*(N-W+1)

print(num)

Submission status: Accepted

Solution code:
n=int(input());m=int(input());h=int(input())

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

Submission status: Accepted

Solution code:
n = int(input())
h = int(input())
w = int(input())

ans = (n - h + 1) * (n - w + 1)
print(ans)

Submission status: Accepted

Solution code:
N = int(input())
H = int(input())
W = int(input())

print((N-(W-1))*(N-(H-1)))

Submission status: Accepted

Solution code:
n = int(input())
h = int(input())
w = int(input())
a = (n-h+1)*(n-w+1)
print(a)

Submission status: Accepted

Solution code:
N=int(input())
H=int(input())
W=int(input())

print((N-H+1)*(N-W+1))

Submission status: Accepted

Solution code:
n = int(input())
h = int(input())
w = int(input())

x = n - w + 1
y = n - h + 1
print(x*y)

Submission status: Accepted

Solution code:
n = int(input())
h = int(input())
w = int(input())

ys = n - h + 1
ts = n - w + 1

print(ys * ts)

Submission status: Accepted

Solution code:
N = int(input())
H = int(input())
W = int(input())

ans = (N -W + 1) * (N - H + 1)

print(ans)

Submission status: Accepted

Solution code:
A = [int(input()) for _ in range(3)]
N = A[0]
H = A[1]
W = A[2]

print((N-W + 1) * (N-H + 1))

Submission status: Accepted

Solution code:
def solve(N, H, W):
  return (N + 1 - H) * (N + 1 - W)

N = int(input())
H = int(input())
W = int(input())

print(solve(N, H, W))

Submission status: Accepted

Solution code:
N = int( input())
H = int( input())
W = int( input())
print( (N+1-H)*(N+1-W))

Submission status: Accepted

Solution code:
n = int(input())
h = int(input())
w = int(input())
print((n + 1 - h) * (n + 1 - w))

Submission status: Accepted

Solution code:
n = input()
h = input()
w = input()
cnt = 0
for i in range(n):
	for j in range(n):
		if i + w <= n and j + h <= n:
			cnt += 1
print cnt

Submission status: Accepted

Solution code:
N = int(input())
H = int(input())
W = int(input())

ans = (N-H+1)*(N-W+1)
print(ans)

Submission status: Accepted

Solution code:
# A
N = int(input())
H = int(input())
W = int(input())
way = (N-H+1)*(N-W+1)
print(way)

Submission status: Accepted

Solution code:
N=int(input())
H=int(input())
W=int(input())
ans=(N-H+1)*(N-W+1)
print(ans)

Submission status: Accepted

Solution code:
n=int(raw_input(''))
h=int(raw_input(''))
w=int(raw_input(''))
ans = (n-h+1)*(n-w+1)
print ans

Submission status: Accepted

Solution code:
#!/Users/takahiro.kida/git/atcorder/venv/bin/python

import numpy
import scipy

N = int(input())
H = int(input())
W = int(input())

ans = (N - H + 1) * (N - W + 1)
print(ans)

Submission status: Accepted

Solution code:
n=int(input())
h=int(input())
w=int(input())

ans=(n-h+1)*(n-w+1)

print(ans)

Submission status: Accepted

Solution code:
N = input()
H = input()
W = input()

ans = (N-H+1)*(N-W+1)

print(ans)

Submission status: Accepted

Solution code:
n = int(input());h = int(input());w = int(input())
print((n-h+1)*(n-w+1))

Submission status: Accepted

Solution code:
N=int(input())
H=int(input())
W=int(input())

a = N-H +1
b = N-W +1

print(a*b)

Submission status: Accepted

Solution code:
n = int(input())
h = int(input())
w = int(input())
print((n - w + 1) * (n - h + 1))

Submission status: Accepted

Solution code:
n = int(input())
h = int(input())
w = int(input())


ans = (n - h+1)*(n-w+1)

print(ans)

Submission status: Accepted

Solution code:
n=int(input())
print((n-int(input())+1)*(n-int(input())+1))

Submission status: Accepted

Solution code:
N, H, W = map(int, open(0).read().split())
print((1+N-H)*(1+N-W))

Submission status: Accepted

Solution code:
N = int(input())
H = int(input())
W = int(input())
print((N - H + 1)*(N - W + 1))

Submission status: Accepted

Solution code:
N = int(input())
H = int(input())
W = int(input())

ans1 = N-H+1
ans2 = N-W+1

ans = ans1*ans2
print(ans)

Submission status: Accepted

Solution code:
n = int(input())
h = int(input())
w = int(input())


h = (n + 1 - h)
w = (n + 1 - w)

print(h * w)

Submission status: Accepted

Solution code:
#encoding:utf-8

N = int(input())
H = int(input())
W = int(input())


answer = (N-W+1)*(N-H+1)

print(answer)

Submission status: Accepted

Solution code:
N = int(input())
H = int(input())
W = int(input())

h_cases = N - H + 1
w_cases = N - W + 1

ans = h_cases * w_cases
print(ans)

Submission status: Accepted

Solution code:
#a, b, c, d = (int(i) for i in input().split())  
N = int(input())
H = int(input())
W = int(input())

print((N - W + 1) * (N - H + 1))

Submission status: Accepted

Solution code:
n, h, w = [int(input()) for i in range(3)]

print((n - h + 1) * (n - w + 1))

Submission status: Accepted

Solution code:
N = int(input())
H = int(input())
M = int(input())
print((N-H+1)*(N-M+1))

Submission status: Accepted

Solution code:
n=int(input())
h=int(input())
w=int(input())
x=n-h+1
y=n-w+1
print(x*y)

Submission status: Accepted

Solution code:
n = int(input())
h = int(input())
w = int(input())
a = n - h + 1
b = n - w + 1
print(a*b)

Submission status: Accepted

Solution code:
n = int(input())
h = int(input())
w = int(input())

width = n-h+1
height = n-w+1
print(width*height)

Submission status: Accepted

Solution code:
n = int(input())
h = int(input())
w = int(input())
print((1+n-h)*(1+n-w))

Submission status: Accepted

Solution code:
n = input()
h = input()
w = input()

print max(0, (n-w+1)*(n-h+1))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N = int(raw_input())
H = int(raw_input())
W = int(raw_input())

print((N-H+1) * (N-W+1))

Submission status: Accepted

Solution code:

def main():
    buf = input()
    N = int(buf)
    buf = input()
    H = int(buf)
    buf = input()
    W = int(buf)
    hspace = N - H + 1
    wspace = N - W + 1
    print(hspace * wspace)

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
N = int(input())
H = int(input())
W = int(input())

print(int((N-H+1)*(N-W+1)))

Submission status: Accepted

Solution code:
n = int(input())
h = int(input())
w = int(input())

print((n+1-h)*(n+1-w))

Submission status: Accepted

Solution code:
N, H, W = [int(input()) for i in range(3)]

print((N - H + 1) * (N - W + 1))

Submission status: Accepted

Solution code:
n = int(input())
h = int(input())
w = int(input())

ans = (n-h+1)*(n-w+1)
print(max(0, ans))

Submission status: Accepted

Solution code:
from sys import stdin

def main():
    N = int(input())
    H = int(input())
    W = int(input())

    ans = (N + 1 - H) * (N + 1 - W)
    print(ans)

input = lambda: stdin.readline()
main()

Submission status: Accepted

Solution code:
N=int(input())

H=int(input())
W=int(input())

print((N-H+1)*(N-W+1))

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
N = int(input())
H = int(input())
W = int(input())

print((N-H+1)*(N-W+1))

Submission status: Accepted

Solution code:
n = int(input())
height = int(input())
wide = int(input())
print((n-height+1)*(n-wide+1))

Submission status: Accepted

Solution code:
# coding: utf-8
import sys
input = sys.stdin.readline

N = int(input())
H = int(input())
W = int(input())
ans = (N-H+1) * (N-W+1)

print(ans)

Submission status: Accepted

Solution code:
n = int(input())
h = int(input())
w = int(input())

print((n + 1 - h) * (n + 1 - w))

Submission status: Accepted

Solution code:
N = int(input())
W = int(input())
H = int(input())

print((N - W + 1) * (N - H + 1))

Submission status: Accepted

Solution code:
N = int(input())
H = int(input())
W = int(input())

ans = 0
for i in range(N):
    for j in range(N):
        if i + H - 1 < N and j + W - 1 < N:
            ans += 1

print(ans)

Submission status: Accepted

Solution code:
N = int(input())

H = int(input())

W = int(input())

print((N-H+1)*(N-W+1))

Submission status: Accepted

Solution code:
N = int(input())
H = int(input())
W = int(input())
ans = 0
for i in range(N):
    for j in range(N):
        if i+H-1<N and j+W-1<N:
            ans+=1
print(ans)

Submission status: Accepted

Solution code:
N = int(input())
H = int(input())
W = int(input())

print((1 + (N - H)) * (1 + (N - W)))

Submission status: Accepted

Solution code:
while(True):
    try:
        n, h, w = [int(input()) for _ in range(3)]
        print((1 + n - h) * (1 + n - w))
    except EOFError:
        exit()

Submission status: Accepted

Solution code:
def main():
    n = int(input())
    h = int(input())
    w = int(input())

    print((n-h+1) * (n-w+1))

    return

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(N, W, H):
    return (N-W+1)*(N-H+1)


def main():
    N = read_int()
    H = read_int()
    W = read_int()
    print(slv(N, W, H))


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
# N = int(input())
# A = [int(x) for x in input().split()]
# V = [[0] * 100 for _ in range(100)]


N = int(input())
H = int(input())
W = int(input())

print((N - H + 1) * (N - W + 1))

Submission status: Accepted

Solution code:
n=int(input())
H=int(input())
W=int(input())
print((n-H+1)*(n-W+1))

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
n = int(input())
h = int(input())
w = int(input())

print((n-w+1)*(n-h+1))

Submission status: Accepted

Solution code:
N = int(input())
M = int(input())
L = int(input())

print((N - M + 1) * (N - L + 1))

Submission status: Accepted

Solution code:
n=int(input())
r=int(input())
c=int(input())
print((n-c+1)*(n-r+1))

Submission status: Accepted

Solution code:
# A
N = int(input())
H = int(input())
W = int(input())

print((N-H+1)*(N-W+1))

Submission status: Accepted

Solution code:
N = int(input())
H = int(input())
W = int(input())
print((N+1-H) * (N+1-W))

Submission status: Accepted

Solution code:
# coding: utf-8

II = lambda: int(input())

n, h, w = II(), II(), II()
print((n-h + 1) * (n-w + 1))

Submission status: Accepted

Solution code:
#coding:utf-8
N =  int(input())
H =  int(input())
W =  int(input())
print ((N-H+1)*(N-W+1))

Submission status: Accepted

Solution code:
def aising2019_a():
    n = int(input())
    h = int(input())
    w = int(input())

    print((n - h + 1) * (n - w + 1))


aising2019_a()