Problem:


Score : 100 points

Problem Statement

Given an integer a as input, print the value a + a^2 + a^3.

Constraints

1 \leq a \leq 10

a is an integer.

Input

Input is given from Standard Input in the following format:

a

Output

Print the value a + a^2 + a^3 as an integer.

Sample Input 1

2

Sample Output 1

14

When a = 2, we have a + a^2 + a^3 = 2 + 2^2 + 2^3 = 2 + 4 + 8 = 14.

Print the answer as an input. Outputs such as 14.0 will be judged as incorrect.

Sample Input 2

10

Sample Output 2

1110



Sample input:
2


Sample output:
14

Submission status: Runtime Error

Solution code:
n,m,k=map(int,input().split())
x=[int(x) for x in input().split()]
y=[int(x) for x in input().split()]
c=0
cost=0
f,t=0,0
x.sort()
y.sort()
for i in range(n):
    if i<n and cost<k and cost+x[i]<=k and f==0:
        cost+=x[i]
        c+=1
    else:f=1
    if i<m and  cost<k and cost+y[i]<=k and t==0:
        cost+=y[i]
        c+=1
    else:t=1
i+=1
if m>n and t==0:
    while(i<(m)):
        if cost+y[i]<=k and cost<k:
            cost+=y[i]
            c+=1
        i+=1
c1=0
cost=0
for i in range(n):
    if cost+x[i]<=k:
        cost+=x[i]
        c1+=1
c2=0
cost=0
for i in range(m):
    if cost+y[i]<=k:
        cost+=y[i]
        c2+=1
print(max(c1,c2,c))

Submission status: Runtime Error

Solution code:
N, M, K= map(int, input().split())
A = list(map(int, input().split()))
B = list(map(int, input().split()))
t = 0
n = 0
a = 0
b = 0
 
while K > t :
    if a < N and b < M :
        if A[a] <= B[b] :
            t += A[a]
            n += 1
            a += 1
            if K < t :
                n -=1
                break
 
        else :
            t +=B[b]
            n += 1
            b += 1
            if K < t :
                n -=1
                break
    
    elif a == N :
        while b < M :
            t += B[b]
            n += 1
            b += 1
            if K < t :
                n -=1
                break
        
        else :
            break
 
    else :
        while a < N :
            t += A[a]
            n += 1
            a += 1
            if K < t :
                n -=1
                break
 
print(n)

Submission status: Runtime Error

Solution code:
[N,M,K]=map(int,(input().split()))
A=[0]*N
B=[0]*M
A=list(map(int,input().split()))
B=list(map(int,input().split()))



Kc=K
bookc=0

Ai=0
Bi=0

while Kc>0:
    if Ai<N:
        if Bi<M:
            if A[Ai]<=B[Bi] and A[Ai]<=Kc:
                bookc+=1
                Kc-=A[Ai]
                Ai+=1

            elif B[Bi]<=Kc:
                bookc+=1
                Kc-=B[Bi]
                Bi+=1
            else:
                break
        elif A[Ai]<=Kc:
            bookc+=1
            Kc-=A[Ai]
            Ai+=1
        else:
            break
    elif Bi<M:
        if B[Bi]<=Kc:
            bookc+=1
            Kc-=B[Bi]
            Bi+=1
        else:
            break
    if Ai==N and Bi==M:
        break

print(bookc)

Submission status: Runtime Error

Solution code:
import math
n,m,k = map(int,input().split())
a = list(map(int,input().split()))
b = list(map(int,input().split()))
a.append(10**10)
b.append(10**10)

if a[0]>k and b[0]>k:
  print(0)
else:
  if sum(a)+sum(b)<=k:
    print(n+m)
  else:
    ans=0
    time=0
    for i in range(n+m):
      ans += 1    
      if a[0]<=b[0]:
        time+=a.pop(0)
      else:
        time+=b.pop(0)
      
      if time>k:
        break
    print(ans-1)

Submission status: Runtime Error

Solution code:
from collections import deque

N, M, K = [int(x) for x in input().split()]

a_book = [0]
for index, i in enumerate(input().split(), 1):
    a_book.append(a_book[index-1] + int(i))

b_book = [0]
for index, i in enumerate(input().split(), 1):
    b_book.append(b_book[index-1] + int(i))

search = deque()
check = {}


def search_count(v):
    search.appendleft(v)
    while search:
        v = search.popleft()

        if not v in check:
            check[v] = v[0] + v[1]

            if not (v[0] + 1, v[1]) in check:
                if v[0] + 1 <= N:
                    if a_book[v[0] + 1] + b_book[v[1]] <= K:
                        search.appendleft((v[0] + 1, v[1]))

            if not (v[0], v[1] + 1) in check:
                if v[1] + 1 <= M:
                    if a_book[v[0]] + b_book[v[1] + 1] <= K:
                        search.appendleft((v[0], v[1] + 1))


search_count((0, 0))

print(max(check.values()))

Submission status: Runtime Error

Solution code:
nums=input()
nums=nums.split()
M,N,K = int(nums[0]),int(nums[1]),int(nums[2])

al=input()
al2=al.split()
for n in range(M):
    al2[n] = int(al2[n])

bl=input()
bl2=bl.split()
for n in range(N):
    bl2[n] = int(bl2[n])

count=0

ai=0
bi=0

while 1:
    if al2[ai] <= bl2[bi] and al2[ai] <= K:
        K = K-al2[ai]
        ai+=1
        count+=1
        

    elif al2[ai] > bl2[bi] and bl2[bi] <= K:
        K = K-bl2[bi]
        bi+=1
        count+=1
    else:
        break

print(count)

Submission status: Runtime Error

Solution code:
N, M, K=[int(i) for i in input().split(" ")]
a=[int(i) for i in input().split(" ")]
b=[int(i) for i in input().split(" ")]

if (N>10**7) | (M>10**7) |(K>10**7):
    print(0)
else:
    time=0
    a_idx=0
    b_idx=0
    count=0
    while time<K:
        count+=1
        try:
            if a_idx+1==N:
                time+=b[b_idx]
                b_idx+=1
                if time>K:
                    count-=1
                continue
            elif b_idx+1==M:
                time+=a[b_idx]
                a_idx+=1
                if time>K:
                    count-=1
                continue    

            if a[a_idx]<b[b_idx]:
                time+=a[a_idx]
                a_idx+=1

            elif a[a_idx]>b[b_idx]:
                time+=b[b_idx]
                b_idx+=1
            else:
                try:
                    a_com=a_idx
                    b_com=b_idx
                    while True:
                        if a[a_com]>b[b_com]:
                            time+=a[a_idx]
                            a_idx+=1
                            break
                        elif a[a_com]<b[b_com]:
                            time+=b[b_idx]
                            b_idx+=1
                            break
                        a_com+=1
                        b_com+=1
                except:
                    time+=a[a_idx]
                    a_idx+=1
            if time>K:
                count-=1            
        except:
            break
    print(count)

Submission status: Runtime Error

Solution code:
N, M, K=[int(i) for i in input().split(" ")]
a=[int(i) for i in input().split(" ")]
b=[int(i) for i in input().split(" ")]

if (N>10*8) | (M>10**8) |(K>10*8):
    print(0)
else:
    time=0
    a_idx=0
    b_idx=0
    count=0
    while time<K:
        count+=1
        try:
            if a_idx+1==N:
                time+=b[b_idx]
                b_idx+=1
                if time>K:
                    count-=1
                continue
            elif b_idx+1==M:
                time+=a[b_idx]
                a_idx+=1
                if time>K:
                    count-=1
                continue    

            if a[a_idx]<b[b_idx]:
                time+=a[a_idx]
                a_idx+=1

            elif a[a_idx]>b[b_idx]:
                time+=b[b_idx]
                b_idx+=1
            else:
                try:
                    a_com=a_idx
                    b_com=b_idx
                    while True:
                        if a[a_com]>b[b_com]:
                            time+=a[a_idx]
                            a_idx+=1
                            break
                        elif a[a_com]<b[b_com]:
                            time+=b[b_idx]
                            b_idx+=1
                            break
                        a_com+=1
                        b_com+=1
                except:
                    time+=a[a_idx]
                    a_idx+=1
            if time>K:
                count-=1            
        except:
            break
    print(count)

Submission status: Runtime Error

Solution code:
n, m, k = list(map(int, input().split()))
a = list(map(int, input().split()))
b = list(map(int, input().split()))
 
l = []
for i in range(min(n, m)):
  l.append(min(a[i], b[i]))
  l.append(max(a[i], b[i]))

for i in range(min(n, m), max(n, m)):
  if n > m:
    l.append(a[i])
  else:
    l.append(b[i])

total = 0
cnt = 0
for i in range(n+m):
  if total+l[i] > k:
    break
  total += l[i]
  cnt += 1
print(cnt)

Submission status: Runtime Error

Solution code:
data = [int(k) for k in input().split()]

A = data[0]
B = data[1]
K = data[2]

Abooks = [int(k) for k in input().split()]
Bbooks = [int(k) for k in input().split()]


time = 0
nbOfBooks = 0

while (time + Bbooks[0]) <= K or (time + Abooks[0])  <= K:
	
		
	if Abooks[0] >= Bbooks[0]:
		
		time += Bbooks[0]
		
		if len(Bbooks) == 1:
			Bbooks[0] = 10**9+1
		else:

			Bbooks.pop()
		
		nbOfBooks += 1

	else:
		
		time += Abooks[0]
		
		if len(Abooks) == 1:
			Abooks[0] = 10**9+1
		
		else:

			Abooks.pop()
		nbOfBooks += 1 


print(nbOfBooks)

Submission status: Runtime Error

Solution code:
def resolve():
    def dfs(a, b, k):
        nonlocal cnt
        seen[a][b] = True
        na = a + 1
        nb = b + 1
        if na <= N and seen[na][b] is False and k >= book_a[na]:
            k -= book_a[na]
            cnt = max(cnt, na + b)
            dfs(na, b, k)
        if nb <= M and seen[a][nb] is False and k >= book_b[nb]:
            k -= book_b[nb]
            cnt = max(cnt, a + nb)
            dfs(a, nb, k)

    N, M, k = map(int, input().split())
    book_a = [int(x) for x in input().split()]
    book_b = [int(x) for x in input().split()]
    book_a.insert(0, 0)
    book_b.insert(0, 0)
    cnt = 0
    seen = [[False] * (M + 1) for _ in range(N + 1)]
    dfs(0, 0, k)
    print(cnt)


if __name__ == "__main__":
    resolve()

Submission status: Runtime Error

Solution code:
def dfs(a, b, k):
    global cnt
    seen[a][b] = True
    na = a + 1
    nb = b + 1
    if na <= N and seen[na][b] is False and k >= book_a[na]:
        k -= book_a[na]
        cnt = max(cnt, na + b)
        dfs(na, b, k)
    if nb <= M and seen[a][nb] is False and k >= book_b[nb]:
        k -= book_b[nb]
        cnt = max(cnt, a + nb)
        dfs(a, nb, k)
        
N, M, k = map(int, input().split())
book_a = [int(x) for x in input().split()]
book_b = [int(x) for x in input().split()]
book_a.insert(0, 0)
book_b.insert(0, 0)
cnt = 0
seen = [[False] * (M + 1) for _ in range(N + 1)]
dfs(0, 0, k)
print(cnt)

Submission status: Runtime Error

Solution code:
print(int(a+a**2+a**3))

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
S = str(input())
T = str(input())
length =len(S)
listS=list(S)
listT=list(T)
num = len(T)
res = 0
for i in range(length):
    if (listS[num-1] != listT[num-1]):
        res +=1
    num -=1
print(res)

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:

a = input()
print(a+a**2+a**3)

Submission status: Runtime Error

Solution code:

a = input()
print(a+a ** 2+a ** 3)

Submission status: Runtime Error

Solution code:
N, M, K = map(int,input().split())
A = list(map(int, input().split()))
B = list(map(int, input().split()))
time = 0
books = 0
A.append(200001)
B.append(200002)

while time <= K:
    if A[0] < B[0]:
        time += A.pop(0)
    elif B[0] < A[0]:
        time += B.pop(0)
    elif B[0] == A[0]:
        if B[1] > A[1]:
            time += A.pop(0)
        else:
            time += B.pop(0)
    books += 1
if books == 0:
    print(0)
else:
    print(books - 1)

Submission status: Runtime Error

Solution code:
a = int(input("Input an integer : "))
n1 = int( "%s" % a )
n2 = int( "%s%s" % (a,a) )
n3 = int( "%s%s%s" % (a,a,a) )
print (n1+n2+n3

Submission status: Runtime Error

Solution code:
n, m, k = [int(_) for _ in input().split()]
a = [int(_) for _ in input().split()]
b = [int(_) for _ in input().split()]

maxrecord = 0

for i in range(1, n + 1):
    left = k - sum(a[:i])
    if left < 0:
        counter = i - 1
        if maxrecord < counter:
            maxrecord = counter
        break
    counter = i

    for j in range(1, m + 1):
        if left - sum(b[:j]) < 0:
            if maxrecord < counter:
                maxrecord = counter
            break
        counter += 1

print(counter)

Submission status: Runtime Error

Solution code:
a = input()
print(pow(a,1)+pow(a,2)+pow(a,3))

Submission status: Runtime Error

Solution code:
S = input()
T = input()
k=0
for i in range(len(S)):
  if(S[i] != T[i]):
    k = k+1
print(k)

Submission status: Runtime Error

Solution code:
import sys
a = input()
print(a+a^2+a^3)

Submission status: Runtime Error

Solution code:
import bisect,collections,copy,heapq,itertools,math,numpy,string
import sys
f = open('input.txt', 'r')
sys.stdin = f
N,M,K = map(int,input().split())
a = list(map(int,input().split()))
b = list(map(int,input().split()))

ai =0
bi=0
st =0
c = 0
while True:
  if ai == N:
    if bi == M:
      break
    else:
      st += b[bi]
      if st > K:
        break
      bi += 1
      c +=1
  elif bi == M:
    if ai == N:
      break
    else:
      st += a[ai]
      if st > K:
        break
      ai += 1
      c += 1
  elif a[ai] > b[bi]:
    st += b[bi]
    if st > K:
      break
    bi +=1
    c +=1
  elif a[ai] < b[bi]:
    st += a[ai]
    if st > K:
      break
    ai +=1
    c +=1
  elif a[ai] == b[bi]:
    tmpst = st
    tmpc =0
    tmpai = ai
    tmpbi = bi
    while True:
      tmpst +=a[tmpai]
      if tmpai < N-1:
        tmpai+=1
      if tmpbi < M-1:
        tmpbi+=1
      if tmpst > K:
        st += a[ai]
        if st > K:
          print(c)
          exit()
        ai +=1
        c +=1
        #print(c+tmpc,'ja')
        #exit()
      if a[tmpai] > b[tmpbi]:
          st += b[bi]
          if st > K:
              print(c)
              exit()
          bi += 1
          c += 1
          break
      elif a[tmpai] < b[tmpbi]:
          st += a[ai]
          if st > K:
              print(c)
              exit()
          ai += 1
          c += 1
          break
      if tmpai == N-1 and tmpbi == M-1:
          print(N+M)
          exit()
      #print(tmpst)
      tmpc += 1
      #print(tmpai, tmpbi)
print(c)

Submission status: Runtime Error

Solution code:
def main():
    n, m, k = map(int, input().split())
    a = list(map(int, input().split()))
    b = list(map(int, input().split()))
    a.append(10**9+1)
    b.append(10**9+1)
    a, b = a[::-1], b[::-1]
    sum = 0
    for _ in range(400001):
        x = a.pop() if a[-1] < b[-1] else b.pop()
        if x > 10**9:
            break
        k -= x
        if k < 0:
            break
        sum += 1
    print(sum)

if __name__ == "__main__":
    main()

Submission status: Runtime Error

Solution code:
import sympy
import sys
sys.setrecursionlimit(10**6)

N = int(input())
div = []
for i in range(1,N+1):
    f = sympy.divisor_count(i)
    div.append(f*i)

print(sum(div))

Submission status: Runtime Error

Solution code:
m=input()
n=input()
count=0
for i in range(len(m)):
  if m[i]!=n[i]:
    count+=1
print(count)

Submission status: Runtime Error

Solution code:
m=input()
n=input()
count=0
for i in range(len(m)):
  if m[i]!=n[i]:
    count+=1
print(count

Submission status: Runtime Error

Solution code:
a = input()
n = 2
m = 3
print(a + a ** n + a ** m)

Submission status: Runtime Error

Solution code:
a = input()
n = 2
m = 3
print(a + a**n + a**m)

Submission status: Runtime Error

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

count = 0
out = 0
if a == b:
  print("0")
else:
  c = list(a)
  d = list(b)
  for i in c:
    if i == d[count]:
      pass
    else:
      out = out + 1
    count = count + 1
  print(str(out))

Submission status: Runtime Error

Solution code:
a = input()
n = 2
m = 3
print(a+a**n+a**3)

Submission status: Runtime Error

Solution code:
a = input()
print(a+a^2+a^3)

Submission status: Runtime Error

Solution code:
import math
import sys
from collections import deque

N, M , K = map(int, input().split())
A = deque(map(int, input().split()))
B = deque(map(int, input().split()))


count = 0
time = 0
#もし先にどっちかの玉が尽きた時の問題。
for i in range(400001):
    #本が尽きていない。
    if len(A) != 0 and len(B) != 0:

        if A[0] < B[0]:
            time = time + A[0]
            if time <= K:
                count = count + 1
                A.popleft()

        elif A[0] > B[0]:
            time = time + B[0]
            if time <= K:
                count = count + 1
                B.popleft()
        else:
            time = time + A[0]
            if time <= K:
                count = count + 1
                A.popleft()
    else:
        #どっかの本が尽きている。
        if len(A) == 0 and len(B) != 0:
            time = time + B[0]
            if time <= K:
                count = count + 1
                B.popleft()
        elif len(A) != 0 and len(B) == 0:
            time = time +A[0]
            if time <= K:
                count = count + 1
                A.popleft()
        elif len(A) == 0 and len(B) == 0:
            print(count)
            sys.exit()
               


print(count)

Submission status: Runtime Error

Solution code:
from collections import deque

def solve():
    N, M, K = map(int, input().split())
    A = list(map(int,input().split()))
    B = list(map(int,input().split()))

    sumA = 0
    sumB = 0

    tmp = 0

    dA = deque(A)
    dB = deque(B)

    dsA = deque()
    dsB = deque()

    while dA:
        tmp = dA.popleft()
        if sumA + tmp <= K:
            dsA.append(tmp)
            sumA += tmp
        else:
            break
    
    while dB:
        tmp = dB.popleft()
        if sumB + tmp <= K:
            dsB.append(tmp)
            sumB += tmp
        else:
            break

    sumall = sumA + sumB
    lenall = len(dsA) + len(dsB)
    Atmp = 0
    Btmp = 0

    while sumall > K:
        if Atmp == 0:
            Atmp = dsA.pop()
        if Btmp == 0:
            Btmp = dsB.pop()
        if Atmp >= Btmp:
            sumall -= Atmp
            lenall -= 1
            Atmp = 0
        else:
            sumall -= Btmp
            lenall -= 1
            Btmp = 0

    print(lenall)
                 
solve()

Submission status: Runtime Error

Solution code:
print(str(a+a*a+a*a*a))

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
print(int(a+a^2+a^3))

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
def FindSum(a, n)
    sum = 0
    for i in range(1, n + 1):
      sum += (i / mathpow(a, i));
    return sum
  a = 3, n = 3
  print(FindSum(a, n));

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
from sys import stdin

def main():
    n, m, k = [int(x) for x in stdin.readline().rstrip().split()]

    pileda = 0
    a = [0]
    # ai = 0
    for x in stdin.readline().rstrip().split():
        # ai += 1
        x = int(x)
        pileda += x
        a.append(pileda)
        if pileda > k:
            break
    
    piledb = 0
    b = [0]
    for x in stdin.readline().rstrip().split():
        x = int(x)
        piledb += x
        b.append(piledb)
        if piledb > k:
            break

    ans = 0
    for ai, time_a in enumerate(a):
        for bi, time_b in enumerate(b):
            if time_a + time_b > k:
                break
            if time_a + time_b <= k and ai + bi > ans:
                ans = ai + bi
    print(ans)

if __name__ == "__main__":
    main()

Submission status: Runtime Error

Solution code:
import sympy


def make_divisors(n):
    lower_divisors, upper_divisors = [], []
    i = 1
    while i * i <= n:
        if n % i == 0:
            lower_divisors.append(i)
            if i != n // i:
                upper_divisors.append(n // i)
        i += 1
    return lower_divisors + upper_divisors[::-1]


n = int(input())

total = 0
for num in range(1, n+1, 1):
    total += num * len(sympy.divisors(num))
print(total)

Submission status: Runtime Error

Solution code:
import sympy
N = int(input())
ans = 0
for k in range(1, N+1):
    ans += k*len(sympy.divisors(k))
print(ans)

Submission status: Runtime Error

Solution code:
for a in range (1,11)
print(str(a+a*a+a*a*a))

Submission status: Runtime Error

Solution code:
import sys

import math
import itertools

n,m,k=map(int,input().split())
a = list(map(int, input().split()))
b = list(map(int, input().split()))
ans = 0
time = 0
max=len(a)+len(b)
for i in range(max):
    if (len(a) == 0):
        if (time + b[0] <= k):
            time += b[0]
            ans += 1
            b.pop(0)
    elif (len(b) == 0):
        if (time + a[0] <= k):
            time += a[0]
            ans += 1
            a.pop(0)
    else:
        tmp = 0
        isA=True
        if (a[0] < b[0]):
            tmp = a[0]
            isA=True
        else:
            tmp = b[0]
            isA = False
        if (time + tmp <= k):
            time += tmp
            ans += 1
            if (isA):
                a.pop(0)
            else:
                b.pop(0)
print(ans)

Submission status: Runtime Error

Solution code:
n,m,k=map(int,input().split())
a = [int(i) for i in input().split()]
b = [int(i) for i in input().split()]
ans = 0
while(k>0):
    if(len(a) == 0 or len(b) == 0):
        if(len(a) == 0 and len(b)==0):
            break        
        elif(len(a) == 0):
            if(k >= b[0]):
                k -= b.pop(0)
                ans += 1
            else:
                break
        elif(len(b) == 0):
            if(k >= a[0]):
                k -= a.pop(0)
                ans += 1
            else:
                break
    else:
        if(a[0]>b[0]):
            if(k >= b[0]): 
                k -= b.pop(0)
                ans +=1
            else:
                break
        else:
            if(k >= a[0]):
                k -= a.pop(0)
                ans += 1
            else:
                break
print(ans)

Submission status: Runtime Error

Solution code:
n,m,k=map(int,input().split())
a=list(map(int,input().split()))
b=list(map(int,input().split()))
time=0
count=0
while time<k:
    if count==(n+m-1):
        count=n+m+1
        break
    elif count//2>=n or count//2>=m:
        count+=1
        continue
    elif count%2==0:
        time+=a[count//2]
        count+=1
    else:
        time+=b[count//2]
        count+=1
print(count-1)

Submission status: Runtime Error

Solution code:
a = n
print(a + a ** 2 + a ** 3)

Submission status: Runtime Error

Solution code:
a = str(input())
s = a + a**2 + a**3
print(s)

Submission status: Runtime Error

Solution code:
a = int(input()
if (a>0 and a<11):
        print(a+a*a+a**3)

Submission status: Runtime Error

Solution code:
def main():
    import sympy
    n = int(input())
    s = 0
    
    for i in range(1,n+1):
        s += i * len(sympy.divisors(i))
    print(s)

main()

Submission status: Runtime Error

Solution code:
import java.util.*;
import java.io.*;
class Main{
  public static void main(String[] args){
    try{
      BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
      int a = Integer.parseInt(br.readLine());
      int ans = a + a*a + a*a*a;
      System.out.println(ans);
    }catch(IOException e){
       System.out.println(e);
    }
  }
}

Submission status: Runtime Error

Solution code:
a = int(input())

print(int((a*(a**3-1)/(a-1))))

Submission status: Runtime Error

Solution code:
val = input()

res = val + val ** 2 + val ** 3

print(res.astype(int))

Submission status: Runtime Error

Solution code:
if int(a>0 and a<11):
  print(float(a+a**2+a**3))

Submission status: Runtime Error

Solution code:
val = input()

print(val + val ** 2 + val ** 3)

Submission status: Runtime Error

Solution code:
a =  input("Enter a number:")
print(a + (a**2) + (a**3))

Submission status: Runtime Error

Solution code:
a = input()
first_a = a
second_a = a**2
third_a = a**3
sum_a = first_a + second_a+third_a

Submission status: Runtime Error

Solution code:
a = int,input()
b = a+(a**2)+a**3
print('b=',b)

Submission status: Runtime Error

Solution code:
a=int(input())
value=a+(a*a)+(a*a*a*)
print(value)

Submission status: Runtime Error

Solution code:
s= input()
print (s+s**2+s**3)

Submission status: Runtime Error

Solution code:
a = (int,input())
b = (int,sum(a+a**2+a**3))
print(b)

Submission status: Runtime Error

Solution code:
a=input()

print(int(a+a**2+a**3))

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
import argparse

parser = argparse.ArgumentParser()

parser.add_argument('input', metavar='a', type=int)

args = parser.parse_args()

a = args.input

print('{0}'.format(a+a*a+a*a*a))

Submission status: Runtime Error

Solution code:
input(a) 
a = 2
print(a + a*a + a*a*a

Submission status: Runtime Error

Solution code:
a = int,input()
print(a+(a**2)+(a**3))

Submission status: Runtime Error

Solution code:
def calc(n):
  s=n+n**2+n**3
  res=int(s)
  return res
for i in range(int(input())):
  n=int(input())
  print(calc(n))

Submission status: Runtime Error

Solution code:
a = int,input()
print(a+a**2+a**3)

Submission status: Runtime Error

Solution code:
import argparse


def main():
    parser = argparse.ArgumentParser()

    parser.add_argument('input', metavar='a', type=int)

    args = parser.parse_args()

    a = args.input

    print('{0}'.format(a+a*a+a*a*a))


if __name__ == '__main__':
    main()

Submission status: Runtime Error

Solution code:
a=input()
x=a+a*a+a*a*a
print(a)

Submission status: Runtime Error

Solution code:
print(a+a**2+a**3)

Submission status: Runtime Error

Solution code:
n, m, k = map(int, input().split())
a = list(map(int, input().split()))
b = list(map(int, input().split()))
c = sorted(a+b)
ans = 0
tmp = 0
for i in c:
  tmp += i
  if(tmp > k):print(ans);exit()
  ans+=1
else:print(ans)

Submission status: Runtime Error

Solution code:
a = int(input())
res = sum(a +(a**2)+(a**3))
print(res)

Submission status: Runtime Error

Solution code:
input = a
a = 3
print(a + a*a + a*a*a)

Submission status: Runtime Error

Solution code:
a = int(input())
return a + a ** 2 + a ** 3

Submission status: Runtime Error

Solution code:
a = input()
print(a+a**2+a**3)

Submission status: Runtime Error

Solution code:
import argparse


def main():
    parser = argparse.ArgumentParser()

    parser.add_argument('input', metavar='a', type=int)

    args = parser.parse_args()

    a = args.input

    print('{0}'.format(a+a*a+a*a*a))


if __name__ == '__main__':
    main()

Submission status: Runtime Error

Solution code:
a = input()
print (int(a+a^2+a^3))

Submission status: Runtime Error

Solution code:
a = 5
print(str(a**1) + str(a**2) + (a**3))

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
a = int(input())
print(sum(a +(a**2)+(a**3)))

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
a=int((input())
print(a+a^2+a^3)

Submission status: Runtime Error

Solution code:
print(a+a*a+a*a*a)

Submission status: Runtime Error

Solution code:
for i in range(int(input())):
  n=int(input())
  s=n+n**2+n**3
  print(s)

Submission status: Runtime Error

Solution code:
a=input()
ans=a+a^2+a^3
print(ans)

Submission status: Runtime Error

Solution code:
a = (int(x) for x in input().split())

print(a + a*a + a*a*a)

Submission status: Runtime Error

Solution code:
b = a

a + a*a + a*a*a 


print(b)

Submission status: Runtime Error

Solution code:
a = input()
print(a + a**2 + a**3)

Submission status: Runtime Error

Solution code:
a = input()
return a + a ** 2+ a ** 3

Submission status: Runtime Error

Solution code:
s,t=input().split()
ans=0
for i in range(len(s)):
  if s[i]!=t[i]:
    ans+=1
print(ans)

Submission status: Runtime Error

Solution code:
a = int,input()
b = int,sum(a + a^2 + a^3)
print(b)

Submission status: Runtime Error

Solution code:
a = int(input("")
print(a + a**2 +a**3)

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
a = input()

print(a + a ** 2 + a ** 3)

Submission status: Runtime Error

Solution code:
int a
int x
x = a+(a*a)+(a*a*a)
ptint(x)

Submission status: Runtime Error

Solution code:
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;

int main()
{
    int a ;
    cin >> a;
    cout << a + pow(a,2) + pow(a,3) << endl;
}

Submission status: Runtime Error

Solution code:
x = int(import())
print(x+x*x+x*x*x)

Submission status: Runtime Error

Solution code:
return a + a ** a + a ** a ** a

Submission status: Runtime Error

Solution code:
print(a+a*+a**)

Submission status: Runtime Error

Solution code:
s = list(input())
t = list(input())
n=0
for i in range(len(s)):
    if s[i]!=t[i]:
        
        n+=1
print(n)

Submission status: Runtime Error

Solution code:
a=int.(input())
print(a+a**2+a**3)

Submission status: Runtime Error

Solution code:
#include<bits/stdc++.h>
#define rep(i,n) for(int i=0;i<n;i++)
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
typedef vector<int> vi;

int main(){
  int a;
  cin >> a;
  cout << a + a*a + a*a*a;
  
  return 0;
}

Submission status: Runtime Error

Solution code:
def main():
    import sys
    def input(): return sys.stdin.readline().rstrip()
    a = int(input())
    for i in range(3):
        ans += a**(i+1)
    print(ans)


if __name__ == '__main__':
    main()

Submission status: Runtime Error

Solution code:
a=int(input())
B=0
C=0
D=0
B=A
C=a*a
D=a*a*a
print(B+C+D)

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
print(a + (a ** 2) + (a ** 3))

Submission status: Runtime Error

Solution code:
a = (int,input())
print(a + a^2 + a^3)

Submission status: Runtime Error

Solution code:
a = input()
return a + a ** a + a ** a ** a

Submission status: Runtime Error

Solution code:
a = int(intput())
print(a+a**2 + a**3)

Submission status: Runtime Error

Solution code:
a = input()
x = a + a*a + a*a*a
print(x)

Submission status: Runtime Error

Solution code:
i = int(input())

print(a+a**2+a**3)

Submission status: Runtime Error

Solution code:
"""everything has a cost!"""

from math import *
import random, functools, collections, sys

__author__ = 'p7x'


# sys.stdin = open('in.txt', 'r')
# sys.stdout = open('out.txt', 'w')
# sys.stderr = open('err.txt', 'w')


if __name__ == '__main__':
    n = int(input())
    print(a + a**2 + a**3)

Submission status: Runtime Error

Solution code:
S = input()
T = input()

cnt = 0
for i in range(len(S)):
    if S[i] != T[i]:
        cnt += 1
print(cnt)

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
 a = int(input())
 sum = int(a + a * a + a * a * a)
 print(sum)

Submission status: Runtime Error

Solution code:
a = input()
ans = a + (a ** 2) + (a ** 3)
print(ans)

Submission status: Runtime Error

Solution code:
def main(a):
    return a + a**2 + a**3

if __name__ == "__main__":
    a = input()
    print(main(a))