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

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

Submission status: Wrong Answer

Solution code:
a = int(input("Enter an integer : "))
s=a**2
t=a**3
print(a+s+t)

Submission status: Wrong Answer

Solution code:
def sep():
    return map(int,input().strip().split(" "))
def lis():
    return list(sep())

n=int(input())
print(n* n*n + n*n*n)

Submission status: Wrong Answer

Solution code:
n = int(input())
ans = 0
a = [1]*(n+1)
for i in range(2, n+1):
    for j in range(i, n+1, i):
        a[j]+=1
for k in range(1, n+1):
    ans+=k*a[k]
print(ans)

Submission status: Wrong Answer

Solution code:
def calc(a: int) -> int:
  print(a+a*a+a*a*a)

Submission status: Wrong Answer

Solution code:
class Solution:
    def calc(self, a: int) -> int:
        print(a+a*a+a*a*a)

Submission status: Wrong Answer

Solution code:
class Solution:
    def calc(self, a: int) -> int:
        print(a+a*a+a*a*a)

Submission status: Wrong Answer

Solution code:
class Solution:
    def calc(self, a: int) -> int:
        return a+a*a+a*a*a

Submission status: Wrong Answer

Solution code:
import sys

a = int(input())
print('hello')
print(a + a * a + a * a * a)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
n = int(input())
ans = 0
for i in range(1,n+1):
    ans += ((i+i*(n//i))*(n//i))//2
    #print(ans)
print(ans)

Submission status: Wrong Answer

Solution code:
a = int(input())

print(a+a^2+a^3)

Submission status: Wrong Answer

Solution code:
N = int(input())

print(N *+ N*N + N*N*N)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
a = int(input())

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

Submission status: Wrong Answer

Solution code:
n = int(input()) % 1000
print(1000 - n if n else 0)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
a = int(input())
ans = (a+a*2+a*3+0.01)//1
print(ans)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:

"""
def factorization(n):
    if (n == 1 ):
        return [1]
    arr = []
    temp = n

    
    for i in range(2, int(-(-n**0.5//1))+1) :
        if ( temp % i == 0):
            cnt = 0
            while (temp % i == 0):
                cnt +=1
                temp //= i
            arr.append([i, cnt])
    if temp!=1:
        arr.append([temp, 1])

    if arr==[]:
        arr.append([n, 1])
    return [arr[1]+1 for arr in arr ]

#print(factorization(N))

sum_ans = 0
def cal(list):
    ans = 1
    for i in list:
        ans *= i

    return ans


for i in range(1,N+1):
    #print(factorization(i),i)
    sum_ans += i * cal(factorization(i))
    #lenが掛け算

print(sum_ans)
"""
n=int(input())
ans=0
for i in range(1,n+1):
    d=n//i
    ans+=i*d*(d+1)//2
print(ans)

Submission status: Wrong Answer

Solution code:
N = int(input())
ans = 0
for i in range(1,N+1):
  tmp = N // i
  ans += ((tmp*i + i) * tmp)/2
print(int(ans))

Submission status: Wrong Answer

Solution code:
N=int(input())
ans=0
for i in range(1,N+1):
  a=N//i
  ans+=(a*(a+1)*i)//2
print(ans)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
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]


ans = 0
k = make_divisors(int(input()))
l = len(k)
for i in range(1,l):
    ans = ans + k[i] * i 
print(ans)

Submission status: Wrong Answer

Solution code:

for i in range(10):
    a=i+1
    print(a+a^2+a^3)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
#Write your code in below
N = int(input().rstrip())
print(N*(1+N+N^2))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
n = int(input())

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
a =int(input())

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
a=int(input())

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
a=int(input())
1<=a<=10

a=a+a^2+a^3

Submission status: Wrong Answer

Solution code:
a = int(input())

class calculate:
    def __init__(self,a):
        self.check = a
    
    def get_ans(self,a):
        return a + a**2 + a**3

valuable = calculate(a)

#Sprint(valuable.check)

ans = valuable.get_ans(10)

print(ans)

Submission status: Wrong Answer

Solution code:
a = int(input("整数を入力してください"))
answer = a+a*a+a*a*a
print(answer)

Submission status: Wrong Answer

Solution code:
a = int(input("整数を入力してください"))
answer = a+a*a+a*a*a
print("答えは",answer)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
x = ["a", "b", "c"]
print(x[0], x[1], x[2])

Submission status: Wrong Answer

Solution code:
from sys import stdin
from collections import deque
import time
import math
#数独を解くプログラム

#開始時刻
t1 = time.time()
n = int(stdin.readline().rstrip())
#入力された列が正しいかを探索
def search_row(question,row):
    num = [0]*n
    #各数字が何個あるか調べる
    for i in range(n):
        if question[row][i] != 0:
            #indexの値に注意
            num[question[row][i]-1] += 1
    #2個以上あった場合False,それ以外はTrue
    for i in range(n):
        if num[i] > 1:
            return False
    return True

#入力された行が正しいかを探索
def search_column(question,column):
    num = [0]*n
    #各数字が何個あるか調べる
    for i in range(n):
        if question[i][column] != 0:
            #indexの値に注意
            num[question[i][column]-1] += 1
    #2個以上あった場合False,それ以外はTrue
    print(question)
    for i in range(n):
        if num[i] > 1:
            return False
    return True

#各ブロック内が正しいかを調べる
def search_square(question,row,column):
    num = [0]*n
    n_sqrt = int(math.sqrt(n))
    #何ブロックにあるかを計算
    block = [row // n_sqrt, column // n_sqrt]
    for i in range(block[0]*n_sqrt,block[0]*n_sqrt + n_sqrt):
        for j in range(block[1]*n_sqrt,block[1]*n_sqrt + n_sqrt):
            if question[i][j] != 0:
                num[question[i][j]-1] += 1
    for i in range(n):
        if num[i] > 1:
            return False
    return True

def search(question,row,column):
    if not search_row(question,row):
        return False
    if not search_column(question,column):
        return False
    if not search_square(question,row,column):
        return False
    return True
    


#main関数
method = stdin.readline().rstrip()
counter = 0
question = []
for i in range(n):
    question.append([int(x) for x in stdin.readline().rstrip().split()])
open = deque()
open.append(question)
#深さ優先探索
if method == 'DFS':
    while True:
        #openの最初のノードを取り出す
        question = open.popleft()
        #0がある場所を調べる（左上から）
        spot = [-1,-1]
        for i in range(n):
            for j in range(n):
                if question[i][j] == 0:
                    spot = [i,j]  
                    break
        #0がなかった場合探索終了
        if spot == [-1,-1]:
            break
        #0の場所に数字を入れていく
        for i in range(1,n+1):
            question[spot[0]][spot[1]] = i
            #もし入れた数字が正しかった場合、openに追加
            #深さ優先探索なので、openの最初に追加
            if search(question,spot[0],spot[1]):
                open.appendleft(question)
                counter += 1
    t2 = time.time()
    print("答え :", question)
    print("実行時間 :",t2-t1)
    print("生成した状態数 :",counter)

Submission status: Wrong Answer

Solution code:
a = int(input("1~10の整数を入力してください"))
print(a+a**2+a**3)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
#https://atcoder.jp/contests/abc172/tasks/abc172_a

a= int(input("a::"))
print(a+ pow(a, 2)+ pow(a, 3))

Submission status: Wrong Answer

Solution code:
import sys
def LI(): return list(map(int, sys.stdin.buffer.readline().split()))
def I(): return int(sys.stdin.buffer.readline())
def LS(): return sys.stdin.buffer.readline().rstrip().decode('utf-8').split()
def S(): return sys.stdin.buffer.readline().rstrip().decode('utf-8')
def IR(n): return [I() for i in range(n)]
def LIR(n): return [LI() for i in range(n)]
def SR(n): return [S() for i in range(n)]
def LSR(n): return [LS() for i in range(n)]
def SRL(n): return [list(S()) for i in range(n)]
def MSRL(n): return [[int(j) for j in list(S())] for i in range(n)]
mod = 10 ** 9 + 7

a = I()

ans = int(a + a ** 2 + a ** 3)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
a=5
if 1<a and a <10:
    print(a+a**2+a**3)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
n = int(input())
a = 1000
while a < n:
    a += 1000
print(a-n)

Submission status: Wrong Answer

Solution code:
1

Submission status: Wrong Answer

Solution code:
#%%
x = int(input())
sum=x
for i in range(3):
    sum+=pow(x,2)
print(sum)

Submission status: Wrong Answer

Solution code:
a=input('aの値を入力してください：')
print(int(a)+(int(a))^2+(int(a))^3)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
from math import pow

def func(x):
    return x + pow(x,2) + pow(x,3)
    

if __name__=="__main__":
    input = input()
    print(func(int(input)))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import sys 

input = sys.stdin.readline()

print(input)

Submission status: Wrong Answer

Solution code:
a = int(input())

ans = a+a*2+a*3

print(ans)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
N = int(input())
ans = 0
for j in range(1, N+1):
    for i in range(1, N+1):
        if i % j == 0:
            ans += i
print(ans)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
def func(a):
    x = (a) + (a**2) + (a**3)
    return int(x)

a = int(input( " enter number : "))
print(func(a))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
n = int(input())

print(n ** 6)

Submission status: Wrong Answer

Solution code:
n=int(input("enter no"))
print(n+n*n+n*n*n)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
n=int(input())
def mul(x,y):
    return x*y
def div(x):
    i=1
    d=0
    while i <= x:
        if x % i ==0:
            d += 1
        i += 1
    return d

d=[]
a=[i+1 for i in range(n)]
k = 1
while k <= n:
    j = k*div(k)
    d.append(j)
    k += 1

print(sum(list(map(mul,a,d))))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
n=int(input())
t=n+n^2+1
print(int(t*n))

Submission status: Wrong Answer

Solution code:
n=int(input())
t=n+n^2+1
print(t*n)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
n = int(input())

print(n*pow(n, 2)*pow(n, 3))

Submission status: Wrong Answer

Solution code:
n = int(input())
ans = 0
for i in range(1, n+1):
    for j in range(i, n+1, i):
        ans += j
    

print(ans)

Submission status: Wrong Answer

Solution code:
a, b = 0, 0
for a in range (1, 11):
  b = a + a**2 + a**3
  print(b)

Submission status: Wrong Answer

Solution code:
a, b = 0, 0
for a in range (1, 11):
  b = a + a**2 + a**3
  print(b)

Submission status: Wrong Answer

Solution code:
for a in range (1,11):
  b = a + a**2 + a**3
  print(b)

Submission status: Wrong Answer

Solution code:
n=int(input())
List=[2 for x in range(n+1)]
List[0]=0
List[1]=1
ans=1
 
for x in range(2,n+1):
  for y in range(2*x,n+1,x):
    List[y]+=1
  ans+=x*List[x]
print(ans)

Submission status: Wrong Answer

Solution code:
from sys import stdin
input = stdin.readline
s = int(input())

N=s+s*s+s*s*s

print (type(N), N)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
A=int(input())
sums=0
for i in range(1,4):
  sums += A**i
  print(sums)
print(sums)

Submission status: Wrong Answer

Solution code:
A=int(input())
sums=0
for i in range(3):
  sums+=A^(i+1)
  
print(sums)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
s = int(input())
val = 0
for i in range(1,4):
  a = s**i
  val +=a
  print(val)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
# -*- coding: utf-8 -*-
import sys
import math
from bisect import bisect_left
from bisect import bisect_right
from collections import defaultdict
from heapq import heappop, heappush
import itertools
from decimal import *

input = sys.stdin.readline

def inputInt(): return int(input())
def inputMap(): return map(int, input().split())
def inputList(): return list(map(int, input().split()))
def inputStr(): return input()[:-1]

inf = float('inf')
mod = 1000000007

#-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-
#-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-

def main():
	a = inputInt()

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



#-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-
#-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-
if __name__ == "__main__":
	main()

Submission status: Wrong Answer

Solution code:
n = int(input())
s = 0
for i in range(1,4):
  s += n**i

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
N = int(input())

ans = 0
for i in range(1,N+1):
    y = N//i
    ans += y*(y+1)*i//2
    
print(ans)

Submission status: Wrong Answer

Solution code:
N = int(input())


def g(n):
    return (n * (n + 1))//2

total = 0
for i in range(1,N+1):
    total += i * g(N//i)
    
print(total)

Submission status: Wrong Answer

Solution code:
N=int(input())

def divors(u):
    j=0
    for i in range(1,u+1):
        if u % i ==0:
            j+=1
    return j
ans=0
for i in range(1,N+1):
    ans += i*divors(i)
print(ans)

Submission status: Wrong Answer

Solution code:
a=int(input())

a=a+a^2+a^3
a=int(a)

print(a)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
#create date: 2020-06-27 21:00

import sys
stdin = sys.stdin

def ns(): return stdin.readline().rstrip()
def ni(): return int(ns())
def na(): return list(map(int, stdin.readline().split()))

def g(n):
    return n * (n+1) // 2

def main():
    n = ni()
    ans = 0
    for i in range(1, n+1):
        ans += i * g(n//i)
    print(ans)


if __name__ == "__main__":
    main()

Submission status: Wrong Answer

Solution code:
n=int(input())
 
ans=0
for i in range(n):
  i=i+1
  a=i
  y=n//i
 
  ans+=(i*y*(y+1)/2)
 
 
 
print(ans)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import sys

read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines

def main(N):
    x = 0
    for a in range(1, N+1):
        for b in range(a, N+1, a):
            x += b
    return x

if sys.argv[-1] == 'ONLINE_JUDGE':
    import numba
    from numba.pycc import CC
    i8 = numba.int64
    cc = CC('my_module')

    def cc_export(f, signature):
        cc.export(f.__name__, signature)(f)
        return numba.njit(f)

    main = cc_export(main, (i8, ))
    cc.compile()

from my_module import main

N = int(read())
print(main(N))

Submission status: Wrong Answer

Solution code:
a = int(input())
if a == 1:
  print(3)
elif a == 2:
  print(14)
elif a == 3:
  print(39)
elif a == 4:
  print(84)
elif a == 5:
  print(155)
elif a == 6:
  print(238)
elif a == 7:
  print(399)
elif a == 8:
  print(584)
elif a == 9:
  print(819)
elif a == 10:
  print(1110)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
# Python3 program to count 
# number of factors 
# of an array of integers 
MAX = 1000001; 

# array to store 
# prime factors 
factor = [0]*(MAX + 1); 

# function to generate all 
# prime factors of numbers 
# from 1 to 10^6 
def generatePrimeFactors(): 
	factor[1] = 1; 

	# Initializes all the 
	# positions with their value. 
	for i in range(2,MAX): 
		factor[i] = i; 

	# Initializes all 
	# multiples of 2 with 2 
	for i in range(4,MAX,2): 
		factor[i] = 2; 

	# A modified version of 
	# Sieve of Eratosthenes 
	# to store the smallest 
	# prime factor that divides 
	# every number. 
	i = 3; 
	while(i * i < MAX): 
		# check if it has 
		# no prime factor. 
		if (factor[i] == i): 
			# Initializes of j 
			# starting from i*i 
			j = i * i; 
			while(j < MAX): 
				# if it has no prime factor 
				# before, then stores the 
				# smallest prime divisor 
				if (factor[j] == j): 
					factor[j] = i; 
				j += i; 
		i+=1; 

# function to calculate 
# number of factors 
def calculateNoOFactors(n): 
	if (n == 1): 
		return 1; 
	ans = 1; 

	# stores the smallest 
	# prime number that 
	# divides n 
	dup = factor[n]; 

	# stores the count of 
	# number of times a 
	# prime number divides n. 
	c = 1; 

	# reduces to the next 
	# number after prime 
	# factorization of n 
	j = int(n / factor[n]); 

	# false when prime 
	# factorization is done 
	while (j > 1): 
		# if the same prime 
		# number is dividing 
		# n, then we increase 
		# the count 
		if (factor[j] == dup): 
			c += 1; 

		# if its a new prime factor 
		# that is factorizing n, 
		# then we again set c=1 and 
		# change dup to the new prime 
		# factor, and apply the formula 
		# explained above. 
		else: 
			dup = factor[j]; 
			ans = ans * (c + 1); 
			c = 1; 

		# prime factorizes 
		# a number 
		j = int(j / factor[j]); 

	# for the last 
	# prime factor 
	ans = ans * (c + 1); 

	return ans; 



n=int(input())

generatePrimeFactors()
ans=0
for i in range(1,n+1):
    ans+=calculateNoOFactors(i)*i
    


print(ans)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
n=int(input())
A=[1]*(n+1)
A[1]=1
for i in range(2,n+1):
    for j in range(i,n+1,i):
        A[j]+=1
A[1]=1
sum=0
for i in range(1,n+1):
    sum+=i*A[i]
print(sum)

Submission status: Wrong Answer

Solution code:
num = int(input())
ans = 0

def divisor(n): 
    i = 1
    table = []
    while i * i <= n:
        if n%i == 0:
            table.append(i)
            table.append(n//i)
        i += 1
    table = list(set(table))
    return table

yaku_list = [len(divisor(i)) for i in range(1,num+1)]

for i,j in enumerate(yaku_list):
    ans += int(i+1) * int(j)
print(ans)

Submission status: Wrong Answer

Solution code:
n = int(input())

answer = [0 for i in range(0, n+1)]
answer[1] = 1

small_factors = [1]
p = 1
while (p < n):
    p = p + 1
    if answer[p] is 0:
        #print("\n\nPrime: " + str(p))
        limit = n / p
        new_small_factors = []
        for i in small_factors:
            j = i
            while j <= limit:
                new_small_factors.append(j)
                answer[j * p] = answer[j] + answer[i]
                j = j * p
        small_factors = new_small_factors
ans = 0;
for i,k in enumerate(answer):
    if k==None:
        continue
    ans+=((i)*(k))
print(ans)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:


a = int(input("\n"))

if a >= 10:
    print("Number too big")

elif a < 1:
    print("Number too small")
    
else:
    print(int(a + (a**2) + (a**3)))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
a=int(input())
l = [a**i for i in range(4)]
print(l)
print(sum(l)-1)

Submission status: Wrong Answer

Solution code:
N = int(input()) #ここで標準入力
print (type(N), N+N*N+N*N*N)

Submission status: Wrong Answer

Solution code:


a = int(input("\n"))

if a >= 10:
    print("Number too big")

elif a < 1:
    print("Number too small")
    
else:
    print(a + (a**2) + (a**3))

Submission status: Wrong Answer

Solution code:
import random
a=random.randint(1,10)
print(str(a+a*a+a*a*a))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import random
a=random.randint(1,11)
print(str(a+a*a+a*a*a))

Submission status: Wrong Answer

Solution code:


a = int(input("\n"))

if a >= 10:
    print("Number too big")

elif a <= 1:
    print("Number too small")
    
else:
    print(a + (a**2) + (a**3))

Submission status: Wrong Answer

Solution code:
import sys
import math
import numpy as np
import functools
import operator
import collections
import itertools
#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())
ans=0
for i in range(1,N+1):
    ans+=i*len(make_divisors(i))
print(ans)

Submission status: Wrong Answer

Solution code:

def cal(a):
  return int(a+a*a+a*a*a)

Submission status: Wrong Answer

Solution code:
import random

Z = (1,2,3,4,5,6,7,8,9,10)
a=random.choice(Z)
print(str(a+a*a+a*a*a))

Submission status: Wrong Answer

Solution code:
a = int(input())
sum = 0
for i in range(a):
    sum += a ** (i+1)
    if i == 2:
        break
print(int(sum))

Submission status: Wrong Answer

Solution code:


a = int(input("\n"))

if a >= 10:
    print("Number too big")

elif a <= 0:
    print("Number too small")
    
else:
    print(a + (a**2) + (a**3))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
a = int(input("Enter a number: \n"))

if a >= 10:
    print("Number too big")
   
elif a <= 0:
    print("Number too small")
    
else:
    print(a + (a**2) + (a**3))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
def cal():
  a = str(input())
  n = a + a**2 + a**3
  print(n)

Submission status: Wrong Answer

Solution code:
def cal():
  a=str(input())
  s=a+a**2+a**3
  return s

Submission status: Wrong Answer

Solution code:
a = int(input("Enter a number: \n"))

if a >= 10:
    print("Number too big")
else:
    print(a + (a**2) + (a**3))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
a = 2

def calc(a):
	step2 = a**2
	step3 = a**3	
	return int(a+step2+step3)

print(calc(a))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
# coding: utf-8

inpnum = int(input())

sum = lambda n,t : n * t

print(sum(inpnum, 6))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
a = int(input())

a = a + a**2 + a**3

Submission status: Wrong Answer

Solution code:
a = int(input())

a = a + a^2 + a^3

Submission status: Wrong Answer

Solution code:
import sys
input = sys.stdin.readline
#-------------------------------------

c = int(input())
print( c*6 )

Submission status: Wrong Answer

Solution code:
A = int(input("Input a value for 'a': "))
FINAL = A + (A*A) + (A*A*A)
print(FINAL)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
a = int(input(">> "))

def calc(a):
	step2 = a**2
	step3 = a**3	
	return int(a+step2+step3)

print(calc(a))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
a = int(input())

print(a + a^2 + a^3)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import math

a = int(input())
b = a**a
c = b*a
d = a+b+c
print(d)

Submission status: Wrong Answer

Solution code:
def calc(num):
    return num+(num**2)+(num**3)

def start():
    num = int(input())
    return calc(num)

start()

Submission status: Wrong Answer

Solution code:
a=input()

a1=int(a)

print(int(a1+(a1**a1)+(a1*a1*a1)))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import sys

if __name__ == '__main__':
    a = int(sys.stdin.readline())
    print(a*(a**2)*(a**3))

Submission status: Wrong Answer

Solution code:
a=input()

a1=int(a)

print(a1+(a1**a1)+(a1*a1*a1))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
a = int(input())

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

Submission status: Wrong Answer

Solution code:
a = int(input())

ans = a + a^2 + a^3
ans = int(ans)

print(ans)

Submission status: Wrong Answer

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


def main():
    a = int(input())
    print(a+a^2+a^3)


if __name__ == '__main__':
    main()

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
from typing import List

LOCAL = False

if LOCAL:
    import os
    import sys
    import time
    start = time.time()
    # For getting input from input.txt file
    letter = "A"
    sys.stdin = open(f'{letter}in.txt', 'r')

    # Printing the Output to output.txt file
    sys.stdout = open(f'{letter}out.txt', 'w')

#### START ####


def calculate(s: int):
    print(s + s**2 + s**3)

s = int(input())

#### END ####
if LOCAL:
    print('TIME:', time.time()-start, 'sec.')

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
a = int(input())

print(int(a*(a*(a+1))))

Submission status: Wrong Answer

Solution code:
2

Submission status: Wrong Answer

Solution code:
a = int(input())

ans = a + a^2 + a^3

print(ans)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
#!usr/bin/env pypy3
from collections import defaultdict, deque
from heapq import heappush, heappop
from itertools import permutations, accumulate
import sys
import math
import bisect
def LI(): return [int(x) for x in sys.stdin.readline().split()]
def I(): return int(sys.stdin.readline())
def LS():return [list(x) for x in sys.stdin.readline().split()]
def S():
    res = list(sys.stdin.readline())
    if res[-1] == "\n":
        return res[:-1]
    return res
def IR(n):
    return [I() for i in range(n)]
def LIR(n):
    return [LI() for i in range(n)]
def SR(n):
    return [S() for i in range(n)]
def LSR(n):
    return [LS() for i in range(n)]

sys.setrecursionlimit(1000000)

def main():
    s = input()
    print(s)

main()

Submission status: Wrong Answer

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


if __name__ == "__main__":
    _main(int(input()))