TnT/Multi_CodeNet4Repair huggingface dataset:
Problem: Takahashi is going to buy N items one by one.  The price of the i-th item he buys is A_i yen (the currency of Japan).  He has M discount tickets, and he can use any number of them when buying an item.  If Y tickets are used when buying an item priced X yen, he can get the item for \frac{X}{2^Y} (rounded down to the nearest integer) yen.  What is the minimum amount of money required to buy all the items?

Submission attempts (in order):
import math
import heapq

N, M = map(int, input().split(" "))
A = [-int(_) for _ in input().split(" ")]

for i in range(M):
    print(A)
    heapq.heapify(A)
    heapq.heappush(A, -(-heapq.heappop(A)// 2))

print(-sum(A))

import heapq

N, M = map(int, input().split(" "))
A = [-int(_) for _ in input().split(" ")]

heapq.heapify(A)

for i in range(M):
    heapq.heappush(A, -(-heapq.heappop(A)// 2))
    
print(-sum(A))

Verdicts: Runtime Error

Accepted
Problem: Takahashi is going to buy N items one by one.  The price of the i-th item he buys is A_i yen (the currency of Japan).  He has M discount tickets, and he can use any number of them when buying an item.  If Y tickets are used when buying an item priced X yen, he can get the item for \frac{X}{2^Y} (rounded down to the nearest integer) yen.  What is the minimum amount of money required to buy all the items?

Submission attempts (in order):
N,M = map(int,input().split())
A =list(map(int,input().split()))
A.sort(reverse=True)
A_len =len(A)
count =0
for l in range(0,M):
    comp = A[0]/2
    for i in range(0,A_len,1):
        if count => M:
            break
        if A[i+1]<comp:
            break
        while True:
            count +=1
            if A[i]/2 > A[i+1]:
                A[i] = A[i]/2
            else:
                A[i] = A[i]/2
                break
    A.sort(reverse=True)
    if count=>M:
        break
A = [int(i) for i in A]
sumN =sum(A)
print(sumN)

N,M = map(int,input().split())
A =list(map(int,input().split()))
A.sort(reverse=True)
A_len =len(A)
count =0
for l in range(0,M):
    comp = A[0]/2
    for i in range(0,A_len-1,1):
        if count => M:
            break
        if A[i+1]<comp:
            break
        while True:
            count +=1
            if A[i]/2 > A[i+1]:
                A[i] = A[i]/2
            else:
                A[i] = A[i]/2
                break
    A.sort(reverse=True)
    if count=>M:
        break
A = [int(i) for i in A]
sumN =sum(A)
print(sumN)

N,M = map(int,input().split())
A =list(map(int,input().split()))
A.sort(reverse=True)
A_len =len(A)
count =0
if A_len ==1:
    for l in range(0,M):
        A[0]=A[0]/2
else:
    for l in range(0,M):
        comp = A[0]/2
        for i in range(0,A_len-1,1):
            if count >= M:
                break
            if A[i+1]<comp:
                break
            while True:
                count +=1
                if A[i]/2 > A[i+1]:
                    A[i] = A[i]/2
                else:
                    A[i] = A[i]/2
                    break
        A.sort(reverse=True)
        if count>=M:
            break
A = [int(i) for i in A]
sumN =sum(A)
print(sumN)

Verdicts: Runtime Error

Runtime Error

Accepted
Problem: Takahashi is going to buy N items one by one.  The price of the i-th item he buys is A_i yen (the currency of Japan).  He has M discount tickets, and he can use any number of them when buying an item.  If Y tickets are used when buying an item priced X yen, he can get the item for \frac{X}{2^Y} (rounded down to the nearest integer) yen.  What is the minimum amount of money required to buy all the items?

Submission attempts (in order):
n, m = map(int, input().split())
a = list(map(int, input().split()))

for m_num in range(m):
    max_index = a.index(max(a))
    a[max_index] = a[max_index] / 2

print(sum(a))


import heapq
def calc_Inversion(num):
    return num * -1

n, m = map(int, input().split())
a = list(map(calc_Inversion, list(map(int, input().split()))))

heapq.heapify(a)

for m_num in range(m):
    heapq.heappush(a, int(heapq.heappop(a) / 2))

print(sum(a) * -1)


Verdicts: Wrong Answer

Accepted
Problem: Takahashi is going to buy N items one by one.  The price of the i-th item he buys is A_i yen (the currency of Japan).  He has M discount tickets, and he can use any number of them when buying an item.  If Y tickets are used when buying an item priced X yen, he can get the item for \frac{X}{2^Y} (rounded down to the nearest integer) yen.  What is the minimum amount of money required to buy all the items?

Submission attempts (in order):
import heapq
n, m = map(int, input().split())
a = list(map(lambda x: int(x) * (-1), a))
heapq.heapify(a)
for _ in range(m):
    min = ((heapq.heappop(a) * (-1)) // 2) * (-1)
    heapq.heappush(a, min)
print(sum(a)*(-1))

import heapq
n, m = map(int, input().split())
a = list(map(lambda x: int(x) * (-1), input().split()))
heapq.heapify(a)
for _ in range(m):
    min = ((heapq.heappop(a) * (-1)) // 2) * (-1)
    heapq.heappush(a, min)
print(sum(a)*(-1))

Verdicts: Runtime Error

Accepted
Problem: Takahashi is going to buy N items one by one.  The price of the i-th item he buys is A_i yen (the currency of Japan).  He has M discount tickets, and he can use any number of them when buying an item.  If Y tickets are used when buying an item priced X yen, he can get the item for \frac{X}{2^Y} (rounded down to the nearest integer) yen.  What is the minimum amount of money required to buy all the items?

Submission attempts (in order):
from heapq import heapify, heappush, heappop
N, M = map(int, input().split())
A = list(map(int, input().split()))
A = list(map(lambda x: -x, A))
heapify(A)
print(A)
for i in range(M):
    mx = heappop(A)
    heappush(A, (-1)*(-mx//2))
A = list(map(lambda x: -x, A))
print(sum(A))

from heapq import heapify, heappush, heappop
N, M = map(int, input().split())
A = list(map(int, input().split()))
A = list(map(lambda x: -x, A))
heapify(A)
for i in range(M):
    mx = heappop(A)
    heappush(A, (-1)*(-mx//2))
A = list(map(lambda x: -x, A))
print(sum(A))

Verdicts: Wrong Answer

Accepted
Problem: Takahashi is going to buy N items one by one.  The price of the i-th item he buys is A_i yen (the currency of Japan).  He has M discount tickets, and he can use any number of them when buying an item.  If Y tickets are used when buying an item priced X yen, he can get the item for \frac{X}{2^Y} (rounded down to the nearest integer) yen.  What is the minimum amount of money required to buy all the items?

Submission attempts (in order):
import numpy as np
import math

n, m = map(int, input().split(' '))
prices = np.array(list(map(int, input().split(' '))))

for _ in range(m):
    max_i = prices.argmax()
    prices[max_i] = prices[max_i] / 2

total = 0
for price in prices:
    total += math.floor(price)
total

import math
from heapq import heapify, heappush, heappop

n, m = map(int, input().split(' '))

# invert sign of p to get max value
prices = [ -p for p in map(int, input().split(' ')) ]
heapify(prices)

for _ in range(m):
    p = heappop(prices)
    heappush(prices, p / 2)

total = 0
while prices:
    total += math.floor(-heappop(prices))
print(total)

Verdicts: Wrong Answer

Accepted
Problem: Takahashi is going to buy N items one by one.  The price of the i-th item he buys is A_i yen (the currency of Japan).  He has M discount tickets, and he can use any number of them when buying an item.  If Y tickets are used when buying an item priced X yen, he can get the item for \frac{X}{2^Y} (rounded down to the nearest integer) yen.  What is the minimum amount of money required to buy all the items?

Submission attempts (in order):
import math
import heapq

N, M = list(map(int, input().split()))
A = list(map(lambda a: -int(a), input().split()))
A.sort()
heapq.heapify(A)

for i in range(M):
  a = heapq.heappop(A)
  a =/ 2.0
  heapq.heappush(A, a)

amount = 0
for a in A:
  amount += math.floor(-a)
print(amount)


import math
import heapq

N, M = list(map(int, input().split()))
A = list(map(lambda a: -int(a), input().split()))
A.sort()
heapq.heapify(A)

for i in range(M):
  a = heapq.heappop(A)
  a /= 2.0
  heapq.heappush(A, a)

amount = 0
for a in A:
  amount += math.floor(-a)
print(amount)

Verdicts: Runtime Error

Accepted
Problem: Takahashi is going to buy N items one by one.  The price of the i-th item he buys is A_i yen (the currency of Japan).  He has M discount tickets, and he can use any number of them when buying an item.  If Y tickets are used when buying an item priced X yen, he can get the item for \frac{X}{2^Y} (rounded down to the nearest integer) yen.  What is the minimum amount of money required to buy all the items?

Submission attempts (in order):
n,m=map(int,input().split())
a=list(map(int,input().split()))
x=0
for i in range(m+1):
  a.sort(reverse=1)
  print(a)
  x=a[0]//2
  a[0]=x
print(sum(a))  

n,m=map(int,input().split())
a=list(map(int,input().split()))
x=0
for i in range(m+1):
  a.sort(reverse=1)
  x=a[0]//2
  a[0]=x
print(sum(a))  

import heapq

n,m=map(int,input().split())
a=list(map(int,input().split()))
a=list(map(lambda x: x*(-1), a))
heapq.heapify(a)
for _ in range(m):
  x=heapq.heappop(a)
  x=((x*(-1))//2)*(-1)
  heapq.heappush(a,x)










print(sum(a)*(-1))



Verdicts: Runtime Error

Wrong Answer

Accepted
Problem: Takahashi is going to buy N items one by one.  The price of the i-th item he buys is A_i yen (the currency of Japan).  He has M discount tickets, and he can use any number of them when buying an item.  If Y tickets are used when buying an item priced X yen, he can get the item for \frac{X}{2^Y} (rounded down to the nearest integer) yen.  What is the minimum amount of money required to buy all the items?

Submission attempts (in order):
obj = input().strip().split(' ')
N, M = map(int, obj)

obj = input().strip().split(' ')
val_list = [-1 * item for item in list(map(int, obj))]

heapify(val_list)

for _ in range(M):
    val = (-1) * ((heappop(val_list) * (-1)) // 2)
    heappush(val_list, val)

print(-1 * sum(val_list))


from heapq import heappush, heappop, heapify

obj = input().strip().split(' ')
N, M = map(int, obj)

obj = input().strip().split(' ')
val_list = [-1 * item for item in list(map(int, obj))]

heapify(val_list)

for _ in range(M):
    val = (-1) * ((heappop(val_list) * (-1)) // 2)
    heappush(val_list, val)

print(-1 * sum(val_list))


Verdicts: Runtime Error

Accepted
Problem: Takahashi is going to buy N items one by one.  The price of the i-th item he buys is A_i yen (the currency of Japan).  He has M discount tickets, and he can use any number of them when buying an item.  If Y tickets are used when buying an item priced X yen, he can get the item for \frac{X}{2^Y} (rounded down to the nearest integer) yen.  What is the minimum amount of money required to buy all the items?

Submission attempts (in order):
import heapq as hq

n,m = map(int, input().split())

items = [-1*map(int, input().split()] 

hq.heapify(items)
             
for i in range(m):
	pop = hq.heapqpop(items)
    hq.heapqpush(items, pop//2)
              
return -1*sum(hq)
  

import heapq
 
n,m = map(int, input().split())

items = list(map(lambda x:int(x)*(-1), input().split()))
heapq.heapify(items)
             
for i in range(m):
    pop = heapq.heappop(items)
    heapq.heappush(items, pop//2)

print(-1*sum(items))

import heapq
 
n,m = map(int, input().split())

items = list(map(lambda x:int(x)*(-1), input().split()))
heapq.heapify(items)
             
for i in range(m):
    pop = heapq.heappop(items)*(-1)//2
    heapq.heappush(items, pop*(-1))

print(-1*sum(items))

Verdicts: Runtime Error

Wrong Answer

Accepted
Problem: Takahashi is going to buy N items one by one.  The price of the i-th item he buys is A_i yen (the currency of Japan).  He has M discount tickets, and he can use any number of them when buying an item.  If Y tickets are used when buying an item priced X yen, he can get the item for \frac{X}{2^Y} (rounded down to the nearest integer) yen.  What is the minimum amount of money required to buy all the items?

Submission attempts (in order):
import heapq

N,M = map(int,input().split(" "))
nums = map(int,input().split(" "))

nums = [n * -1 for n in nums]
heapq.heapify(nums)

while M > 0:
    curr = heapq.heappop(nums)
    heapq.heappush(nums,curr//2)
    M -=1

print(-sum(nums))

import heapq

N,M = map(int,input().split(" "))
nums = map(int,input().split(" "))

nums = [n * -1 for n in nums]
heapq.heapify(nums)

while M > 0:
    curr = -heapq.heappop(nums)
    heapq.heappush(nums,-(curr//2))
    M -=1

print(-sum(nums))

Verdicts: Wrong Answer

Accepted
Problem: Takahashi is going to buy N items one by one.  The price of the i-th item he buys is A_i yen (the currency of Japan).  He has M discount tickets, and he can use any number of them when buying an item.  If Y tickets are used when buying an item priced X yen, he can get the item for \frac{X}{2^Y} (rounded down to the nearest integer) yen.  What is the minimum amount of money required to buy all the items?

Submission attempts (in order):
import heapq

N,M = map(int, input().split())
L = [-int(i) for i in input().split()]
heapq.heapify(L)


print(L)


for i in range(M):
    h = -(-heapq.heappop(L) // 2)
 
    heapq.heappush(L,h)

print(-sum(L))

import heapq

N,M = map(int, input().split())
L = [-int(i) for i in input().split()]
heapq.heapify(L)



for i in range(M):
    h = -(-heapq.heappop(L) // 2)
 
    heapq.heappush(L,h)

print(-sum(L))

Verdicts: Wrong Answer

Accepted
Problem: Takahashi is going to buy N items one by one.  The price of the i-th item he buys is A_i yen (the currency of Japan).  He has M discount tickets, and he can use any number of them when buying an item.  If Y tickets are used when buying an item priced X yen, he can get the item for \frac{X}{2^Y} (rounded down to the nearest integer) yen.  What is the minimum amount of money required to buy all the items?

Submission attempts (in order):
import heapq
n,m = map(int,input().split())
arr= list(map(lambda x: int(x)*(-1) ,input().split()))
heapq.heapify(arr)
for i in range(m):
    d = heapq.heappop(arr)
    heapq.heappush(arr,d//2)
print(sum(arr)*-1)
    

n,m = map(int,input().split())
arr= list(map(int,input().split()))

while m > 0: 
    arr[arr.index(max(arr))] = max(arr)//2
    m -= 1
    
print(arr)


import heapq
n,m = map(int,input().split())
arr= list(map(lambda x: int(x)*(-1) ,input().split()))
heapq.heapify(arr)
for i in range(m):
    d = heapq.heappop(arr)
    heapq.heappush(arr,-( -d//2))
print(sum(arr)*-1)
print(arr)   

import heapq
n,m = map(int,input().split())
arr= list(map(lambda x: int(x)*(-1) ,input().split()))
heapq.heapify(arr)
for i in range(m):
    d = heapq.heappop(arr)
    heapq.heappush(arr,-( -d//2))
print(sum(arr)*-1)

Verdicts: Wrong Answer

Wrong Answer

Wrong Answer

Accepted
Problem: We have N non-negative integers: A_1, A_2, ..., A_N.  Consider painting at least one and at most N-1 integers among them in red, and painting the rest in blue.  Let the _beauty_ of the painting be the \mbox{XOR} of the integers painted in red, plus the \mbox{XOR} of the integers painted in blue.  Find the maximum possible beauty of the painting.  What is \mbox{XOR}?  The bitwise \mbox{XOR} x_1 \oplus x_2 \oplus \ldots \oplus x_n of n non- negative integers x_1, x_2, \ldots, x_n is defined as follows:    * When x_1 \oplus x_2 \oplus \ldots \oplus x_n is written in base two, the digit in the 2^k's place (k \geq 0) is 1 if the number of integers among x_1, x_2, \ldots, x_n whose binary representations have 1 in the 2^k's place is odd, and 0 if that count is even.   For example, 3 \oplus 5 = 6.

Submission attempts (in order):
import numpy as np

N = int(input())
A = np.array([int(x) for x in input().split()],dtype=np.int64)



xor = np.bitwise_xor.reduce(A)

A = np.concatenate([np.array([1<<i for i in range(60) if xor&(1<<i)],np.int64),A])

for k in range(60,-1,-1):
    bit = 1<<k
    one = (A&bit != 0)
    i = np.where(one & (A < (1<<(k+1))))[0]
    if len(i) == 0:
        continue
    i = i[0]
    x = A[i]
    A[one] ^= x
    A[i] = x

from numpy import *
N=int(input())
A=array(input().split(),int64)
f=bitwise_xor.reduce
X=f(A)
A=hstack(([1<<i for i in range(60)if X>>i],A))
for k in range(60)[::-1]:
  b=1<<k
  j=A&b!=0
  i=where(j&(A<2*b))[0]
  if len(i):i=i[0];x=A[i];A[j]^=x;A[i]=x
r=f(A)
print(r+(r^X))

from numpy import *
f=bitwise_xor.reduce
N=int(input())
A=array(input().split(),int64)
X=f(A)
A=hstack((A,array([1<<i for i in range(60)if X&(1<<i)],int64)))
for k in range(60)[::-1]:
  b=1<<k
  j=A&b!=0
  i=where(j&(A<2*b))[0]
  if len(i):i=i[0];x=A[i];A[j]^=x;A[i]=x
r=f(A)
print(r+(r^X))

Verdicts: Wrong Answer

Runtime Error

Accepted
Problem: We have N non-negative integers: A_1, A_2, ..., A_N.  Consider painting at least one and at most N-1 integers among them in red, and painting the rest in blue.  Let the _beauty_ of the painting be the \mbox{XOR} of the integers painted in red, plus the \mbox{XOR} of the integers painted in blue.  Find the maximum possible beauty of the painting.  What is \mbox{XOR}?  The bitwise \mbox{XOR} x_1 \oplus x_2 \oplus \ldots \oplus x_n of n non- negative integers x_1, x_2, \ldots, x_n is defined as follows:    * When x_1 \oplus x_2 \oplus \ldots \oplus x_n is written in base two, the digit in the 2^k's place (k \geq 0) is 1 if the number of integers among x_1, x_2, \ldots, x_n whose binary representations have 1 in the 2^k's place is odd, and 0 if that count is even.   For example, 3 \oplus 5 = 6.

Submission attempts (in order):
import numpy as np
from numpy.fft import fft, ifft
from bisect import bisect_left
import sys
Max = 10**6
N, M = map(int, input().split())
A = list(map(int, input().split()))
B = list(map(int, input().split()))
C = np.zeros(Max+1)
D = np.zeros(Max+1)
for a in A:
    C[a] +=1
for b in B:
    D[b]+=1
L = 2**8
res = ifft(fft(C, L)*fft(D, L))
res = np.where(res>1.5)
if res[0].size == 0:
    print(-1)
    sys.exit()
res = res[0][-1]
B.sort()
ans  = []
for i, a in enumerate(A):
    j = bisect_left(B, res-a)
    b = B[j]
    if b == res-a:
        ans.append(i)
        ans.append(j)
    if len(ans) == 4:
        break
if len(ans) < 4:
    print(liahbcon)
print(*ans)    
    


import numpy as np
from numpy.fft import rfft, irfft
from bisect import bisect_left
import sys
Max = 10**6
N, M = map(int, input().split())
A = list(map(int, input().split()))
B = list(map(int, input().split()))
C = np.zeros(Max+1)
D = np.zeros(Max+1)
for a in A:
    C[a] +=1
for b in B:
    D[b]+=1
L = 2**8
res = irfft(rfft(C, L)*rfft(D, L))
res = np.where(res>1.4)
if res[0].size == 0:
    print(ahfkgashg)
    sys.exit()
res = res[0][-1]
B.sort()
ans  = []
for i, a in enumerate(A):
    j = bisect_left(B, res-a)
    b = B[j]
    if b == res-a:
        ans.append(i)
        ans.append(j)
    if len(ans) == 4:
        break
if len(ans) < 4:
    print(liahbcon)
print(*ans)    
    


import numpy as np
N = int(input())
A = np.array(list(map(int, input().split())), dtype = np.int64)
a = np.bitwise_xor.reduce(A)
for i in range(60):
    bit = 1<<i
    if bit & a:
        A^=(A&bit)
for k in range(60, -1, -1):
    bit = 1<<k
    one = (A&bit != 0)
    i = np.where(one & (A < (1<<(k+1))))[0]
    if len(i) == 0:
        continue
    i = i[0]
    x = A[i]
    A[one]^=x
    A[i] = x
b = np.bitwise_xor.reduce(A)
a^=b
print(a+b)

Verdicts: Runtime Error

Runtime Error

Accepted
Problem: We have N non-negative integers: A_1, A_2, ..., A_N.  Consider painting at least one and at most N-1 integers among them in red, and painting the rest in blue.  Let the _beauty_ of the painting be the \mbox{XOR} of the integers painted in red, plus the \mbox{XOR} of the integers painted in blue.  Find the maximum possible beauty of the painting.  What is \mbox{XOR}?  The bitwise \mbox{XOR} x_1 \oplus x_2 \oplus \ldots \oplus x_n of n non- negative integers x_1, x_2, \ldots, x_n is defined as follows:    * When x_1 \oplus x_2 \oplus \ldots \oplus x_n is written in base two, the digit in the 2^k's place (k \geq 0) is 1 if the number of integers among x_1, x_2, \ldots, x_n whose binary representations have 1 in the 2^k's place is odd, and 0 if that count is even.   For example, 3 \oplus 5 = 6.

Submission attempts (in order):
import sys
input = sys.stdin.readline

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

XOR=0
for a in A:
    XOR^=a

for i in range(N):
    A[i] &=~XOR
    
USED=[0]*60

for bi in range(60,-1,-1):
    for i in range(N):
        if USED[i]==0 and A[i] & (1<<bi)!=0:
            USED[i]=1
            useind=i
            break
    else:
        continue

    for i in range(N):
        if i==useind:
            continue
        if A[i] & (1<<bi)!=0:
            A[i]^=A[useind]
            print(A[i],A[useind])
            
ANS=0
for a in A:
    ANS^=a

print(2*ANS+XOR)


import sys
input = sys.stdin.readline

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

XOR=0
for a in A:
    XOR^=a

for i in range(N):
    A[i] &=~XOR
    
USED=[0]*N

for bi in range(60,-1,-1):
    for i in range(N):
        if USED[i]==0 and A[i] & (1<<bi)!=0:
            USED[i]=1
            useind=i
            break
    else:
        continue

    for i in range(N):
        if i==useind:
            continue
        if A[i] & (1<<bi)!=0:
            A[i]^=A[useind]
            
ANS=0
for a in A:
    ANS^=a

print(2*ANS+XOR)


Verdicts: Runtime Error

Accepted
Problem: Takahashi is going to set a 3-character password.  How many possible passwords are there if each of its characters must be a digit between 1 and N (inclusive)?

Submission attempts (in order):
n=int(input())

print(n**n**n)

n=int(input())

if n == 1:
  print(1)
else:
  print(n**n)

n=int(input())

if n == 1:
  print(1)
else:
  print(n**3)

Verdicts: Wrong Answer

Wrong Answer

Accepted
Problem: Takahashi is going to set a 3-character password.  How many possible passwords are there if each of its characters must be a digit between 1 and N (inclusive)?

Submission attempts (in order):
print=(input()**3)

print(int(input())**3)

Verdicts: Runtime Error

Accepted
Problem: Takahashi is going to set a 3-character password.  How many possible passwords are there if each of its characters must be a digit between 1 and N (inclusive)?

Submission attempts (in order):
N = int(input())
print(N ＊＊ 3)


N = int(input())
print(N ** 3)


Verdicts: Runtime Error

Accepted
Problem: Takahashi is going to set a 3-character password.  How many possible passwords are there if each of its characters must be a digit between 1 and N (inclusive)?

Submission attempts (in order):
n = int(input())

print(n^3)

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

Verdicts: Wrong Answer

Accepted
Problem: Takahashi is going to set a 3-character password.  How many possible passwords are there if each of its characters must be a digit between 1 and N (inclusive)?

Submission attempts (in order):
n=int(input())
print(s**3)

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

Verdicts: Runtime Error

Accepted
Problem: Takahashi is going to set a 3-character password.  How many possible passwords are there if each of its characters must be a digit between 1 and N (inclusive)?

Submission attempts (in order):
N = int(input())

print(9**N)

N = int(input())

print(N**3)

Verdicts: Wrong Answer

Accepted
Problem: Takahashi is going to set a 3-character password.  How many possible passwords are there if each of its characters must be a digit between 1 and N (inclusive)?

Submission attempts (in order):
N=int(input("N="))
r=N**3
print(r)

N=int(input())
r=N**3
print(r)

Verdicts: Wrong Answer

Accepted
Problem: Takahashi is going to set a 3-character password.  How many possible passwords are there if each of its characters must be a digit between 1 and N (inclusive)?

Submission attempts (in order):
n=int(input())
A=list(map(int,input().split()))
B=list(map(int,input().split()))
C=list(map(int,input().split()))
ans=B[A[0]-1]
for i in range(1,n):
  ans+=B[A[i]-1]
  if A[i-1]+1==A[i]:
    ans+=C[i-1]
print(ans)


print(int(input())**3)

Verdicts: Runtime Error

Accepted
Problem: Takahashi is going to set a 3-character password.  How many possible passwords are there if each of its characters must be a digit between 1 and N (inclusive)?

Submission attempts (in order):
print(int(input()**3))

print(int(input())**3)

Verdicts: Runtime Error

Accepted
Problem: Takahashi is going to set a 3-character password.  How many possible passwords are there if each of its characters must be a digit between 1 and N (inclusive)?

Submission attempts (in order):
140 proA
N = int(input())
ans = 0
for i in range(N):
	for j in range(N):
		for t in range(N):
			ans+=1
print(ans)

N = int(input())
A = list(map(int, input().split()))
B = list(map(int, input().split()))
C = list(map(int, input().split()))
A.append()
B.append()
ans=0
for i in range(1,N+1):
	ans+=B[A[i-1]-1]
	if A[i-1]==A[i]-1:
		ans+=C[A[i-2]]
print(ans)


N = int(input())
ans = 0
for i in range(N):
	for j in range(N):
		for t in range(N):
			ans+=1
print(ans)

Verdicts: Runtime Error

Runtime Error

Accepted
Problem: Takahashi is going to set a 3-character password.  How many possible passwords are there if each of its characters must be a digit between 1 and N (inclusive)?

Submission attempts (in order):

n=int(input())
print(N**3)


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

Verdicts: Runtime Error

Accepted
Problem: Takahashi is going to set a 3-character password.  How many possible passwords are there if each of its characters must be a digit between 1 and N (inclusive)?

Submission attempts (in order):
x = int(input())
print(x^3)

x = int(input())
print(x**3)

Verdicts: Wrong Answer

Accepted
Problem: Takahashi is going to set a 3-character password.  How many possible passwords are there if each of its characters must be a digit between 1 and N (inclusive)?

Submission attempts (in order):
N = int(input())
A = list(map(int,input().split()))
B = list(map(int,input().split()))
C = list(map(int,input().split()))
sumc = 0

for count in range(N-1):
    if A[count+1] - A[count] == 1:
        sumc = sumc + C[A[count]-1]

print(sumc + sum(B))


N = int(input())

print(N*N*N)

Verdicts: Runtime Error

Accepted
Problem: Takahashi is going to set a 3-character password.  How many possible passwords are there if each of its characters must be a digit between 1 and N (inclusive)?

Submission attempts (in order):
import math
N=int(input())
print(math.factorial(N)/math.factorial(N-3)

N=int(input())
print(N**3)

Verdicts: Runtime Error

Accepted
Problem: Takahashi is going to set a 3-character password.  How many possible passwords are there if each of its characters must be a digit between 1 and N (inclusive)?

Submission attempts (in order):
N=int(input())
A=list(map(int,input().split()))
B=list(map(int,input().split()))
C=list(map(int,input().split()))

res=0
back=0

for a in A:
	res=res+B[a-1]					
	if back==a-1 and a!=len(A):		
		res=res+C[back-1]			
	back=a
    
print(res)

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

Verdicts: Runtime Error

Accepted
Problem: Takahashi is going to set a 3-character password.  How many possible passwords are there if each of its characters must be a digit between 1 and N (inclusive)?

Submission attempts (in order):
# -*- coding: UTF-8 -*-

import math

n = int (input())
print(math.factorial(n))


# -*- coding: UTF-8 -*-


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


Verdicts: Wrong Answer

Accepted
Problem: Takahashi is going to set a 3-character password.  How many possible passwords are there if each of its characters must be a digit between 1 and N (inclusive)?

Submission attempts (in order):
N = int(input())
A = list(map(int, input().split()))
B = list(map(int, input().split()))
C = list(map(int, input().split()))
m = 0
for i in range(N):
    m += B[a[i] - 1]
for t in range(N-1):
    if a[t] + 1 == a[t + 1]:
        m += C[a[t] - 1]
print(m)
         

N = int(input())
A = list(map(int, input().split()))
B = list(map(int, input().split()))
C = list(map(int, input().split()))
m = sum(B)
for t in range(N-1):
    if a[t] + 1 == a[t + 1]:
        m += C[a[t] - 1]
print(m)
         

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

n=int(input('N'))
if n<10 or n>0:
    combination=n*n*n
    print(combination)
else:
    break


N = int(input())
B = list(map(int, input().split()))
k = B[0]+B[-1]
A = [min(B[i],B[i+1] for i in range(N-2)]
C = sum(k + A)
print(C)


N=input()
n=N*N*N
print(n)

n=int(input('N'))
combination=n*n*n
print(n)

n=int(input('N'))
combination=n*n*n
print(combination)

N = int(input())
A = list(map(int, input().split()))
B = list(map(int, input().split()))
C = list(map(int, input().split()))
m=0
for i in range(N):
    m +=B[a[i] -1]
for i in range(N-1):
    if a[i] + 1 == a[i + 1]:
        m +=C[a[i] - 1]
print(m)
         
    

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

Verdicts: Runtime Error

Runtime Error

Runtime Error

Runtime Error

Runtime Error

Runtime Error

Wrong Answer

Wrong Answer

Runtime Error

Accepted
Problem: Takahashi is going to set a 3-character password.  How many possible passwords are there if each of its characters must be a digit between 1 and N (inclusive)?

Submission attempts (in order):
print((int(input())**3)

print((int(input())**3))

Verdicts: Runtime Error

Accepted
Problem: Takahashi is going to set a 3-character password.  How many possible passwords are there if each of its characters must be a digit between 1 and N (inclusive)?

Submission attempts (in order):
N = int(input())
print(3**N)

N = int(input())
print(N**3)

Verdicts: Wrong Answer

Accepted
Problem: Takahashi is going to set a 3-character password.  How many possible passwords are there if each of its characters must be a digit between 1 and N (inclusive)?

Submission attempts (in order):
N=int(input())
N*(N-1)*(N-2)

N=5
print(N*(N-1)*(N-2))

N=int(input())
N*(N-1)*(N-2)

N=int(input())
for i in range(2):
  N*(N-1)
  N-=1

N*(N-1)*(N-2)

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

N=int(input())
a=N*(N-1)*(N-2)
print(a)

N=int(input())
N*(N-1)*(N-2)

N=int(input())
if N==1:
  print(1)
else:
  print(N*(N-1)*(N-2))

N*(N-1)*(N-2)

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

N=int(input())
def fact(n):
  if n==0 or n==1:
    return 1
  else:
    return n*fack(n-1)
print(fack(3))

from operator import mul
from functools import reduce

def combinations_count(n, r):
    r = min(r, n - r)
    numer = reduce(mul, range(n, n - r, -1), 1)
    denom = reduce(mul, range(1, r + 1), 1)
    return numer // denom

print(combinations_count(3, 5))

print(N*(N-1)*(N-2))

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

N=int(input())
print(N*N*N)

Verdicts: Wrong Answer

Wrong Answer

Wrong Answer

Wrong Answer

Runtime Error

Wrong Answer

Wrong Answer

Wrong Answer

Wrong Answer

Runtime Error

Wrong Answer

Runtime Error

Wrong Answer

Runtime Error

Wrong Answer

Accepted
Problem: Takahashi is going to set a 3-character password.  How many possible passwords are there if each of its characters must be a digit between 1 and N (inclusive)?

Submission attempts (in order):
N=int(input())
N*N*N

2**N

N=int(input())
N**3

S=input()
S*S*S

N=input()
N**3

N=input()
N*N*N

N=int(input())
N**3

print(int(input())**3)

Verdicts: Wrong Answer

Runtime Error

Wrong Answer

Runtime Error

Runtime Error

Runtime Error

Wrong Answer

Accepted
Problem: Takahashi is going to set a 3-character password.  How many possible passwords are there if each of its characters must be a digit between 1 and N (inclusive)?

Submission attempts (in order):
N=int(input())
A = list(map(int, input().split()))
B = list(map(int, input().split()))
C = list(map(int, input().split()))
ans=0
j=0

for i in range(N):
	ans+=B[A[i]-1]
	if A[i]-j==1 and i>=1:
		ans+=C[j-1]
	j=A[i]

print(ans)

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

Verdicts: Runtime Error

Accepted
Problem: Takahashi is going to set a 3-character password.  How many possible passwords are there if each of its characters must be a digit between 1 and N (inclusive)?

Submission attempts (in order):
print(9**3)

a = int(input())

print(a**3)


Verdicts: Wrong Answer

Accepted
Problem: Takahashi is going to set a 3-character password.  How many possible passwords are there if each of its characters must be a digit between 1 and N (inclusive)?

Submission attempts (in order):
NUM = 3
max = input(data)
print(max**NUM)

max = int(input())
print(max ** 3)

Verdicts: Runtime Error

Accepted
Problem: Takahashi is going to set a 3-character password.  How many possible passwords are there if each of its characters must be a digit between 1 and N (inclusive)?

Submission attempts (in order):
N = input()
print(N ** 3)

N = int(input())
print(N ** 3)

Verdicts: Runtime Error

Accepted
Problem: Takahashi is going to set a 3-character password.  How many possible passwords are there if each of its characters must be a digit between 1 and N (inclusive)?

Submission attempts (in order):
num = int(input()) + 1
manzokudo = 0
for i in range(1, num):
    manzokudo += i + 1

print(manzokudo)

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

Verdicts: Wrong Answer

Accepted
Problem: Takahashi is going to set a 3-character password.  How many possible passwords are there if each of its characters must be a digit between 1 and N (inclusive)?

Submission attempts (in order):
n = int(input())

print (n^3

n = int(input())

print (n^3)

n = int(input())

print(n**3)

Verdicts: Runtime Error

Wrong Answer

Accepted
Problem: Takahashi is going to set a 3-character password.  How many possible passwords are there if each of its characters must be a digit between 1 and N (inclusive)?

Submission attempts (in order):
# coding: utf-8
n = int(input())
print((n ** 3) * (n ** 2) * n)

# coding: utf-8
n = int(input())
print(n ** 3)

Verdicts: Wrong Answer

Accepted
Problem: Takahashi is going to set a 3-character password.  How many possible passwords are there if each of its characters must be a digit between 1 and N (inclusive)?

Submission attempts (in order):
N = int(input())
print(N*3)

N = int(input())
print(N ** 3)

Verdicts: Wrong Answer

Accepted
Problem: Takahashi is going to set a 3-character password.  How many possible passwords are there if each of its characters must be a digit between 1 and N (inclusive)?

Submission attempts (in order):
n=int(input())
n=n**n
print(n)

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

Verdicts: Wrong Answer

Accepted
Problem: Takahashi is going to set a 3-character password.  How many possible passwords are there if each of its characters must be a digit between 1 and N (inclusive)?

Submission attempts (in order):
n = int(input())
print(n*n*n*)

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

Verdicts: Runtime Error

Accepted
Problem: Takahashi is going to set a 3-character password.  How many possible passwords are there if each of its characters must be a digit between 1 and N (inclusive)?

Submission attempts (in order):
def check(N):
    if type(N) == int and N >= 0 and N <= 9:
        print(N**3)
check(N)

def check(N):
    if type(N) == int and N >= 0 and N <= 9:
        return(N**3)
        
check(2)
check(1)

def check(N):
    if type(N) == int and N >= 1 and N <= 9:
        return(N**3)       
check(N)

def check(N):
    if type(N) == int and N >= 0 and N <= 9:
        return(N**3)

def check(N):
    if type(N) == int and N >= 1 and N <= 9:
        print(N**3)       
check(input())

def check(N):
    if type(N) == int and N >= 1 and N <= 9:
        print(N**3)       
check(2)
check(1)

def check(N):
    if type(N) == int and N >= 1 and N <= 9:
        print(N**3)
        
check(2)
check(1)

N = input()
if type(N) == int and N >= 1 and N <= 9:
  print(N**3)

def check(N):
    if type(N) == int and N >= 0 and N <= 9:
        print(N**3)
        
check(2)
check(1)

N = int(input())
if N >= 1 and N <= 9:
  print(N**3)

Verdicts: Runtime Error

Wrong Answer

Runtime Error

Wrong Answer

Wrong Answer

Wrong Answer

Wrong Answer

Wrong Answer

Wrong Answer

Accepted
Problem: Takahashi is going to set a 3-character password.  How many possible passwords are there if each of its characters must be a digit between 1 and N (inclusive)?

Submission attempts (in order):
# -*- coding: utf-8 -*-
from itertools import combination_with_replacement

n = int(input())
print(len(list(combination_with_replacement(n, 3))))


# -*- coding: utf-8 -*-
import itertools
n = int(input())
print(len(list(itertools.product(range(1,n+1), repeat=3))))


Verdicts: Runtime Error

Accepted
Problem: Takahashi is going to set a 3-character password.  How many possible passwords are there if each of its characters must be a digit between 1 and N (inclusive)?

Submission attempts (in order):
n=input()
print(n*n*n)

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


Verdicts: Runtime Error

Accepted
Problem: Takahashi is going to set a 3-character password.  How many possible passwords are there if each of its characters must be a digit between 1 and N (inclusive)?

Submission attempts (in order):
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10 ** 7)

from collections import deque

N = int(input())
A = sorted((int(x) for x in input().split()))

parent = [A[-1]]
rest = A[:-1]
bl = True
for _ in range(N):
    next_parent = []
    next_rest = []
    for p in parent[::-1]:
        while rest:
            x = rest.pop()
            if x < p:
                next_parent.append(x)
                break
            else:
                next_rest.append(x)
                continue
    parent += next_parent
    parent.sort()
    rest = rest + next_rest[::-1]

bl = len(parent) == (2**N)
answer = 'Yes' if bl else 'No'
print(answer)



print(int(input())**3)

Verdicts: Runtime Error

Accepted
Problem: Takahashi is going to set a 3-character password.  How many possible passwords are there if each of its characters must be a digit between 1 and N (inclusive)?

Submission attempts (in order):
n = int(input())
a = list(map(int, input().split()))
b = list(map(int, input().split()))
c = list(map(int, input().split()))

ans = 0
for i in range(n):
    ans += b[a[i] - 1]
    if i>0 and a[i] == a[i-1]+1:
        ans += c[a[i-1]-1]
        
print(ans)

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

Verdicts: Runtime Error

Accepted
Problem: Takahashi is going to set a 3-character password.  How many possible passwords are there if each of its characters must be a digit between 1 and N (inclusive)?

Submission attempts (in order):
print(int(input())^3) 

print(int(input())**3) 

Verdicts: Wrong Answer

Accepted
Problem: Takahashi is going to set a 3-character password.  How many possible passwords are there if each of its characters must be a digit between 1 and N (inclusive)?

Submission attempts (in order):
a=int(input())
n=list(range(1,a+1))
m=n
o=n
for i in n:
  for j in m:
    for q in o:
      u=list(i,j,k,sep='')
print(len(u))

a=int(input())
n=list(range(1,a+1))
m=n
o=n
count=0
for i in n:
  for j in m:
    for q in o:
        u=i,j,q
        count+=1
print(count)


Verdicts: Runtime Error

Accepted
Problem: Takahashi is going to set a 3-character password.  How many possible passwords are there if each of its characters must be a digit between 1 and N (inclusive)?

Submission attempts (in order):
n=int(input().split())
a=[0]*n
b=list(map(int,input().split()))
a[0]=b[0]
a[n-1]=b[n-2]

for i in range(1,n-1):
  a[i]=min(b[i-1],b[i])

print(sum(a))  
  


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

Verdicts: Runtime Error

Accepted
Problem: Takahashi is going to set a 3-character password.  How many possible passwords are there if each of its characters must be a digit between 1 and N (inclusive)?

Submission attempts (in order):
a=int(input())
print(a**2)

a=int(input())
print(a**3)


Verdicts: Wrong Answer

Accepted
Problem: Takahashi is going to set a 3-character password.  How many possible passwords are there if each of its characters must be a digit between 1 and N (inclusive)?

Submission attempts (in order):
N=int(input())
Num=N*N*N
print(N)

N=int(input())
Num=N*N*N
print(Num)

Verdicts: Wrong Answer

Accepted
Problem: Takahashi is going to set a 3-character password.  How many possible passwords are there if each of its characters must be a digit between 1 and N (inclusive)?

Submission attempts (in order):
N=input()
print(N*N*N)

N=int(input())
print(N*N*N)

Verdicts: Runtime Error

Accepted
Problem: Takahashi is going to set a 3-character password.  How many possible passwords are there if each of its characters must be a digit between 1 and N (inclusive)?

Submission attempts (in order):
x=int(input())
ans=0
if x == 1:
    ans=1
elif x == 2:
    ans=2
else:
    ans=x*(x-1)*(x-2)
print(ans)

x=int(input())
ans=x*x*x
print(ans)

Verdicts: Wrong Answer

Accepted
Problem: Takahashi is going to set a 3-character password.  How many possible passwords are there if each of its characters must be a digit between 1 and N (inclusive)?

Submission attempts (in order):
n = int(input())
a = list(map(int, input().split()))
b = list(map(int, input().split()))
c = list(map(int, input().split()))
 
ans = b[a[0]-1]
for i in range(1,n):
    ans += b[a[i]-1]
    if a[i] > a[i-1]:
        ans += c[a[i-1]-1]
print (ans)

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

Verdicts: Runtime Error

Accepted
Problem: Takahashi is going to set a 3-character password.  How many possible passwords are there if each of its characters must be a digit between 1 and N (inclusive)?

Submission attempts (in order):
#132 a
s=list(input())
s.sort()
print(s)
if s[0]==s[1] and s[2]==s[3] and s[1]!=s[2]:
    print("Yes")
else:
    print("No")

#140 a
N=int(input())
print(pow(N,3))

Verdicts: Runtime Error

Accepted
Problem: Takahashi is going to set a 3-character password.  How many possible passwords are there if each of its characters must be a digit between 1 and N (inclusive)?

Submission attempts (in order):
N = input()
print(N**3)

N = int(input())
print(N**3)

Verdicts: Runtime Error

Accepted
Problem: Takahashi is going to set a 3-character password.  How many possible passwords are there if each of its characters must be a digit between 1 and N (inclusive)?

Submission attempts (in order):
import math
print (int(math.pow(2, int(input())-1)))


import math
print (int(math.pow(int(input()), 3)))


Verdicts: Wrong Answer

Accepted
Problem: Takahashi is going to set a 3-character password.  How many possible passwords are there if each of its characters must be a digit between 1 and N (inclusive)?

Submission attempts (in order):

result = 0

for i in range(1, 10):
    for j in range(1, 10):
        for k in range(1, 10):
            result += 1


print(result)


max = int(input())+1
result = 0

for i in range(1, max):
    for j in range(1, max):
        for k in range(1, max):
            result += 1


print(result)


Verdicts: Wrong Answer

Accepted
Problem: Takahashi is going to set a 3-character password.  How many possible passwords are there if each of its characters must be a digit between 1 and N (inclusive)?

Submission attempts (in order):
n = int(input())
answer = n^3
print(answer)

n = int(input())
a = list(map(int, input().split()))
b = list(map(int, input().split()))
c = list(map(int, input().split()))score = 0
order = -1
for i in range(n):
  score += b[i]
  _order = a[i]
  
  if order+1 == _order:
    score += c[order - 1]
  order = _order
  
print(score)

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

Verdicts: Wrong Answer

Runtime Error

Accepted
Problem: Takahashi is going to set a 3-character password.  How many possible passwords are there if each of its characters must be a digit between 1 and N (inclusive)?

Submission attempts (in order):
print((int(input())**2)**2)

print(int(input())**3)

Verdicts: Wrong Answer

Accepted
Problem: Takahashi is going to set a 3-character password.  How many possible passwords are there if each of its characters must be a digit between 1 and N (inclusive)?

Submission attempts (in order):
a = map(int,input().split())
print(a*a*a)


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


Verdicts: Runtime Error

Accepted
Problem: Takahashi is going to set a 3-character password.  How many possible passwords are there if each of its characters must be a digit between 1 and N (inclusive)?

Submission attempts (in order):
print(int(input)**3)

print(int(input())**3)

Verdicts: Runtime Error

Accepted
Problem: Takahashi is going to set a 3-character password.  How many possible passwords are there if each of its characters must be a digit between 1 and N (inclusive)?

Submission attempts (in order):
n,k = map(int,input().split())
s = input()
ans = 0

for i in range(n - 1):
    if s[i] == s[i + 1] :
        ans += 1
print(min(n-1, ans + 2 * k))

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

Verdicts: Runtime Error

Accepted
Problem: Takahashi is going to set a 3-character password.  How many possible passwords are there if each of its characters must be a digit between 1 and N (inclusive)?

Submission attempts (in order):
n = input()
print(n ** 3)

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

Verdicts: Runtime Error

Accepted
Problem: Takahashi is going to set a 3-character password.  How many possible passwords are there if each of its characters must be a digit between 1 and N (inclusive)?

Submission attempts (in order):
print(int(input())^3)

print(int(input())**3)

Verdicts: Wrong Answer

Accepted
Problem: Takahashi is going to set a 3-character password.  How many possible passwords are there if each of its characters must be a digit between 1 and N (inclusive)?

Submission attempts (in order):
print(N ** 3)

N = input()
print(N ** 3)

print(int(input()) ** 3)

Verdicts: Runtime Error

Runtime Error

Accepted
Problem: Takahashi is going to set a 3-character password.  How many possible passwords are there if each of its characters must be a digit between 1 and N (inclusive)?

Submission attempts (in order):
n = int(input())
b = list(map(int,input().split()))
sum = 0
for i in range(n-1):
    first = b[i]
    second = 0
    for j in range(i+1,n):
        if(second < b[j]):
            if(first < b[j]):
                second = first
                first = b[j]
            else:
                second = b[j]
        sum += second
print(sum)

a=int(input())
b = a**3
print(b)

Verdicts: Runtime Error

Accepted
Problem: Takahashi is going to set a 3-character password.  How many possible passwords are there if each of its characters must be a digit between 1 and N (inclusive)?

Submission attempts (in order):
n=int(input())
a=list(map(int,input().split()))
b=list(map(int,input().split()))
c=list(map(int,input().split()))
#print(n)
#print(a)
#print(b)
#print(c)
total=0
pre=0
for i in range(n):
  total+=b[i]
  if pre+1==a[i] and pre!=0:
    total+=c[pre-1]
  pre=a[i]
print(total)

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

Verdicts: Runtime Error

Accepted
Problem: Takahashi is going to set a 3-character password.  How many possible passwords are there if each of its characters must be a digit between 1 and N (inclusive)?

Submission attempts (in order):

def rle_encode(data):
    encoding = ''
    prev_char = ''
    count = 1

    if not data: return ''

    for char in data:
        # If the prev and current characters
        # don't match...
        if char != prev_char:
            # ...then add the count and character
            # to our encoding
            if prev_char:
                encoding += str(count) + prev_char + ' '
            count = 1
            prev_char = char
        else:
            # Or increment our counter
            # if the characters do match
            count += 1
    else:
        # Finish off the encoding
        encoding += str(count) + prev_char + ' '
        return encoding

N, K = [int(s) for s in input().split()]
S = input()
S_rle = rle_encode(S).split()
total = 0
for i, bunch in enumerate(S_rle):
  total += int(list(bunch)[0]) - 1

if len(S_rle) >= 2*K+3:
  print(total+2*K)
elif len(S_rle) >= 2*K:
  print(total+2*K-1)
else:
  print(N-1)

N = int(input())
print(N*N*N)

Verdicts: Runtime Error

Accepted
Problem: Takahashi is going to set a 3-character password.  How many possible passwords are there if each of its characters must be a digit between 1 and N (inclusive)?

Submission attempts (in order):

n = int(input())

return (n**3 )


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



Verdicts: Runtime Error

Accepted
Problem: Takahashi is going to set a 3-character password.  How many possible passwords are there if each of its characters must be a digit between 1 and N (inclusive)?

Submission attempts (in order):
n = int(input())
print(n**3)2


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


Verdicts: Runtime Error

Accepted
Problem: Takahashi is going to set a 3-character password.  How many possible passwords are there if each of its characters must be a digit between 1 and N (inclusive)?

Submission attempts (in order):
n = int(input())
print(n**2)

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

Verdicts: Wrong Answer

Accepted
Problem: Takahashi is going to set a 3-character password.  How many possible passwords are there if each of its characters must be a digit between 1 and N (inclusive)?

Submission attempts (in order):
N=int(input())
print(N**3

N=int(input())
print(N**3)

Verdicts: Runtime Error

Accepted