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

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

Submission status: Wrong Answer

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

print(n - w)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

print(n-a)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
19
100

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

T = 1
for i in A:
    T = T * i
    if T > 10**18:
        print(-1)
    else:
        print(T)

Submission status: Wrong Answer

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

tmp = N**2-A

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
S=input()
#print(S)
count=0
for s in S:
    if s == "0":
        count+=1
    else:
        count+=0
print(count)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import math
r = input()

print(round(math.pi * 2.0 * float(r),4))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import sys

lines = sys.stdin.readlines()

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

print(N^2-A)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
N = int(input())

sum = 0
flag = 0


a = int(N / 7)
re = N % 7

if re == 0:
    print('Yes')
    flag += 1
else:
    for i in range(a+1):
        sum = 7 * i
#        print(sum)
        while sum<N:
            sum += 4
#            print(sum)
            if sum == N:
                print('Yse')
                flag += 1
        if flag == 1:
            break

if flag == 0:
    print('No')

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
_, k, *x = map(int, open(0).read().split())
print(sum(min(i, k-i) for i in x)*2)

Submission status: Wrong Answer

Solution code:
a = input("")
a = float(a)
b = input("")
b = float(b)
print(str(a**2-b))

Submission status: Wrong Answer

Solution code:
X = input()
if X == "A":
  print(1)
elif X == "B":
  print(2)
elif X == "C":
  print(3)
elif X == "D":
  print(4)
else:
  print(5)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

print(n**n - a)

Submission status: Wrong Answer

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

print(n * 2 - a)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import sys
import math
n=int(input())

b=n
a=[]
N=math.sqrt(n)

for i in range(1,10):
  for j in range(1,10):
      if(i*j==n):
          print ("Yes")
          sys.exit()

print ("No")

Submission status: Wrong Answer

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

print(a^2 - b)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
3
4

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

print((N*2)-A)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
#from numpy import*
from scipy.sparse.csgraph import shortest_path #shortest_path(csgraph=graph)
#from scipy.sparse.csgraph import dijkstra
from scipy.sparse import csr_matrix

from collections import* #defaultdict Counter deque appendleft
from fractions import gcd
from functools import* #reduce
from itertools import* #permutations("AB",repeat=2) combinations("AB",2) product("AB",2) groupby accumulate
from operator import mul,itemgetter
from bisect import* #bisect_left bisect_right
from heapq import* #heapify heappop heappushpop
from math import factorial,pi
from copy import deepcopy
import sys
#input=sys.stdin.readline  #危険！基本オフにしろ！
sys.setrecursionlimit(10**8)


def main():
    n=int(input())
    grid=[list(map(int,input().split()))for i in range(n)]
    p=shortest_path(csgraph=csr_matrix(grid))
    q=[list(i) for i in p]
    
    if q!=grid:
        print(-1)
    else:
        for i in range(n):
            p[i][i]=float("inf")
        ans=0
        P=[min(p[i])for i in range(n)]
#        print(p)
        for i in range(n):
            for j in range(i):
                if i==j:
                    continue
                if p[i][j]<P[i]+P[j]:
                    
                    ans+=p[i][j]
        print(int(ans))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

print(n**2 - 1)

Submission status: Wrong Answer

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

print(N-A)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
one_side=input("一辺のマスの数:")
oneside=int(one_side)
whole=oneside**2
white_side=input("白色のマスの数:")
whiteside=int(white_side)
print(whole-whiteside)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

print(n**2-4)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
n = int(input())
a = int(input())
ans = pow(n,2)-a
if ans <= 0:
    print(pow(n,2))
else:
    print(ans)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

print(n*2-a)

Submission status: Wrong Answer

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

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

    print(n ** n - a)

if __name__ == '__main__':
    main()

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import numpy as np

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

print(N*2 - A)

Submission status: Wrong Answer

Solution code:
import math

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

h = a // n
w = a % n

if (h + w) % 2 == 0:
    print( math.ceil(n*n / 2) )
else:
    print( n*n // 2 )

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

print(N * 2 - A)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
a = int(raw_input())
b = int(raw_input())
print str(a^a - b)

Submission status: Wrong Answer

Solution code:
# -*- coding: utf-8 -*-
# 整数の入力
a = int(raw_input())
# スペース区切りの整数の入力
b = int(raw_input())
# 文字列の入力
# 出力
print str(a^a - b)

Submission status: Wrong Answer

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

print ((n * n) - a)

Submission status: Wrong Answer

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

S = N * N

ANS = N - S
ANS = abs(ANS)

print (ANS)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
value_list = []
number_of_test = int(input())
number_of_test2 = int(input())

print((number_of_test*number_of_test)-number_of_test)

Submission status: Time Limit Exceeded

Solution code:
while True:
  pass

Submission status: Accepted

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

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

Submission status: Accepted

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

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

print(n*n - 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:
print((int(input()) ** 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:
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:
# 074_a
N=int(input())
A=int(input())
sum=N*N
if (1<=N and N<=100) and (0<=A and A<=N**N):
    print(sum-A)

Submission status: Accepted

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

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

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

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(max(N*N-A,0))

Submission status: Accepted

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

print(n * n - a)

Submission status: Accepted

Solution code:
with open(0) as f:
    n, a = map(int, f.read().split())
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:
N=int(input())
A=int(input())
print(N*N-A)

Submission status: Accepted

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

Submission status: Accepted

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

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

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

readline = sys.stdin.readline
MOD = 10 ** 9 + 7
INF = float('INF')
sys.setrecursionlimit(10 ** 5)


def main():
    N = int(readline())
    A = int(readline())
    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:
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:
a=int(input())
b=int(input())
print(a**2-b)

Submission status: Accepted

Solution code:
# A - Bichrome Cells
# https://atcoder.jp/contests/abc074/tasks/abc074_a

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

i = N * N
result = i - A

print(result)

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

print( (N ** 2 ) - A)

Submission status: Accepted

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

Submission status: Accepted

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

print(N ** 2 - A)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# N×Nのマス目のうちAマスを塗った残りのマス数

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

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

Submission status: Accepted

Solution code:
# N × N のマス目があります。
# このマス目の各マスを白色または黒色に塗ることにしました
# (すべてのマスをどちらか片方の色に塗ります)。
#
# ちょうど Aマスを白色に塗るとき、
# 黒色に塗ることになるマスはいくつあるでしょうか。

# 制約
# 1 ≦ N ≦ 100
# 0 ≦ A ≦ Nの2乗

# 標準入力から N, A の値を取得する
n = int(input())
a = int(input())

# 計算結果を出力する
result = (n * n) - a

print(result)

Submission status: Accepted

Solution code:
# A - Bichrome Cells

# N*Nのマス目があり、Aマスを白に塗った場合、残りは何マスか


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

Submission status: Accepted

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

if n ** 2 - a < 0:
    print(0)
else:
    print(n ** 2 - a)

Submission status: Accepted

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

y = n * n
x = y - a

print(x)

Submission status: Accepted

Solution code:
# 入力
N = int(input())
A = int(input())

# Nの2乗ひくA
answer = N ** 2 - A

# 出力
print(answer)

Submission status: Accepted

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

print(N * N - A)

Submission status: Accepted

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

get_colored_cells()

Submission status: Accepted

Solution code:
#   AtCoder abc074 a
#   ストレッチ課題

#   入力
n = int(input())
white = int(input())

#   処理
black = n ** 2 - white

#   出力
print(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())

# 処理
answer = N ** 2 - A

# 出力
print(answer)

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

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

# N×Nのマス目があります
N *= N

# Aマスを白色に塗るとき、黒色に塗ることになるマスはいくつあるか出力
B = N - A
print(B)

Submission status: Accepted

Solution code:
# 074a

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

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

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())
Total = N ** 2

# 黒色に塗るマス数を計算して出力
Black = Total - A
print(Black)

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

N *= N
B = N - A

print(B)

Submission status: Accepted

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

print(N*N - A)

Submission status: Accepted

Solution code:
# Nのますめと白に塗ったマス目Aを整数で入力
N = int(input())
A = int(input())
# N*NマスからAマス塗ったを余りを出力
print(N**2 - A)

Submission status: Accepted

Solution code:
S_list = [int(input()) for i in range(2)]

print(S_list[0]**2 - S_list[1])

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# A - Bichrome Cells

# N * N のマス目がある。
# このマス目の各マスを白色または黒色に塗ることにしました (すべてのマスをどちらか片方の色に塗ります)
# ちょうど  A マスを白色に塗るとき、黒色に塗ることになるマスはいくつあるでしょうか。

# 黒色に塗ることになるマスの個数を出力

# 標準入力 N
N = int(input())

# 標準入力 A
A = int(input())
# print(N, A)

# マス数を計算
square_num = N * N
# print(square_num)

# 黒色に塗るマスの量を計算
answer = square_num - A

# 結果を出力
print(answer)

Submission status: Accepted

Solution code:
# 入力
# n, a = map(int, input().split())
n = int(input())
a = int(input())

# 処理
answer = n * n - a

# 出力
print(answer)

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n_line = int(input())
num_a_painted_white = int(input())

total_space = n_line * n_line
num_a_painted_black = total_space - num_a_painted_white

print(num_a_painted_black)

Submission status: Accepted

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

print(N ** 2 -A)

Submission status: Accepted

Solution code:
import sys
input = lambda: sys.stdin.readline().rstrip() 
sys.setrecursionlimit(10**7)
INF = 10**20
def I(): return int(input())
def F(): return float(input())
def S(): return input()
def LI(): return [int(x) for x in input().split()]
def LI_(): return [int(x)-1 for x in input().split()]
def LF(): return [float(x) for x in input().split()]
def LS(): return input().split()

def resolve():
    N = I()
    A = I()

    print(N ** 2 - A)

if __name__ == '__main__':
    resolve()

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

print(n ** 2 - w)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
sys.setrecursionlimit(4100000)
import math
import itertools
INF = float('inf')
from heapq import heapify, heappop, heappush

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

Submission status: Accepted

Solution code:
N,A = (int(input()) for T in range(0,2))
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(int((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())

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


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


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*N-A)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys, re
from math import ceil, floor, sqrt, pi, factorial, gcd
from copy import deepcopy
from collections import Counter, deque
from heapq import heapify, heappop, heappush
from itertools import accumulate, product, combinations, combinations_with_replacement
from bisect import bisect, bisect_left, bisect_right
from functools import reduce
from decimal import Decimal, getcontext
# input = sys.stdin.readline 
def i_input(): return int(input())
def i_map(): return map(int, input().split())
def i_list(): return list(i_map())
def i_row(N): return [i_input() for _ in range(N)]
def i_row_list(N): return [i_list() for _ in range(N)]
def s_input(): return input()
def s_map(): return input().split()
def s_list(): return list(s_map())
def s_row(N): return [s_input for _ in range(N)]
def s_row_str(N): return [s_list() for _ in range(N)]
def s_row_list(N): return [list(s_input()) for _ in range(N)]
def lcm(a, b): return a * b // gcd(a, b)
sys.setrecursionlimit(10 ** 6)
INF = float('inf')
MOD = 10 ** 9 + 7
num_list = []
str_list = []

def main():
    n = i_input()
    a = i_input()

    print(n*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())
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:
print(eval(input()+'**2-'+input()))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
def input(): return sys.stdin.readline().strip()

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())
#a, b = map(int,input().split())
#l = list(map(int,input().split()))
#l = [list(map(int,input().split())) for i in range(n)]
print(n**2 - a)

Submission status: Accepted

Solution code:
# # Make IO faster
# import sys
# input = sys.stdin.readline

# # get single (or) multiple str
# X = input()

# # get single int
# N = int(input())
# # get multiple int (e.g., 2)
# X, Y = map(int, input().split())
# # get multiple int (e.g., 2) for N lines
# XY = [list(map(int, input().split())) for _ in range(N)]

# from IPython import embed; embed(); exit();

# 全部入り
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
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
import numpy as np
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 * N - A)

Submission status: Accepted

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

Submission status: Accepted

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


if __name__ == "__main__":
    solve()

Submission status: Accepted

Solution code:
import bisect,collections,copy,heapq,itertools,math,string
import sys
def S(): return sys.stdin.readline().rstrip()
def M(): return map(int,sys.stdin.readline().rstrip().split())
def I(): return int(sys.stdin.readline().rstrip())
def LI(): return list(map(int,sys.stdin.readline().rstrip().split()))
def LS(): return list(sys.stdin.readline().rstrip().split())
N = I()
A = I()
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**2-b)

Submission status: Accepted

Solution code:
import sys

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


def main():
    N, A = map(int, read().split())

    print(N * N - A)

    return


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
import sys
read=sys.stdin.read

n,a=map(int,read().splitlines())

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

Submission status: Accepted

Solution code:
# coding: utf-8
import math
#a, b, c = map(int,input().split())
N = int(input())
K = int(input())
#S = input()
ans = 1
#l = list(map(int,input().split()))
print(N**2-K)

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
def I(): return int(sys.stdin.readline().rstrip())

print(I()**2-I())

Submission status: Accepted

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

Submission status: Accepted

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

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:
N, A = [int(input()) for i in range(2)]
print(pow(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())
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:
def resolve():
    n = int(input())
    a = int(input())
    ans = n*n - a
    print(ans)
resolve()

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

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

ans = N * N - A

print(ans)

Submission status: Accepted

Solution code:
# X, t = map(int, input().split())
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())
a=int(input())
pixel=n**2
print(pixel-a)

Submission status: Accepted

Solution code:
def bichromeCells(n, a):
    return n*n -a


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

main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

if N < 1 or N > 100:
    sys.exit()
if A < 0 or A > N ** 2:
    sys.exit()

print(N ** 2 - A)

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())
X=N*N

print(X-A)