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

Submission status: Accepted

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

Submission status: Accepted

Solution code:

input1 = int(input())
input2 = int(input())

print (input1*input1 - input2)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

print(n*n-x)

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:
def count_black(N, A):
    return N**2 - A

N = int(raw_input())
A = int(raw_input())

print(count_black(N, A))

Submission status: Accepted

Solution code:
#get input
N = int(input())
A = int(input())
#get the total 
N_Squares = N*N

W_Squares = N_Squares - A

print (W_Squares)

Submission status: Accepted

Solution code:
#Source code should be longer than 50 chars so I am writing this line
n=int(input())
a=int(input())
print((n*n)-a)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
if __name__ =='__main__':
    N = int(input())
    A = int(input())
    ans = N**2-A
    print(ans)

Submission status: Accepted

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

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
INF = float("inf")


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


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
a=int(input())
b=int(input())
z=a*a
ans=z-b
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())

A = int(input())


print(N * N - A)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#python3
#@author-SK13

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N = int(input())
A = int(input())
T = N ** 2 - A
if N<100 :
    print(T)
else :
    print(0)

Submission status: Accepted

Solution code:
N = int(input())
A = int(input())
T = N ** 2 - A
if N<=100 :
    print(T)
else :
    print(0)

Submission status: Accepted

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

Submission status: Accepted

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


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:
# -*- coding: utf-8 -*-
"""A - Bichrome Cells"""

n = int(raw_input())
a = int(raw_input())

print n * n - a

Submission status: Accepted

Solution code:
#入力
N = int(input())
A = int(input())
#ますの数を数える
N = N * N
#ますの数から白に塗る部分を引いて黒の文をだす
Black = N  - A
#出力
print(Black)

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

Submission status: Accepted

Solution code:
import sys

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

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

print(n * n - m)

Submission status: Accepted

Solution code:
import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,random,time,copy,functools

sys.setrecursionlimit(10**7)
inf = 10**20
eps = 1.0 / 10**10
mod = 10**9+7

def LI(): return [int(x) for x in sys.stdin.readline().split()]
def LI_(): return [int(x)-1 for x in sys.stdin.readline().split()]
def LF(): return [float(x) for x in sys.stdin.readline().split()]
def LS(): return sys.stdin.readline().split()
def I(): return int(sys.stdin.readline())
def F(): return float(sys.stdin.readline())
def S(): return input()


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

    return n**2 - a


print(main())

Submission status: Accepted

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

# Nの入力
n = int(input())
# 文字列の入力
a = int(input())

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
if __name__ == '__main__':
    N = input()
    A = 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:
#ABC074A
n=int(raw_input())
a=int(raw_input())
print n*n-a

Submission status: Accepted

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

Submission status: Accepted

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

print(N*N-A)

Submission status: Accepted

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

Submission status: Accepted

Solution code:

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

Submission status: Accepted

Solution code:
import sys

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

Submission status: Accepted

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

B = N ** 2 - A

print(B)

Submission status: Accepted

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

print(N**2-w)

Submission status: Accepted

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

Submission status: Accepted

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


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

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
def read_line(*types): return [f(a) for a, f in zip(input().split(), types)]

n, = read_line(int)
a, = read_line(int)


print(n * n - a)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n = int(input())
a = int(input())
check = n*n
black = check - 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(raw_input())
A=int(raw_input())

print N**2-A

Submission status: Accepted

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

Submission status: Accepted

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

print  n ** 2 - a

Submission status: Accepted

Solution code:
# coding: utf-8
# Here your code !
N=int(input().rstrip())
A=int(input().rstrip())
print((N**2)-A,flush=True)

Submission status: Accepted

Solution code:
def main():
    N = int(input())
    M = int(input())

    print (N**2-M)



if __name__ == "__main__":
    # global stime
    # stime = time.clock()
    main()

Submission status: Accepted

Solution code:
import sys

# sys.stdin = open('a1.in')


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


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


def read_int():
    return int(input())


def read_str():
    return input()


def main():
    n = read_int()
    a = read_int()
    res = n * n - a
    print(res)


main()

Submission status: Accepted

Solution code:
#!/user/bin/python
# coding: UTF-8

n = int(raw_input())
a = int(raw_input())

s = n*n - a

print s

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys

# utils
def read_numbers():
    return [int(num) for num in sys.stdin.readline().split()]
def read_string():
    return sys.stdin.readline().rstrip('\r\n')
def list2str(*array):
    return ' '.join([str(i) for i in array])

def main(N, A):
    return N*N - A

def parse_stdin():
    # N = read_numbers()
    # data = []
    # for i in range(N):
    #    data.append(read_numbers())
    N = read_numbers()[0]
    A = read_numbers()[0]
    return N, A

def test_main():
    """run pytest stdin.py to test"""
    #assert main([1,2], 'hi') == '3 hi'
    pass

if __name__ == '__main__':
    N, A = parse_stdin()
    result = main(N, A)
    print(result)

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

    print(N ** 2 - A)

if __name__ == '__main__':
    main()

Submission status: Accepted

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

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

main()

Submission status: Accepted

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

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

result = n * n - a
print(result)

Submission status: Accepted

Solution code:
number_of_test = int(input())
number_of_test2 = int(input())

print((number_of_test*number_of_test)-number_of_test2)

Submission status: Accepted

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

ans=N*N-A

print(ans)

Submission status: Accepted

Solution code:
#!/usr/bin/python

import sys

def main(argv):
    line = sys.stdin.readline()
    while line:
        N = int(line)
        A = int(sys.stdin.readline())
        print(N * N - A)

        line = sys.stdin.readline()

if __name__ == "__main__":
    main(sys.argv)

Submission status: Accepted

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

Submission status: Accepted

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

ans = N*N-A
print(ans)

Submission status: Accepted

Solution code:
use = int(input())
use1 = int(input())

print(use ** 2 - use1)

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#coding:utf-8

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

print(N * N - A)

Submission status: Accepted

Solution code:
def i1():
 return int(input())
def i2():
 return [int(i) for i in input().split()]

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
"""
https://beta.atcoder.jp/contests/abc074/tasks/abc074_a

"""
import sys
from sys import stdin
input = stdin.readline


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


if __name__ == '__main__':
    main(sys.argv[1:])

Submission status: Accepted

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

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

print(N**2-A)

Submission status: Accepted

Solution code:
# coding: utf-8

n = input()
a = input()

print n**2-a

Submission status: Accepted

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

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

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

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:
#!/usr/bin/env python
#-*- coding: utf-8 -*-

from collections import defaultdict
from math import factorial as f
from fractions import gcd as g

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

Submission status: Accepted

Solution code:
# coding: utf-8
def get_ln_inputs():
    return input().split()


def get_ln_int_inputs():
    return list(map(int, get_ln_inputs()))


def main():
    N = get_ln_int_inputs()[0]
    A = get_ln_int_inputs()[0]
    print(N * N - A)
    return


main()

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
a, b = map(int, input().split())
x = a * a
print(x - b)

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

get_colored_cells()

Submission status: Runtime Error

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

print(N**2 - A)

Submission status: Runtime Error

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

Submission status: Runtime Error

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

print(N ** 2 - A)

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
N, A = (int(x) for x in input().split())
ans = N**2 - A
print(ans)

Submission status: Runtime Error

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

Submission status: Runtime Error

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

# 処理
answer = n * n - a

# 出力
print(answer)

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
lines = []
while True:
   line=input()
   if line:
      lines.append(line)
   else:
      break
a, b = map(int, '\n'.join(lines).split())

ans1 = a*a
answer = ans1 - b
print(answer)

Submission status: Runtime Error

Solution code:
lines = []
while True:
   line=input()
   if line:
      lines.append(line)
   else:
      break
a, b = map(int,'\n'.join(lines).split())

ans1 = a**2
answer = ans1 - b
print(answer)

Submission status: Runtime Error

Solution code:
lines = []
while True:
   line=input()
   if line:
      lines.append(line)
   else:
      break
a, b = map(int,'\n'.join(lines).split())

ans1 = a**2
answer = ans1 - b

print(answer)

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
def solve():


    A, B, C, D, E, F = map(int, input().split())

    #memo
    list = {}

    #操作1-4
    ope1 = 100 * A
    ope2 = 100 * B
    ope3 = C
    ope4 = D


    for i in range(31):
        for j in range(31):
            for k in range(101):
                for l in range(101):
                    w_sum = i * ope1 + j * ope2
                    s_sum = k * ope3 + l * ope4
                    if w_sum == 0:
                        break
                    if w_sum+s_sum > F:
                        break
                    else:
                        if w_sum/100 * E >= s_sum:
                            p_tmp = (s_sum / (w_sum + s_sum)) * 100
                            list[i, j, k, l] = p_tmp

    max_v = max(list.values())

    for k, v in list.items():
        if v == max_v:
            print(ope1*k[0] + ope2*k[1] + ope3*k[2] + ope4*k[3], ope3*k[2] + ope4*k[3])

if __name__ == "__main__":
    solve()

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

print(n**2-a)

Submission status: Runtime Error

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

print(n*n-a)

Submission status: Runtime Error

Solution code:
print(eval(open(0).read().replace(' ','**2-')))

Submission status: Runtime Error

Solution code:
A, B, C, D, E, F = map(int, input().split())

#memo
list = [0, 0]

#操作1-4
ope1 = 100 * A
ope2 = 100 * B
ope3 = C
ope4 = D
#入れた水、砂糖の総量
w_sum = 0
s_sum = 0
#パーセンテージ
p = 0
#トータル
total = w_sum + s_sum
#砂糖の表示用の変数
s = 0

for i in range(101):
    for j in range(101):
        for k in range(31):
            for l in range(31):
                w_sum = l * ope1 + k * ope2
                s_sum = j * ope3 + i * ope4
                if w_sum != 0 and w_sum + s_sum <= F and s_sum <= E * (l + k) :
                    p_tmp = (s_sum / (w_sum + s_sum)) * 100
                    if p_tmp >= p:
                        p = p_tmp
                        list[0] = w_sum + s_sum
                        list[1] = s_sum

print(list[0], list[1])

Submission status: Runtime Error

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

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

print(n**2-a)

Submission status: Runtime Error

Solution code:
A, B, C, D, E, F = [int(_) for _ in input().split()]


def main(A, B, C, D, E, F):
    conc = -1
    ans = (1, 2)
    for na in range(F // (100 * A) + 1):
        for nb in range(F // (100 * B) + 1):
            if na == nb == 0:
                continue
            G = F - na * 100 * A - nb * 100 * B
            for nc in range(G // C + 1):
                for nd in range(G // D + 1):
                    W = na * 100 * A + nb * 100 * B + nc * C + nd * D
                    if 0 < W <= F and nc * C + nd * D <= E * (na * A + nb * B):
                        conc2 = 100 * (nc * C + nd * D) / W
                        if conc < conc2 <= 100 * E / (100 + E):
                            ans = (W, nc * C + nd * D)
                            conc = conc2
    return ans


print(*main(A, B, C, D, E, F))

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
import sys

args = sys.argv

print(int(args[0])*int(args[0]) - int(args[1]))

Submission status: Runtime Error

Solution code:
from itertools import product

A,B,C,D,E,F = map(int, input().split())
num_a = F // (100 * A)
num_b = F // (100 * B) 
num_c = int((F * E / (E + 100)) // C)
num_d = int((F * E / (E + 100)) // D)

def check_w(w_mizu, w_sato, F):
  return w_mizu + w_sato <= F

def check_tokeru(w_mizu, w_sato, E):
  return 100 * w_sato / (w_mizu + w_sato) <= 100 * E / (100 + E)

def culc_density(w_mizu, w_sato):
  return 100 * w_sato / (w_mizu + w_sato)

max = [0, 0, 0]  # total, sato, density
for _a, _b,  in product(range(num_a + 1), range(num_b + 1)): 
  w_mizu = (A * _a + B * _b) * 100
  if w_mizu == 0 or w_mizu >= F:
    continue
    
  for _c, _d in product(range(num_c + 1), range(num_d + 1)):
    w_sato = (C * _c + D * _d)
    if w_sato == 0 or w_sato >= F or (w_mizu + w_sato) > F:
      continue
    
    density = culc_density(w_mizu, w_sato)
  
    if check_w(w_mizu, w_sato, F) and check_tokeru(w_mizu, w_sato, E):
      if max[2] < density:
        max[0] = w_mizu + w_sato
        max[1] = w_sato
        max[2] = density

if max[0]:
  print(max[0], max[1])
else:
  print(F, 0)

Submission status: Runtime Error

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

Submission status: Runtime Error

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

print(a**2-b)

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
a,b,c,d,e,f=map(int,input().split())
def conc(water,sugar):
    return 100*sugar/(water+sugar)
lim=conc(100,e)
water=[]
for i in range(f//(100*a)+2):
    for j in range(f//(100*b)+2):
        if 0<100*a*i+100*b*j<f+1:
            water.append(100*a*i+100*b*j)
water=list(set(water))

sugar=[]
for i in range(f//c+2):
    for j in range(f//d+2):
        if c*i+d*j<f+1:
            sugar.append(c*i+d*j)
sugar=list(set(sugar))

tmp=0
tmpw=0
tmps=0
for w in water:
    for s in sugar:
        if 0<w+s<f+1 and tmp<conc(w,s)<=lim:
            tmp=conc(w,s)
            tmpw=w
            tmps=s

print(tmpw+tmps, tmps)

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
area = input() ** 2
while = input()
print(area - white)

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
# coding: utf-8

N=input()

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

Submission status: Runtime Error

Solution code:
# coding: utf-8

N=input()

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

Submission status: Runtime Error

Solution code:
# coding: utf-8

N=input()
A=input()

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

Submission status: Runtime Error

Solution code:
# coding: utf-8

N=input()
A=input()

print((N**2)-A)

Submission status: Runtime Error

Solution code:
# coding: utf-8

N=input()
A=input()

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

Submission status: Runtime Error

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

print((N**2)-A)

Submission status: Runtime Error

Solution code:
# coding: utf-8

N=input()
A=input()

print((N**2)-A)

Submission status: Runtime Error

Solution code:
A,B = map(int, input().split());

print(A*A-B)

Submission status: Runtime Error

Solution code:
A,B = map(input(), int);

print(A*A-B)

Submission status: Runtime Error

Solution code:
a,b,c,d,e,f=map(int,input().split())
a=100*a
b=100*b
dp1=[0]*(f+1)
dp2=[0]*(f+1)
for i in range(f+1):
    if i%a==0:
        if i+a<=f:
            dp1[i+a]=1
for i in range(f+1):
    if i==0 or dp1[i]==1:
        if i+b<=f:
            dp1[i+b]=1
for i in range(f+1):
    if i%c==0:
        if i+c<=f:
            dp2[i+c]=1
for i in range(f+1):
    if i==0 or dp2[i]==1:
        if i+d<=f:
            dp2[i+d]=1

ans=[-1,-1,-1]
for i in range(f+1):
    if dp1[i]==1:
        x=min(f-i,(i//100)*e)
        k=-1
        for j in range(x,-1,-1):
            if dp2[j]==1 or j==0:
                k=j
                if ans[0]<100*k/(i+k):
                    ans=[100*k/(i+k),i+k,k]
                break
print(str(ans[1])+" "+str(ans[2]))

Submission status: Runtime Error

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

Submission status: Runtime Error

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

print(N**2-A)

Submission status: Runtime Error

Solution code:
a,b = map(int, input().split())

print(a*a -b )

Submission status: Runtime Error

Solution code:
N = int(input())
K = int(input())
x = list(map(int,input().split()))
ans = 0
for i in range(N):
    ans += min(x[i],K-x[i])*2
print(ans)

Submission status: Runtime Error

Solution code:
def dense(a, b):
	return b / (a+b)

def resolve():
	a, b, c, d, e, f = map(int, input().split())
	ws = set()
	ss = set()
	for i in range(31):
		for j in range(31):
			if a*100*i + b*100*j <= f:
				ws.add(a*100*i + b*100*j)
	for i in range(3001):
		for j in range(3001):
			if c*i + j*d <= f:
				ss.add(c*i + j*d)
	ans_w, ans_s = -1, 0
	lim = e / (100+e)
	for wv in ws:
		for sv in ss:
			if wv + sv > f:
				continue
			if wv + sv == 0:
				continue
			if lim >= dense(wv, sv):
				if dense(ans_w, ans_s) <= dense(wv, sv):
					ans_w, ans_s = wv, sv
	print(ans_w + ans_s, ans_s)
resolve()

Submission status: Runtime Error

Solution code:
N=int(input())
K=int(input())
a=list(map(int,input().split()))
s=0
for i in range(len(a)):
  if a[i]<=K-a[i]:
    s=s+2*a[i]
  else:
    s=s+2*(K-a[i])
print(s)

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:

a, b = map(int, input().split())
A = 0

print(a * a - b)

Submission status: Runtime Error

Solution code:
A,B,C,D,E,F = map(int,input().split())
W=set()
for a in range(0,F+1,100*A):
    for b in range(0,F+1-a,100*B):
        W.add(a+b)
S=set()
for c in range(0,F+1,C):
    for d in range(0,F+1,D):
        S.add(c+d)
rate = -1
for w in W:
    for s in S:
        if 0 < w+s <= F and s <= w*E//100:
            if s/(w+s) > rate:
                rate = s/(w+s)
                ans = w+s, s
print(ans[0],ans[1])

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
A, B, C, D, E, F = map(int,input().split())
answer_number = [0,0,0,0]
answer_max = 0
for i in range((F//(100*A))+1):
  for j in range(((F-100*A*i)//(100*B))+1):
    if i==0 and j ==0: continue
    for k in range(((F-100*A*i-100*B*j)//C)+1):
      for l in range(((F-100*A*i-100*B*j-C*k)//D)+1):
        if (C*k+D*l)/(A*i+B*j) <= E:
          if (C*k+D*l)/(A*i+B*j) > answer_max:
            answer_max = (C*k+D*l)/(A*i+B*j)      #### k
            answer_number = [i,j,k,l]
if answer_number == [0,0,0,0]: print(0,0)
else:
  print(C*answer_number[2]+D*answer_number[3]+100*(A*answer_number[0]+B*answer_number[1]), C*answer_number[2]+D*answer_number[3])

Submission status: Runtime Error

Solution code:
A, B, C, D, E, F = map(int,input().split())
answer_number = [0,0,0,0]
answer_max = 0
for i in range((F/(100*A))+1):
  for j in range(((F-100*A*i)/(100*B))+1):
    if i==0 and j ==0: continue
    for k in range(((F-100*A*i-100*B*j)/C)+1):
      for l in range(((F-100*A*i-100*B*j-C*k)/D)+1):
        if (C*k+D*l)/(A*i+B*j) <= E:
          if (C*k+D*l)/(A*i+B*j) > answer_max:
            answer_max = (C*k+D*l)/(A*i+B*j)      #### k
            answer_number = [i,j,k,l]
if answer_number == [0,0,0,0]: print(0,0)
else:
  print(C*answer_number[2]+D*answer_number[3]+100*(A*answer_number[0]+B*answer_number[1]), C*answer_number[2]+D*answer_number[3])

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
a=[]
a.append(input())
print(a[0]**2-a[1])

Submission status: Runtime Error

Solution code:
import math

a=int(input("")).split("")
return (a[1]**2-a[0])

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
A,B,C,D,E,F=map(int,input().split())
wDP=[False]*(F+1)
wDP[0]=True
water=[]
for i in range(1,int(F/100)+1):
    if(i>=B and wDP[i-B]):
        wDP[i]=True
    elif(i>=A and wDP[i-A]):
        wDP[i]=True
for i in range(F+1):
    if(wDP[i] and i!=0):
        water.append(i*100)
A,B=A*100,B*100
water=list(set(water))
ans=[water[0],0]
mconc=0
for x in water:
    up=min(x*E//100,F-x)
    sDP=[0]*(up+1)
    for i in range(1,up+1):
        if(i>=D):
            sDP[i]=max(sDP[i-1],sDP[i-C]+C,sDP[i-D]+D)
        elif(i>=C):
            sDP[i]=max(sDP[i-1],sDP[i-C]+C)
        else:
            sDP[i]=sDP[i-1]
    conc=100*sDP[-1]/(x+sDP[-1])
    if(conc>=mconc):
        mconc=conc;ans[0]=x+sDP[-1];ans[1]=sDP[-1]
print(*ans)

Submission status: Runtime Error

Solution code:
n,a=map(int,input().split('/n'))
print((n**2) -a )

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
from scipy.misc import comb
import numpy as np
A,B=map(int,input().split())
print(int(np.round(comb(A,2))+np.round(comb(B,2))))

Submission status: Runtime Error

Solution code:
# 入力の取得
i = list(map(int, input().split()))
kazoeru = i[0]
ao = i[1]
aka= i[2]
kaisuu = i[0]/(i[1]+i[2])

answer = divmod(kazoeru, (i[1]+i[2]))

if ao == 0:
    print(0)
    exit()

#商の分を計算
aa = ao * answer[0]

#あまりの分を計算
if answer[1] == 0:
    print(aa)
    exit()

#あまり6で、青が6なら
# あまりが青より多いなら(あまり4、青2)
if answer[1] >= ao:
    aa += ao
#あまりが青より少ないなら(あまり1、青3)
else:
    aa += answer[1]
print(aa)