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

N_sq = N * N

black = N_sq - A

print(black)

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

print (n * n - a)

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

answer = (N * N) - A

print(answer)

Submission status: Accepted

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

answer=(N*N)-A

print(answer)

Submission status: Accepted

Solution code:
N = int(input())

A = int(input())

answer=(N*N)-A

print(answer)

Submission status: Accepted

Solution code:
def actual(N, A):
    return N ** 2 - A

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

Submission status: Accepted

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

print((N*N)-int(input()))

Submission status: Accepted

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

print(a**2 - b)

Submission status: Accepted

Solution code:
#!python3

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


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


if __name__ == "__main__":
    main()

Submission status: Accepted

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

ans = a*a-b
print(ans)

Submission status: Accepted

Solution code:
import sys
import heapq
import re
from heapq import heapify, heappop, heappush
from itertools import permutations
from bisect import bisect_left, bisect_right
from collections import Counter, deque
from fractions import gcd
from math import factorial, sqrt, ceil
from functools import lru_cache, reduce
INF = 1 << 60
MOD = 1000000007
sys.setrecursionlimit(10 ** 7)

# UnionFind
class UnionFind():
    def __init__(self, n):
        self.n = n
        self.parents = [-1] * n

    def find(self, x):
        if self.parents[x] < 0:
            return x
        else:
            self.parents[x] = self.find(self.parents[x])
            return self.parents[x]

    def union(self, x, y):
        x = self.find(x)
        y = self.find(y)

        if x == y:
            return

        if self.parents[x] > self.parents[y]:
            x, y = y, x

        self.parents[x] += self.parents[y]
        self.parents[y] = x

    def size(self, x):
        return -self.parents[self.find(x)]

    def same(self, x, y):
        return self.find(x) == self.find(y)

    def members(self, x):
        root = self.find(x)
        return [i for i in range(self.n) if self.find(i) == root]

    def roots(self):
        return [i for i, x in enumerate(self.parents) if x < 0]

    def group_count(self):
        return len(self.roots())

    def all_group_members(self):
        return {r: self.members(r) for r in self.roots()}

    def __str__(self):
        return '\n'.join('{}: {}'.format(r, self.members(r)) for r in self.roots())

# ダイクストラ
def dijkstra_heap(s, edge, n):
    #始点sから各頂点への最短距離
    d = [10**20] * n
    used = [True] * n #True:未確定
    d[s] = 0
    used[s] = False
    edgelist = []
    for a,b in edge[s]:
        heapq.heappush(edgelist,a*(10**6)+b)
    while len(edgelist):
        minedge = heapq.heappop(edgelist)
        #まだ使われてない頂点の中から最小の距離のものを探す
        if not used[minedge%(10**6)]:
            continue
        v = minedge%(10**6)
        d[v] = minedge//(10**6)
        used[v] = False
        for e in edge[v]:
            if used[e[1]]:
                heapq.heappush(edgelist,(e[0]+d[v])*(10**6)+e[1])
    return d

# 素因数分解
def factorization(n):
    arr = []
    temp = n
    for i in range(2, int(-(-n**0.5//1))+1):
        if temp%i==0:
            cnt=0
            while temp%i==0:
                cnt+=1
                temp //= i
            arr.append([i, cnt])

    if temp!=1:
        arr.append([temp, 1])

    if arr==[]:
        arr.append([n, 1])

    return arr

# 2数の最小公倍数
def lcm(x, y):
    return (x * y) // gcd(x, y)

# リストの要素の最小公倍数
def lcm_list(numbers):
    return reduce(lcm, numbers, 1)

# リストの要素の最大公約数
def gcd_list(numbers):
    return reduce(gcd, numbers)

# 素数判定
def is_prime(n):
    if n <= 1:
        return False
    p = 2
    while True:
        if p ** 2 > n:
            break
        if n % p == 0:
            return False
        p += 1
    return True


# limit以下の素数を列挙
def eratosthenes(limit):
    A = [i for i in range(2, limit+1)]
    P = []

    while True:
        prime = min(A)
        
        if prime > sqrt(limit):
            break
            
        P.append(prime)
            
        i = 0
        while i < len(A):
            if A[i] % prime == 0:
                A.pop(i)
                continue
            i += 1
            
    for a in A:
        P.append(a)
            
    return P

# 同じものを含む順列
def permutation_with_duplicates(L):

    if L == []:
        return [[]]

    else:
        ret = []

        # set（集合）型で重複を削除、ソート
        S = sorted(set(L))

        for i in S:

            data = L[:]
            data.remove(i)

            for j in permutation_with_duplicates(data):
                ret.append([i] + j)

        return ret

# ここから書き始める
n = int(input())
a = int(input())
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, A= int(input()),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:
import sys

input = sys.stdin.readline


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

    ans = N ** 2 - A

    print(ans)


if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
n,a=map(int,open(0));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 math

a=int(input())
b=int(input())
ans=a*a-b
print(ans)

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=int(input())
A=int(input())

print(N**2-A)

Submission status: Accepted

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

Submission status: Accepted

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

count_black = n ** 2 - a

print(count_black)

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

Submission status: Accepted

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

print(a**2 -b)

Submission status: Accepted

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

Submission status: Accepted

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

print(n*n -k)

Submission status: Accepted

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

import sys
# import time
# import math
# import numpy as np
# import scipy.sparse.csgraph as cs            # csgraph_from_dense(ndarray, null_value=inf), bellman_ford(G, return_predecessors=True), dijkstra, floyd_warshall
# import random                                # random, uniform, randint, randrange, shuffle, sample
# import string                                # ascii_lowercase, ascii_uppercase, ascii_letters, digits, hexdigits
# import re                                    # re.compile(pattern) => ptn obj; p.search(s), p.match(s), p.finditer(s) => match obj; p.sub(after, s)
# from bisect import bisect_left, bisect_right # bisect_left(a, x, lo=0, hi=len(a)) returns i such that all(val<x for val in a[lo:i]) and all(val>-=x for val in a[i:hi]).
# from collections import deque                # deque class. deque(L): dq.append(x), dq.appendleft(x), dq.pop(), dq.popleft(), dq.rotate()
# from collections import defaultdict          # subclass of dict. defaultdict(facroty)
# from collections import Counter              # subclass of dict. Counter(iter): c.elements(), c.most_common(n), c.subtract(iter)
# from datetime import date, datetime          # date.today(), date(year,month,day) => date obj; datetime.now(), datetime(year,month,day,hour,second,microsecond) => datetime obj; subtraction => timedelta obj
# from datetime.datetime import strptime       # strptime('2019/01/01 10:05:20', '%Y/%m/%d/ %H:%M:%S') returns datetime obj
# from datetime import timedelta               # td.days, td.seconds, td.microseconds, td.total_seconds(). abs function is also available.
# from copy import copy, deepcopy              # use deepcopy to copy multi-dimentional matrix without reference
# from functools import reduce                 # reduce(f, iter[, init])
# from functools import lru_cache              # @lrucache ...arguments of functions should be able to be keys of dict (e.g. list is not allowed)
# from heapq import heapify, heappush, heappop # built-in list. heapify(L) changes list in-place to min-heap in O(n), heappush(heapL, x) and heappop(heapL) in O(lgn).
# from heapq import nlargest, nsmallest        # nlargest(n, iter[, key]) returns k-largest-list in O(n+klgn).
# from itertools import count, cycle, repeat   # count(start[,step]), cycle(iter), repeat(elm[,n])
# from itertools import groupby                # [(k, list(g)) for k, g in groupby('000112')] returns [('0',['0','0','0']), ('1',['1','1']), ('2',['2'])]
# from itertools import starmap                # starmap(pow, [[2,5], [3,2]]) returns [32, 9]
# from itertools import product, permutations  # product(iter, repeat=n), permutations(iter[,r])
# from itertools import combinations, combinations_with_replacement
# from itertools import accumulate             # accumulate(iter[, f])
# from operator import itemgetter              # itemgetter(1), itemgetter('key')
# from fractions import gcd                    # for Python 3.4 (previous contest @AtCoder)



def main():
    mod = 1000000007                # 10^9+7
    inf = float('inf')              # sys.float_info.max = 1.79...e+308
    # inf = 2 ** 64 - 1             # (for fast JIT compile in PyPy) 1.84...e+19
    sys.setrecursionlimit(10**6)    # 1000 -> 1000000
    def input(): return sys.stdin.readline().rstrip()
    def ii():    return int(input())
    def mi():    return map(int, input().split())
    def mi_0():  return map(lambda x: int(x)-1, input().split())
    def lmi():   return list(map(int, input().split()))
    def lmi_0(): return list(map(lambda x: int(x)-1, input().split()))
    def li():    return list(input())
    
    
    n = ii()
    a = ii()
    print(n**2 - a)


if __name__ == "__main__":
    main()

Submission status: Accepted

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

print(-A+N**2)

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

Submission status: Accepted

Solution code:
def li():
    return list(map(int, input().split()))
def mi():
    return map(int, input().split())
def ii():
    return int(input())

N = ii()
A = ii()

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

n, a = [int(readline()) for _ in range(2)]
print(n**2 - a)

Submission status: Accepted

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

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

tmp = N**2-A

if tmp >= 0:
    print(tmp)
else:
    print(N**2)

Submission status: Accepted

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

print(n * n - a)

Submission status: Accepted

Solution code:
# -*- coding: <encode name> -*-

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

Submission status: Accepted

Solution code:
import sys
                                  
m = int(sys.stdin.readline())     
n = int(sys.stdin.readline())     
                                  
a = m * m - n                     
print(a)

Submission status: Accepted

Solution code:
def i():
	return int(input())
def i2():
	return map(int,input().split())
def s():
	return str(input())
def l():
	return list(input())
def intl():
	return list(int(k) for k in input().split())
n = i()
a = i()
print( n**2 - a)

Submission status: Accepted

Solution code:
import sys

sys.setrecursionlimit(10 ** 7)
f_inf = float('inf')
mod = 10 ** 9 + 7


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

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


if __name__ == '__main__':
    resolve()

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
"""
Created on Thu May 14 11:24:50 2020

@author: shinba
"""

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

print(n**2-a)

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
N, A = map(int, open(0))  # n行
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())
A=int(input())
print (N*N-A)

Submission status: Accepted

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

x = n*n-a
print(x)

Submission status: Accepted

Solution code:
import sys
import math
import bisect

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

Submission status: Accepted

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

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

Submission status: Accepted

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


if __name__ == "__main__":
    main()

Submission status: Accepted

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

print(N**2 -A)

Submission status: Accepted

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

if __name__ == '__main__':

    ABC_74_A()

Submission status: Accepted

Solution code:
# region header
import sys
import math
from bisect import bisect_left, bisect_right, insort_left, insort_right
from collections import defaultdict, deque, Counter
from copy import deepcopy
from fractions import gcd
from functools import lru_cache, reduce
from heapq import heappop, heappush
from itertools import accumulate, groupby, product, permutations, combinations, combinations_with_replacement
from math import ceil, floor, factorial, log, sqrt, sin, cos
from operator import itemgetter
from string import ascii_lowercase, ascii_uppercase, digits
sys.setrecursionlimit(10**7)
rs = lambda: sys.stdin.readline().rstrip()
ri = lambda: int(rs())
rf = lambda: float(rs())
rs_ = lambda: [_ for _ in rs().split()]
ri_ = lambda: [int(_) for _ in rs().split()]
rf_ = lambda: [float(_) for _ in rs().split()]
INF = float('inf')
MOD = 10 ** 9 + 7
PI = math.pi
# endregion
N = ri()
A = ri()
print(N ** 2 - A)

Submission status: Accepted

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

Submission status: Accepted

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

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
a,b=map(int,open(0));print(a**2-b)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

print(N**2 - A)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
import itertools
sys.setrecursionlimit(1000000000)
from heapq import heapify,heappop,heappush,heappushpop
import math
import collections

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians
from itertools import accumulate, permutations, combinations, product, groupby
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from bisect import bisect, bisect_left
from fractions import gcd
from heapq import heappush, heappop
from functools import reduce
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()))
def ZIP(n): return zip(*(MAP() for _ in range(n)))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7

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

Submission status: Accepted

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

masu = n ** 2

print(masu - a)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#-------------------------------------------------------------------------------
# Name:        module1
# Purpose:
#
# Author:      paulr
#
# Created:     30/04/2020
# Copyright:   (c) paulr 2020
# Licence:     <your licence>
#-------------------------------------------------------------------------------

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

N=n*n

ans=N-a

print(ans)

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

Submission status: Accepted

Solution code:
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10**7)
from collections import Counter, deque
from collections import defaultdict
from itertools import combinations, permutations, accumulate, groupby, product
from bisect import bisect_left,bisect_right
from heapq import heapify, heappop, heappush
from math import floor, ceil
from operator import itemgetter
def I(): return int(input())
def MI(): return map(int, input().split())
def LI(): return list(map(int, input().split()))
def LI2(): return [int(input()) for i in range(n)]
def MXI(): return [[LI()]for i in range(n)]
inf = 10**17
mod = 10**9 + 7

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from sys import stdin

def main():
    n = int(stdin.readline())
    w = int(stdin.readline())

    print(n ** 2 - w)

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, a = [int(input()) for _ in range(2)]
print(n**2-a)

Submission status: Accepted

Solution code:
import sys
import heapq, math
from itertools import zip_longest, permutations, combinations, combinations_with_replacement
from itertools import accumulate, dropwhile, takewhile, groupby
from functools import lru_cache
from copy import deepcopy

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:

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


if '__main__' == __name__:
    resolve()

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
import os

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

if __name__ == "__main__":
        main()

Submission status: Accepted

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

print(a*a -b)

Submission status: Accepted

Solution code:
import sys

lines = sys.stdin.readlines()

N = int(lines[0])
A = int(lines[1])

print(N ** 2 -A)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#!/usr/local/bin python
# -*- coding: utf-8 -*-
#
# ~/PycharmProjects/atcoder/A-BichromeCells.py
#
n = int(input())
a = int(input())

print(n**2 - a)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
# coding: utf-8
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())
x=N**2-a
print(x)

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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:
# coding: utf-8
N = int(input())
A = int(input())
ans = N * N - A
print(ans)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import math
import string
import collections
from collections import Counter


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


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


def has_duplicates2(seq):
    seen = []
    for item in seq:
        if not(item in seen):
            seen.append(item)
    return len(seq) != len(seen)


def divisor(n):
    divisor = []
    for i in range(1, n+1):
        if n % i == 0:
            divisor.append(i)
    return divisor


# coordinates
dx = [-1, -1, -1, 0, 0, 1, 1, 1]
dy = [-1, 0, 1, -1, 1, -1, 0, 1]

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

Submission status: Accepted

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

answer = (N * N) - A

print(answer)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys

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

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

if __name__ ==  '__main__':
    main()

Submission status: Accepted

Solution code:
# ABC 074: A – Bichrome Cells
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*N -A )

Submission status: Accepted

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

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

    print(a*a-b)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import math
n=int(input())
a=int(input())
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)


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

Submission status: Accepted

Solution code:
import math

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

print(N*N-A)

Submission status: Accepted

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

i = n*n

print(i-a)

Submission status: Accepted

Solution code:
N, A = [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:
# Author: cr4zjh0bp
# Created: Sat Mar 14 11:44:01 UTC 2020
import sys
 
stdin = sys.stdin
inf = 1 << 60
mod = 1000000007
 
ni = lambda: int(ns())
nin = lambda y: [ni() for _ in range(y)]
na = lambda: list(map(int, stdin.readline().split()))
nan = lambda y: [na() for _ in range(y)]
nf = lambda: float(ns())
nfn = lambda y: [nf() for _ in range(y)]
nfa = lambda: list(map(float, stdin.readline().split()))
nfan = lambda y: [nfa() for _ in range(y)]
ns = lambda: stdin.readline().rstrip()
nsn = lambda y: [ns() for _ in range(y)]
ncl = lambda y: [list(ns()) for _ in range(y)]
nas = lambda: stdin.readline().split()

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

Submission status: Accepted

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

print(n*n-a)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#pypyは内包表記使わない
def main():
    import sys
    #input = sys.stdin.readline
    sys.setrecursionlimit(10000000)
    from collections import Counter, deque
    #from collections import defaultdict
    from itertools import combinations, permutations
    #from itertools import accumulate, product
    from bisect import bisect_left,bisect_right
    from math import floor, ceil
    #from operator import itemgetter

    #mod = 1000000007

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

if __name__ == '__main__':
    main()

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

Submission status: Accepted

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