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:
N = int(input())
A = int(input())
print (N * N -A)

Submission status: Accepted

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


abc()

Submission status: Accepted

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

Submission status: Accepted

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

n, a = int(input()), 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())
print(int(n*n-a))

Submission status: Accepted

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


def solve(N: int, A: int):
    ret = N * N - A
    print(ret)
    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 * N - A)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import math


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





if __name__ == '__main__':
    main()

Submission status: Accepted

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

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:
a=int(input())
b=int(input())

print(a**2-b)

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:

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

print(N**2 - A)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys


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

# N = int(input())
# A = [int(x) for x in input().split()]
# a, b, c = map(int, input().split())
# name1 = str(input())
# alph = {"A": 1, "B": 2, "C": 3, "D": 4, "E": 5}


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())
print(n**2 - a)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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 * n -a)

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:

def read_input():
    n = int(input())
    a = int(input())
    return n, a


def submit():
    n, a = read_input()
    print(n*n - a)


if __name__ == '__main__':
    submit()

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**2-b)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys, os

f = lambda:list(map(int,input().split()))
if 'local' in os.environ :
    sys.stdin = open('./input.txt', 'r')

def solve():
    n = f()[0]
    a = f()[0]
    print(n*n - a)

solve()

Submission status: Accepted

Solution code:
from functools import reduce
import math

def main():
    # 文字列の2進数を数値にする
    # '101' → '5'
    # 文字列の頭に'0b'をつけてint()にわたす
    # binary = int('0b'+'101',0)

    # 2進数で立っているbitを数える
    # 101(0x5) → 2
    # cnt_bit = bin(5).count('1')
    
    # N! を求める
    # f = math.factorial(N)

    # N の逆元
    # N_inv = pow(N,MOD-2,MOD)

    # nCr
    # Nの階乗 * rの階乗の逆元 * n-rの階乗の逆元
    
    # 切り捨て
    # 4 // 3
    # 切り上げ
    #-(-4 // 3)
    
    # 初期値用:十分大きい数(100億)
    INF = float("inf")

    # 大きな素数
    MOD = 10**9+7
    
    # 1文字のみを読み込み
    # 入力:2
    # a = input().rstrip()
    # 変数:a='2'
    
    # スペース区切りで標準入力を配列として読み込み
    # 入力:2 4 5 7
    # a, b, c, d = (int(_) for _ in input().split())  
    # 変数:a=2 b=4 c=5 d =7
    
    # 1文字ずつ標準入力を配列として読み込み
    # 入力:2 4 5 7
    # a = list(int(_) for _ in input().split())
    # 変数:a = [2, 4, 5, 7]    

    # 1文字ずつ標準入力を配列として読み込み
    # 入力:2457
    # a = list(int(_) for _ in input())
    # 変数:a = [2, 4, 5, 7]    
    N = int(input())
    A = int(input())
    
    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:
x = int(input()) ** 2
y = int(input())
print(x - y)

Submission status: Accepted

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

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

print(n*n - a)

Submission status: Accepted

Solution code:
import functools

import os

INF = float('inf')


def inp():
    return int(input())


def inpf():
    return float(input())


def inps():
    return input()


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


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


def inls():
    return input().split()


def inpm(line):
    return [inp() for _ in range(line)]


def inpfm(line):
    return [inpf() for _ in range(line)]


def inpsm(line):
    return [inps() for _ in range(line)]


def inlm(line):
    return [inl() for _ in range(line)]


def inlfm(line):
    return [inlf() for _ in range(line)]


def inlsm(line):
    return [inls() for _ in range(line)]


def debug(fn):
    if not os.getenv('LOCAL'):
        return fn

    @functools.wraps(fn)
    def wrapper(*args, **kwargs):
        print('DEBUG: {}({}) -> '.format(
            fn.__name__,
            ', '.join(
                list(map(str, args)) +
                ['{}={}'.format(k, str(v)) for k, v in kwargs.items()]
            )
        ), end='')
        ret = fn(*args, **kwargs)
        print(ret)
        return ret

    return wrapper


n, a = inpm(2)
print(n**2-a)

Submission status: Accepted

Solution code:
# ABC074A - Bichrome Cells
n, a= list(map(int, [input().rstrip() for _ in range(2)]))
print(n ** 2 - a)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N, A = int(input()), 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, A = int(input()), 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())
Y = N**2 -A
print(Y)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

print(n**2- s)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

if b > 0:
    print(b)
else:
    print(0)

Submission status: Accepted

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

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
def LI(): return list(map(int, sys.stdin.readline().split()))
def I(): return int(sys.stdin.readline())
def LS():return list(map(list, sys.stdin.readline().split()))
def S(): return list(sys.stdin.readline())[:-1]
def IR(n):
    l = [None for i in range(n)]
    for i in range(n):l[i] = I()
    return l
def LIR(n):
    l = [None for i in range(n)]
    for i in range(n):l[i] = LI()
    return l
def SR(n):
    l = [None for i in range(n)]
    for i in range(n):l[i] = S()
    return l
def LSR(n):
    l = [None for i in range(n)]
    for i in range(n):l[i] = SR()
    return l
mod = 1000000007

#A
n,a = IR(2)
print(n**2-a)
#B

#C
"""
a,b,c,d,e,f = LI()
a *= 100
b *= 100
ans = [a,0]
for i in range(f//a+1):
    for j in range((f-a*i)//b+1):
        for k in range((f-a*i-b*j)//c+1):
            for l in range((f-a*i-b*j-c*k)//d+1):
                if i or j or k or l:
                    s = c*k+d*l
                    w = a*i+b*j
                    q = w*e//100
                    if s <= q:
                        if w+s <= f:
                            if ans[1]/ans[0] < s/(s+w):
                                ans = [w+s,s]
print(*ans)
"""

#D
"""
n = I()
d = LIR(n)
l = [[1 for j in range(n)] for i in range(n)]
for k in range(n):
    for i in range(n):
        for j in range(n):
            if d[i][j] > d[i][k]+d[k][j]:
                print(-1)
                quit()
            if d[i][j] == d[i][k]+d[k][j]:
                l[i][j] = l[i][k]+l[k][j]

ans = 0
for i in range(n):
    for j in range(n):
        if l[i][j] == 4:
            ans += d[i][j]
ans //= 2
print(ans)
"""
#E

#F

#G

#H

#I

#J

#K

#L

#M

#N

#O

#P

#Q

#R

#S

#T

Submission status: Accepted

Solution code:
# https://atcoder.jp/contests/abc074/tasks/abc074_a

import itertools
import collections
import bisect

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

if __name__ == '__main__':
    main()

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:
import sys

def main():
    input = sys.stdin.readline
    N = int(input())
    A = int(input())

    print(N**2 - A)


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
def bichrome_cells(N: int, A: int)->int:
    return N*N - A


if __name__ == "__main__":
    N = int(input())
    A = int(input())
    ans = bichrome_cells(N, A)
    print(ans)

Submission status: Accepted

Solution code:
one_side=input()
oneside=int(one_side)
whole=oneside**2
white_side=input()
whiteside=int(white_side)
print(whole-whiteside)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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


def func(n, a):
    result = n * n - a
    return result


N = int(input())
A = int(input())
print(func(N, A))

Submission status: Accepted

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


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


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
#ABC74
n = int(input())
a = int(input())
print(n**2-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())
A = int(input())

block = N * N
ans = block - A

print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

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())
ans = N*N - A
print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# coding: utf-8
N = int(input())
A = int(input())
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*n-a)

Submission status: Accepted

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

print( N*N - A )

Submission status: Accepted

Solution code:
n,a=[int(input()) for i in range(2)]
print(min(n**2,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:
def get_num():
    n = int(input())
    w = int(input())
    return n,w

def check_range(n,w):
    return n in range(1,101) and w in range(n**2+1)

def black_tiles(n,w):
    if (check_range(n,w)):
        return n**2 - w
    else:
        raise Exception('Value out of range')

if (__name__=='__main__'):
    print(black_tiles(*get_num()))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

ans = N * N - A

print(ans)
print()

Submission status: Accepted

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

n *= n
print(n-a)

Submission status: Accepted

Solution code:
print(eval(input()+'**2-'+input()))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import heapq
from collections import deque
from enum import Enum
import sys
import math
from _heapq import heappush, heappop

BIG_NUM = 2000000000
MOD = 1000000007
EPS = 0.000000001


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

print("%d"%(N*N-A))

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:
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:
a=int(input())
print(a*a-int(input()))

Submission status: Accepted

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

all_cells = N * N
black_cells = all_cells - A
print(black_cells)

Submission status: Accepted

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

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

MASU = N*N
black = MASU - A
print(black)

Submission status: Accepted

Solution code:
def main():
  a = int(input())
  white = int(input())
  print((a * a) - white)

if __name__ == '__main__':
  main()

Submission status: Accepted

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

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())
M=N*N
print(M-A)

Submission status: Accepted

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


abc074_a()

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:
x = int(input())
y = int(input())
print(x ** 2 - y)

Submission status: Accepted

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


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


if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
from statistics import mean, median,variance,stdev
import sys
import math

#x = input().split()
#y = input().split()

x = int(input())
y = int(input())

print(pow(x,2)-y)

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
N = int(input())
A = int(input())
print("{}".format(N**2 - A))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N = int(input())**2
A = int(input())
print(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())
print(N**2 - int(input()))

Submission status: Accepted

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

num = N * N - A
print(num)

Submission status: Accepted

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

Submission status: Accepted

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

a=int(input())
b=int(input())

s=a*a-b

print(s)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N = input()
A = 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,A = [int(input()) for i in range(2)]
print(N*N-A)

Submission status: Accepted

Solution code:
#coding: utf-8
print(int(input())**2 - int(input()))

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
# -*- coding: utf-8 -*-
n  = int( input())
a  = int( input())

print(n**2-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())
A = int(input())
ans = (N ** 2) - A
print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a = int(input()) # 整数
b = int(input()) # 整数

print (a * a - b)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from collections import defaultdict, Counter
from itertools import product, groupby, count, permutations, combinations
from math import pi, sqrt
from collections import deque
from bisect import bisect, bisect_left, bisect_right
from string import ascii_lowercase
from functools import lru_cache
import sys
sys.setrecursionlimit(10000)
INF = float("inf")
YES, Yes, yes, NO, No, no = "YES", "Yes", "yes", "NO", "No", "no"
dy4, dx4 = [0, 1, 0, -1], [1, 0, -1, 0]
dy8, dx8 = [0, -1, 0, 1, 1, -1, -1, 1], [1, 0, -1, 0, 1, 1, -1, -1]

def inside(y, x, H, W):
    return 0 <= y < H and 0 <= x < W


def ceil(a, b):
    return (a + b - 1) // b


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


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
#全体のマス目の数
N1 = int( input() )
N = N1 ** 2
#白く塗るマス目の数
A = int( input() )
#黒く塗るマス目の数
print( N - A )

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N,A=int(input()),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*N)-A)

Submission status: Accepted

Solution code:
#74a
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 = 2
Data = []
for i in range(n):
    Data.append(int(input()))
print(Data[0]**2 - Data[1])

Submission status: Accepted

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

print(N*N-A)

Submission status: Accepted

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

def main():
    n = int(input())
    a = int(input())

    print(n * n - a)

if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

b = input()

print(n - int(b))

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 ** 2 -a)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:

def main():
    n = input()
    a = input()
    a = int(a)
    n = int(n)

    print(n*n - a)

if __name__ == "__main__":
        main()

Submission status: Accepted

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

re = N * N - A
print(re)

Submission status: Accepted

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

print(A*A-B)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

cells = N ** 2

print(cells - A)

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(raw_input())
A=int(raw_input())
print N*N - A

Submission status: Accepted

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

Submission status: Accepted

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

print(int(input())**2-int(input()))

Submission status: Accepted

Solution code:
# input
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:
print input()**2-input()

Submission status: Accepted

Solution code:
print('{}'.format(int(input())**2-int(input())))

Submission status: Accepted

Solution code:
# ６月５日
a = int(input())
b = int(input())
c = a**2-b
print(c)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
inn = int(input())
ina = int(input())

print(inn * inn - ina)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

print(n*n-a)

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

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

Submission status: Accepted

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

print N*N - 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())
a=int(input())
print(n*n-a)
#inputはstrに対応
#勝手に改行

Submission status: Accepted

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

Submission status: Accepted

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

print(a ** 2 -b)

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

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

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())
M = int(input())
print(N * N - M)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import math
import sys

def getinputdata():

    # 配列初期化
    array_result = []
    
    data = input()

    
    array_result.append(data.split(" "))

    flg = 1

    try:


        while flg:

            data = input()

            array_temp = []

            if(data != ""):
                
                array_result.append(data.split(" "))

                flg = 1

            else:

                flg = 0
    finally:


        return array_result





arr_data = getinputdata()

n = int(arr_data[0][0])
a = int(arr_data[1][0])


print(n * n-a)

Submission status: Accepted

Solution code:
#-*- coding: utf-8 -*-
print(int(input())**2-int(input()))

Submission status: Accepted

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

# AtCoder Beginner Contest
# Problem A

if __name__ == '__main__':
    N = int(input())
    white_count = int(input())

    black_count = N ** 2 - white_count
    print(black_count)

Submission status: Accepted

Solution code:
import sys
import math
import collections
import itertools
import array
import inspect

# Set max recursion limit
sys.setrecursionlimit(10000)

# Debug output
def chkprint(*args):
    names = {id(v):k for k,v in inspect.currentframe().f_back.f_locals.items()}
    print(', '.join(names.get(id(arg),'???')+' = '+repr(arg) for arg in args))

# Binary converter
def to_bin(x):
    return bin(x)[2:]

# Set 2 dimension list
def dim2input(N):
    li = []
    for _ in range(N):
        li.append(input().split())
    return li

# --------------------------------------------

dp = None

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

    print(N*N - A)

main()

Submission status: Accepted

Solution code:
# coding: utf-8
# Your code here!
N = int(input())
A = int(input())
print(N ** 2 - A)

Submission status: Accepted

Solution code:
N = raw_input()
A = raw_input()

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

Submission status: Accepted

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

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**2 - B)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
print(eval(input()+"**2-"+input()))

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
# coding: utf-8

# 入力
n = int(input()) ** 2
a = int(input())

# 出力
print(n - a)

Submission status: Accepted

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

Submission status: Accepted

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

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

if __name__ == '__main__':
    main()

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

def main():
    """
    main.
    """
    ans = N ** 2 - A
    print(ans)

if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from sys import stdin

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

if __name__ == '__main__':
	n = int(input())
	a = int(input())

	mass = n * n

	print(mass - a)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import numpy as np

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

print(N**2 - A)

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

area = N * N
kuro = area - A 

print(kuro)

Submission status: Accepted

Solution code:
N = int(input())

A = int(input())

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

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())
m=int(input())
print(n*n-m)

Submission status: Accepted

Solution code:
#!/usr/bin/python3

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=input()
N=int(N)
A=input()
A=int(A)
print((N**2)-A)

Submission status: Accepted

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

Submission status: Accepted

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