Problem:


Score : 100 points

Problem Statement

We have an N \times N square grid.

We will paint each square in the grid either black or white.

If we paint exactly A squares white, how many squares will be painted black?

Constraints

1 \leq N \leq 100

0 \leq A \leq N^2

Inputs

Input is given from Standard Input in the following format:

N
A

Outputs

Print the number of squares that will be painted black.

Sample Input 1

3
4

Sample Output 1

5

There are nine squares in a 3 \times 3 square grid.
Four of them will be painted white, so the remaining five squares will be painted black.

Sample Input 2

19
100

Sample Output 2

261

Sample Input 3

10
0

Sample Output 3

100

As zero squares will be painted white, all the squares will be painted black.



Sample input:
3
4


Sample output:
5

Submission status: Accepted

Solution code:
import sys
import os


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

    N = int(sys.stdin.readline().rstrip())
    A = int(sys.stdin.readline().rstrip())
    print(N*N-A)


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
n = int(input());a = int(input())

print(n**2 - a)

Submission status: Accepted

Solution code:
n = int(input())
a = int(input())

menseki = n**2
print(int(menseki-a))

Submission status: Accepted

Solution code:
from sys import stdin

n = int(stdin.readline().rstrip())
a = int(stdin.readline().rstrip())

print(n**2 - a)

Submission status: Accepted

Solution code:
N = input()
A = input()
print N * N - A

Submission status: Accepted

Solution code:
N,A =[int(input()) for i in range(2)]

print(N*N - A )

Submission status: Accepted

Solution code:
n=input()
a=input()
print n**2 -a

Submission status: Accepted

Solution code:
n = int(input())
m = int(input())
print(n**2-m)

Submission status: Accepted

Solution code:
stdin1 = int(input())
stdin2 = int(input())

print(stdin1 * stdin1 - stdin2)

Submission status: Accepted

Solution code:
N  = int(input())

A = int(input())

result = pow(N,2) - A

print(result)

Submission status: Accepted

Solution code:
N ,A = map(int, [input(), input()])
print(N**2-A)

Submission status: Accepted

Solution code:
n = int(input())
a = int(input())
print(n**2 -a)

Submission status: Accepted

Solution code:
#074_A
n=int(input())
a=int(input())
print(n*n-a)

Submission status: Accepted

Solution code:
#!/usr/bin/env pypy3
def I(): return int(input())
def MI(): return map(int, input().split())
def LI(): return list(map(int, input().split()))

def main():
    mod=10**9+7
    N=I()
    A=I()
    print(N*N-A)

main()

Submission status: Accepted

Solution code:
print(pow(int(input()), 2) - int(input()))

Submission status: Accepted

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

#----------
N = int(input().strip())
A = int(input().strip())
#----------

print(N**2 - A)

Submission status: Accepted

Solution code:
a,b=[int(input()) for n in range(2)]
print(a*a-b)

Submission status: Accepted

Solution code:
N=int(input())
A=int(input())

print(int(N*N-A))

Submission status: Accepted

Solution code:
N = int(input())
A = int(input())

print(N**2-A)

Submission status: Accepted

Solution code:
def main():
    grid = int(input()) ** 2
    white_cell = int(input())
    print(grid - white_cell)


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
N = input()
A = input()
N = int(N)
A = int(A)

print(N*N - A)

Submission status: Accepted

Solution code:
n = int(input())
a = int(input())

print(n*n -a)

Submission status: Accepted

Solution code:
N = int(input())
a = int(input())
print(N**2-a)

Submission status: Accepted

Solution code:
print(pow(int(input()),2)-int(input()))

Submission status: Accepted

Solution code:
def blackarea(n , a):

    return n * n - a

def main():
    n = int(input())
    a = int(input())
    print(blackarea(n , a))

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
a = int(input())
b = int(input())
print((a**2)-b)

Submission status: Accepted

Solution code:
N = int(input())
A = int(input())
print((N**2) - A)

Submission status: Accepted

Solution code:
n,a=[int(input()) for _ in range(2)]
print(n*n-a)

Submission status: Accepted

Solution code:
a=open(0).read().split();print(int(a[0])**2-int(a[1]));

Submission status: Accepted

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

Submission status: Accepted

Solution code:
x=int(input())
y=int(input())
print(x*x-y)

Submission status: Accepted

Solution code:
# 入力 : 数字2つ
N = int(input())
A = int(input())

# 出力　N^2-A
ans = N * N - A
print(ans)

Submission status: Accepted

Solution code:
a = int(input())
b = int(input())

print(a*a-b)

Submission status: Accepted

Solution code:
n=int(input())
a=int(input())

print(n**2 - a)

Submission status: Accepted

Solution code:
N = int(input())
A = int(input())
n = N*N
ans = n - A

print(ans)

Submission status: Accepted

Solution code:
str = input().split()
n = int(str[0])
str = input().split()
a = int(str[0])
print(n * n - a)

Submission status: Accepted

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


def main():
    N = int(input())
    A = int(input())
    print(N**2 - A)


if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
print(int(input())**2-int(input()))

Submission status: Accepted

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

Submission status: Accepted

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

import sys
import itertools

# import numpy as np

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

N, H = map(int, read().split())
print(N * N - H)

Submission status: Accepted

Solution code:
n=int(input())
a=int(input())
x=n**2
print(x-a)

Submission status: Accepted

Solution code:
N = int(input())
A = int(input())

ans = N ** 2 - A

print(ans)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N = int(input())
A = int(input())
answer = N**2 - A

print(answer)

Submission status: Accepted

Solution code:
N = int(input())
x = int(input())

print(N*N-x)

Submission status: Accepted

Solution code:
N, A = int(input()), int(input())
print(N**2-A)

Submission status: Accepted

Solution code:
a = int(input())
b = int(input())

print(a ** 2 - b)

Submission status: Accepted

Solution code:
#ALC005 A

N = int(input())
A = int(input())

print((N**2) - A)

Submission status: Accepted

Solution code:
a,b= (int(input()) for _ in range(2))
print(a**2-b)

Submission status: Accepted

Solution code:
a,b = (int(input()) for _ in range(2))
print(pow(a,2)-b)

Submission status: Accepted

Solution code:


import numpy as np

n=int(input())
a=int(input())
print(n*n-a)

Submission status: Accepted

Solution code:
import sys
input = sys.stdin.readline
N = int(input())
A = int(input())
print(N * N - A)

Submission status: Accepted

Solution code:
N = int(input())
A = int(input())
print(int(N**2 - A))

Submission status: Accepted

Solution code:
n = int(input())
a = int(input())
square_num = n * n
print(square_num - a)

Submission status: Accepted

Solution code:

N = int(input())
A = int(input())

B = N * N - A

print(B)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n = int(input())
a = int(input())

print(abs(n**2-a))

Submission status: Accepted

Solution code:
n = int(input())
k = int(input())
print(n**2-k)

Submission status: Accepted

Solution code:


n = int(input())
a = int(input())
print(n**2-a)

Submission status: Accepted

Solution code:
n=int(input())

a=int(input())

print(n**2-a)

Submission status: Accepted

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

print(n*n-m)

Submission status: Accepted

Solution code:
a = int(input())
n = int(input())

print(a**2-n)

Submission status: Accepted

Solution code:
n,a=list(int(input()) for _ in range(2))

print(n**2-a)

Submission status: Accepted

Solution code:
from sys import stdin
N = int(stdin.readline().rstrip())
A = int(stdin.readline().rstrip())
print(N**2-A)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
print(pow(int(input()),2)-int(input()))

Submission status: Accepted

Solution code:
n, a=[int(input()) for i in range(2)]
ans = n * n - a
print(ans)

Submission status: Accepted

Solution code:
import sys

n, a = map(int, sys.stdin.read().split())

def main():
    return n ** 2 - a

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

Submission status: Accepted

Solution code:
n, a = [int(input()) for i in range(2)]
print(n ** 2 - a)

Submission status: Accepted

Solution code:
n = int(input())
a = int(input())

print(n **2 - a)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N = int( input() )
A = int( input() )

print( N * N - A )

Submission status: Accepted

Solution code:
a=int(input())
b=int(input())

print(a**2-b)

Submission status: Accepted

Solution code:
n = int(input())
a = int(input())

ans = n ** 2 - a
print(ans)

Submission status: Accepted

Solution code:
import sys
import bisect

stdin = sys.stdin
 
ri = lambda: int(rs())
rl = lambda: list(map(int, stdin.readline().split()))
rs = lambda: stdin.readline().rstrip()  # ignore trailing spaces

print(ri() ** 2 - ri())

Submission status: Accepted

Solution code:
n = int(input())
a = int(input())
ans = n * n - a
print(ans)

Submission status: Accepted

Solution code:
n = int(input())
a = int(input())

print(n**2 - a)

Submission status: Accepted

Solution code:
a=int(input())**2
print(a-int(input()))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n=int(input())
a=int(input())

print(n**2-a)

Submission status: Accepted

Solution code:
n =int(input())
a =int(input())
print(n**2-a)

Submission status: Accepted

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

n = int(input())
a = int(input())

print(n**2-a)

Submission status: Accepted

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

n=int(input())
a=int(input())
print(n**2-a)

Submission status: Accepted

Solution code:
import sys

sys.setrecursionlimit(10 ** 6)
int1 = lambda x: int(x) - 1
p2D = lambda x: print(*x, sep="\n")
def MI(): return map(int, sys.stdin.readline().split())
def LI(): return list(map(int, sys.stdin.readline().split()))
def LLI(rows_number): return [LI() for _ in range(rows_number)]

def main():
    n=int(input())
    a=int(input())
    print(n*n-a)
main()

Submission status: Accepted

Solution code:
n = int(input())
a = int(input())
print (n**2-a)

Submission status: Accepted

Solution code:
n, a = map(int, open(0).read().split())
print(n * n - a)

Submission status: Accepted

Solution code:
N = int(input())
A = int(input())

N_N = (N*N)

print((N_N)- A)

Submission status: Accepted

Solution code:
A=int(input())
B=int(input())
print(A*A-B)

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
# 入力
#N = str(input())
# スペース区切りの整数の入力
#N, A = map(int, input().split())

N = int(input())
A = int(input())

print (N**2 -A)

Submission status: Accepted

Solution code:
from sys import stdin
inf = 10**3
n = int(stdin.readline().rstrip())
a = int(stdin.readline().rstrip())

print(n**2-a)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def examA():
    N = I(); A = I()
    ans = N*N - A
    print(ans)


import sys
import copy
import bisect
import heapq
from collections import Counter,defaultdict,deque
def I(): return int(sys.stdin.readline())
def LI(): return list(map(int,sys.stdin.readline().split()))
def LS(): return sys.stdin.readline().split()
def S(): return sys.stdin.readline().strip()
mod = 10**9 + 7
inf = float('inf')

examA()

Submission status: Accepted

Solution code:
n=int(input())
a=int(input())
n=n**2
a=n-a
print(a)

Submission status: Accepted

Solution code:
n=int(input()) 
a=int(input())
print(n**2-a)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N = int(input())
x = int(input())
print(N*N-x)

Submission status: Accepted

Solution code:
N, A = int(input()), int(input())
print(N*N-A)

Submission status: Accepted

Solution code:
square = int(input())
black = int(input())
white = (square * square) - black
print(white)

Submission status: Accepted

Solution code:
# A - Bichrome Cells
print(int(input())**2-int(input()))

Submission status: Accepted

Solution code:
#Bichrome Cells
N = int(input())
A = int(input())
print(N**2 - A)

Submission status: Accepted

Solution code:
n = int(input())
a = int(input())

white= n**2 - a
print(white)

Submission status: Accepted

Solution code:
from sys import stdin

n, a = (int(x) for x in stdin.read().split())
ans = n ** 2 - a
print(ans)

Submission status: Accepted

Solution code:
n=int(input())
a=int(input())

n1=n*n

b=n1-a

print(b)

Submission status: Accepted

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

val = N*N-A
if(val >= 0):
  print(N*N-A)
else:
  print(0)

Submission status: Accepted

Solution code:
# A - Bichrome Cells
n = int(input())
a = int(input())

print(n ** 2 - a)

Submission status: Accepted

Solution code:
N = int(input())
A = int(input())
print(N*N - A)

Submission status: Accepted

Solution code:
n =int(input())
a =int(input())
print(n**2-a)

Submission status: Accepted

Solution code:
N = input()
n =int(N)
a = input()
A = int(a)
difference = int(n**2-A)
print(difference)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n, a = [int(input()) for _ in range(2)]
print(n * n - a)

Submission status: Accepted

Solution code:
N = int(input())
A = int(input())

ans = N**2 - A

print(ans)

Submission status: Accepted

Solution code:

def main():
    N = int(input())
    A = int(input())
    print(N*N - A)


if __name__ == "__main__":
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N = int(input())
A = int(input())
print(N*N -A)

Submission status: Accepted

Solution code:
N = int(input())
A  =int(input())
print(max(N**2-A,0))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def main():
    n=int(input())
    a=int(input())
    print(n**2-a)
if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
n = int(input())
a = int(input())
print((n**2) - a)

Submission status: Accepted

Solution code:
a = [int(input()) for i in range(2)]
N=a[0]
A=a[1]
print(N*N-A)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
stdin = sys.stdin
mod = 10**9 + 7

ns = lambda: stdin.readline().rstrip()
ni = lambda: int(ns())
na = lambda: list(map(int, stdin.readline().split()))
sa = lambda h: [list(map(int, stdin.readline().split())) for i in range(h)]

n = ni()
a = ni()
print(n**2 - a)

Submission status: Accepted

Solution code:
def slove():
    import sys
    input = sys.stdin.readline
    n = int(input().rstrip('\n'))
    a = int(input().rstrip('\n'))
    print(n * n - a)


if __name__ == '__main__':
    slove()

Submission status: Accepted

Solution code:
import sys

input = sys.stdin.readline


def main():
    n = int(input())
    a = int(input())
    print(n * n - a)


if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
N,A = map(int,open(0).read().split())
print(N**2-A)

Submission status: Accepted

Solution code:
n = int(input())
siro = int(input())
zen = n*n
kuro = zen - siro
if kuro <= 0:
    print(0)
else:
    print(kuro)

Submission status: Accepted

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

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():
    n=INT()
    a=INT()
    print(n**2-a)
if __name__ == '__main__':
    do()

Submission status: Accepted

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

Submission status: Accepted

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

n = int(input())
a = int(input())

print(n*n-a)

Submission status: Accepted

Solution code:
#2019/09/23
N = int(input())
A = int(input())
print(N * N - A)

Submission status: Accepted

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

# input
N = int(input())
A = int(input())

# solve & output
print(N * N - A)

Submission status: Accepted

Solution code:
n = int(input())
a = int(input())

print(n**2 -a)

Submission status: Accepted

Solution code:
#ABC074A
N = int(input())
A = int(input())
print(N**2-A)

Submission status: Accepted

Solution code:
N = int(input())
A = int(input())

print(N*N - A)

Submission status: Accepted

Solution code:
import sys
import math
from fractions import gcd
# import queue
# from collections import Counter
# from itertools import accumulate
# from functools import reduce

def lcm(a, b):
    return a * b // gcd(a, b)

def combination_count(n, r):
    return math.factorial(n) // (math.factorial(n - r) * math.factorial(r))

def permutations_count(n, r):
    return math.factorial(n) // math.factorial(n - r)

big_prime = 1000000007

"""
# 標準入力取得
## 文字列
 =  sys.stdin.readline().rstrip()
 =  list(sys.stdin.readline().rstrip())

## 数値
 =  int(sys.stdin.readline())
 =  map(int, sys.stdin.readline().split())
 =  list(map(int, sys.stdin.readline().split()))
 =  [list(map(int,list(sys.stdin.readline().split()))) for i in range(N)]
"""


N =  int(sys.stdin.readline())
A =  int(sys.stdin.readline())

print(N ** 2 - A)

Submission status: Accepted

Solution code:
n, a = map(int, [input() for i in range(2)])

print(n ** 2 - a)

Submission status: Accepted

Solution code:
A = int(input())
B = int(input())
print(A**2-B)

Submission status: Accepted

Solution code:
import sys
sys.setrecursionlimit(200000)
input = sys.stdin.readline

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

print(N ** 2 - A)

Submission status: Accepted

Solution code:
N = int(input())
A = int(input())
print(N **2 -A)

Submission status: Accepted

Solution code:
import sys

if sys.platform =='ios':
    sys.stdin=open('input_file.txt')
    
    
n=int(input())
a=int(input())

print(n**2-a)

Submission status: Accepted

Solution code:
def resolve():
    n = int(input())
    a = int(input())
    print(n ** 2 - a)


if __name__ == "__main__":
    resolve()

Submission status: Accepted

Solution code:
n, a = [int(input()) for i in range(2)]
print(n*n - a)

Submission status: Accepted

Solution code:
import sys

if sys.platform =='ios':
    sys.stdin=open('input_file.txt')
    
    
x=int(input())
a=int(input())

print(x**2-a)

Submission status: Accepted

Solution code:
N = int(input().strip())
w = int(input().strip())
print(N*N-w)

Submission status: Accepted

Solution code:
N=int(input())
A=int(input())
black_cell=N**2-A
print(black_cell)

Submission status: Accepted

Solution code:
N, A=[int(input()) for i in range(2)]
print(N**2 - A)

Submission status: Accepted

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

def main():
    N = int(input())
    A = int(input())

    print(max(0, N*N - A))

if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
print(int(input()) ** 2 - int(input()))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:

N = int(input())
A = int(input())

print(N*N-A)

Submission status: Accepted

Solution code:
N =int(input())
A =int(input())
print(N*N-A)

Submission status: Accepted

Solution code:
n = int(input())
a = int(input())
if 1 <= n <= 100 and 0 <= a <= n ** 2:
    print(n ** 2 - a)
else:
    print('hoge!')

Submission status: Accepted

Solution code:
import sys

stdin = sys.stdin

ni = lambda: int(ns())
na = lambda: list(map(int, stdin.readline().split()))
ns = lambda: stdin.readline().rstrip()

n = ni()
a = ni()
print(n ** 2 - a)

Submission status: Accepted

Solution code:
N = int(input())
A = int(input())
print(str(N**2-A))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N = int(input())
A = int(input())
print((N**2)-A)

Submission status: Accepted

Solution code:
n = int(input())
a = int(input())
print(n**2 - a)

Submission status: Accepted

Solution code:
num = [int(input()) for i in range(2)]
print(num[0]**2-num[1])

Submission status: Accepted

Solution code:
n = int(input())
a = int(input())

ans = (n*n) -a
print(ans)

Submission status: Accepted

Solution code:
N = int(input())
A = int(input())
r = N*N-A
print(r)

Submission status: Accepted

Solution code:
n, a = [int(input()) for _ in range(2)]
print(n ** 2 - a)

Submission status: Accepted

Solution code:
a = int(input())
b = int(input())

print(a*a - b)

Submission status: Accepted

Solution code:
N, A = map(int, [input() for _ in range(2)])
print(N ** 2 - A)

Submission status: Accepted

Solution code:
def main():
    N = int(input())
    A = int(input())
    return N*N - A

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

Submission status: Accepted

Solution code:
#coding:utf-8
n = int(input())
a = int(input())
print(n*n - a)

Submission status: Accepted

Solution code:
N = int(input())
A = int(input())
print (N * N - A)

Submission status: Accepted

Solution code:
n=int(input());a=int(input());print(n*n-a)

Submission status: Accepted

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

N = int(input())
A = int(input())

print(N ** 2 - A)

Submission status: Accepted

Solution code:
def test():
    n = int(input())
    a = int(input())
    print(n**2 - a)


if __name__ == "__main__":
    test()

Submission status: Accepted

Solution code:

n = int(input())
a = int(input())
print(n**2-a)

Submission status: Accepted

Solution code:
n, a = map(int, [input() for _ in range(2)])
print(n**2 - a)

Submission status: Accepted

Solution code:
n = int(input())
a = int(input())

print(int((n*n) - a))

Submission status: Accepted

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

print(int(n*n-m))

Submission status: Accepted

Solution code:
N,A=[int(input()) for _ in range(2)]
print(N*N-A)

Submission status: Accepted

Solution code:
N = int(input())
A = int(input())

print(N ** 2 - A)

Submission status: Accepted

Solution code:
print((int(input())**2-int(input())))

Submission status: Accepted

Solution code:
print(pow(int(input()),2) - int(input()))

Submission status: Accepted

Solution code:
a = int(input())
b = int(input())

print(a**2-b)

Submission status: Accepted

Solution code:
n = int(input())
s = int(input())
print(n**2 - s)

Submission status: Accepted

Solution code:
n, a = [int(input()) for _ in range(2)]
print(n**2-a)

Submission status: Accepted

Solution code:
N,A = map(int,open(0).read().split())
print(N**2-A)

Submission status: Accepted

Solution code:
print((int(input())**2)-int(input()))

Submission status: Accepted

Solution code:
a = int(input())
b = int(input())

print((a * a) - b)

Submission status: Accepted

Solution code:
n,a=map(int,open(0).read().split())
print(n*n-a)

Submission status: Accepted

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


def solve(N: int, A: int):
    print(N**2-A)
    return


# Generated by 1.1.4 https://github.com/kyuridenamida/atcoder-tools  (tips: You use the default template now. You can remove this line by using your custom template)
def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    N = int(next(tokens))  # type: int
    A = int(next(tokens))  # type: int
    solve(N, A)

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
#10:40
n = int(input())
a = int(input())
print ( n * n - a )

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N = int(input())
A = int(input())

nA = N**2 - A

print(nA)

Submission status: Accepted

Solution code:
#74

N = int(input())
A = int(input())

print(N*N-A)

Submission status: Accepted

Solution code:
n = int(input())
a = int(input())
brack = n ** 2 - a
print(brack)

Submission status: Accepted

Solution code:
if __name__ == '__main__':
    N = int(input())
    A = int(input())

    print(N*N-A)

Submission status: Accepted

Solution code:
N = int( input())
A = int( input())
print(N**2-A)

Submission status: Accepted

Solution code:
N = int(input())
A = int(input())
print(N **2 - A)

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
import sys
INF = float("inf")


def solve(N: int, A: int):
    print(N**2-A)
    return


def main():

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


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
n,a=[int(input()) for _ in range(2)]

print(n**2-a)

Submission status: Accepted

Solution code:
def main47():
    n = int(input())
    a = int(input())
    result = n * n - a
    print(result)

if __name__ == "__main__":
    main47()

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
import sys
import copy
import collections
from bisect import bisect_left
from bisect import bisect_right
from collections import defaultdict
from heapq import heappop, heappush
import math

# NO, PAY-PAY
#import numpy as np
#import statistics
#from statistics import mean, median,variance,stdev

def inputInt(): return int(input())
def inputMap(): return map(int, input().split())
def inputList(): return list(map(int, input().split()))
 
def main():
    N = inputInt()
    A = inputInt()
    
    tmp = N*N
    print(tmp-A)
    
            	
if __name__ == "__main__":
	main()

Submission status: Accepted

Solution code:
N, A = map(int, (input() for _ in range(2)))

print(str(N**2 - A))

Submission status: Accepted

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

print(n*n - a)

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-S
N = int(input())
A = int(input())

B = N * N - A
print(B)

Submission status: Accepted

Solution code:
i1 = int(input())
i2 = int(input())
print(i1**2-i2)

Submission status: Accepted

Solution code:
N,A = [int(input()) for i in range(2)]
print(N**2-A)

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
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 input(): return sys.stdin.readline().strip()
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(): return list(map(int, input().split()))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7

N = INT()
A = INT()
print(N * N - A)

Submission status: Accepted

Solution code:
a = int(input())
b = int(input())
print(a**2-b)

Submission status: Accepted

Solution code:
N = int(input())
A = int(input())

ans = int((N * N) - A)
print(ans)

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
from collections import defaultdict
from collections import deque
from heapq import heappush, heappop
import sys
import math
import bisect
import random
import itertools
sys.setrecursionlimit(10**5)
stdin = sys.stdin
bisect_left = bisect.bisect_left
bisect_right = bisect.bisect_right
def LI(): return list(map(int, stdin.readline().split()))
def LF(): return list(map(float, stdin.readline().split()))
def LI_(): return list(map(lambda x: int(x)-1, stdin.readline().split()))
def II(): return int(stdin.readline())
def IF(): return float(stdin.readline())
def LS(): return list(map(list, stdin.readline().split()))
def S(): return list(stdin.readline().rstrip())
def IR(n): return [II() for _ in range(n)]
def LIR(n): return [LI() for _ in range(n)]
def FR(n): return [IF() for _ in range(n)]
def LFR(n): return [LI() for _ in range(n)]
def LIR_(n): return [LI_() for _ in range(n)]
def SR(n): return [S() for _ in range(n)]
def LSR(n): return [LS() for _ in range(n)]
mod = 1000000007
inf = float('INF')

#A
def A():
    n, a = II(), II()
    print(n*n-a)
    return

#B
def B():
    return

#C
def C():
    return

#D
def D():
    return

#E
def E():
    return

#F
def F():
    return

#G
def G():
    return

#H
def H():
    return

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

Submission status: Accepted

Solution code:
a,b=[int(input())for i in range(2)]
print(a*a-b)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N=int(input())
A=int(input())
X=N**2-A
print(X)

Submission status: Accepted

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

n = int(input())
a = int(input())

print(n**2-a)

Submission status: Accepted

Solution code:
N = int(input())
A = int(input())

print(N*N - A)

Submission status: Accepted

Solution code:
masu = int(input())**2
white = int(input())

print(masu-white)

Submission status: Accepted

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

N = int(input())
A = int(input())

# print(N**2)
# print(A)

print((N**2) - A)

Submission status: Accepted

Solution code:
N=int(input())
A = int(input())
print(N*N-A)

Submission status: Accepted

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

N = n()
A = n()

print(N*N-A)

Submission status: Accepted

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


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


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


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
n = int(input())
a = int(input())
x = n**2 - a
if x >= 0:
    print(x)
else:
    print(0)

Submission status: Accepted

Solution code:
n = int(input())
a = int(input())
x = n**2 - a
if x >= 0:
    print(x)
else:
    print(0)

Submission status: Accepted

Solution code:
n, a = int(input()), int(input())
print(n ** 2 - a)

Submission status: Accepted

Solution code:
def main():
    print(int(input()) ** 2 - int(input()))


main()

Submission status: Accepted

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

N = int(input())
white = int(input())
NN = N ** 2

print(NN - white)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N=int(input());A=int(input())
print(N*N-A)