TnT/Multi_CodeNet4Repair huggingface dataset:
Problem: You are given a string S of length N consisting of `A`, `B` and `C`, and an integer K which is between 1 and N (inclusive). Print the string S after lowercasing the K-th character in it.

Submission attempts (in order):
N, K = map(int, input().split())
S = str(input())

S[K + 1] = S[K + 1].lower()
print(S)

N, K = map(int, input().split())
S = str(input())
 
print(S[0 : K - 1] + S.lower()[K - 1 : K] + S[K : ])

Verdicts: Runtime Error

Accepted
Problem: You are given a string S of length N consisting of `A`, `B` and `C`, and an integer K which is between 1 and N (inclusive). Print the string S after lowercasing the K-th character in it.

Submission attempts (in order):
S, N = map(int, input().split())
S[N-1] = S[N-1].lower()
print(S)

S, N = map(int, input().split())
S[N-1] = S[N-1].lower()
print()

N, K = map(int, input().split())
S = input()
print(S[:K-1] + S[K-1].lower() + S[K:])


Verdicts: Runtime Error

Runtime Error

Accepted
Problem: You are given a string S of length N consisting of `A`, `B` and `C`, and an integer K which is between 1 and N (inclusive). Print the string S after lowercasing the K-th character in it.

Submission attempts (in order):
N,K=map(int,input().split())
S=input()
print(S[0:K]+S[K].lower()+S[-K:])

N,K=map(int,input().split())
S=input()
K=K-1
print(S[0:K]+S[K].lower()+S[K+1:])

Verdicts: Runtime Error

Accepted
Problem: You are given a string S of length N consisting of `A`, `B` and `C`, and an integer K which is between 1 and N (inclusive). Print the string S after lowercasing the K-th character in it.

Submission attempts (in order):
(a,b)=list(map(int, input().split()))
print(''.join([c if i!=b-1 else c.lower() for i,c in enumerate(s:=input())]))

(a,b)=list(map(int, input().split()))
s=input()
print(''.join([c if i!=b-1 else c.lower() for i,c in enumerate(s)]))

Verdicts: Runtime Error

Accepted
Problem: You are given a string S of length N consisting of `A`, `B` and `C`, and an integer K which is between 1 and N (inclusive). Print the string S after lowercasing the K-th character in it.

Submission attempts (in order):
n,k = [int(x) for x in input().split()]
s = input()

s.replace(s[k-1], s[k-1].lower())

print(s)

n,k = [int(x) for x in input().split()]
s = input()

print(s[:k-1] + s[k-1].lower + s[K:])

n,k = [int(x) for x in input().split()]
s = input()

s[k].lower()

print(s)

n,k = [int(x) for x in input().split()]
s = input()

s[k-1].lower()

print(s)

n,k = [int(x) for x in input().split()]
s = input()

print(s[:k-1] + s[k-1].lower() + s[k:])

Verdicts: Wrong Answer

Runtime Error

Runtime Error

Wrong Answer

Accepted
Problem: You are given a string S of length N consisting of `A`, `B` and `C`, and an integer K which is between 1 and N (inclusive). Print the string S after lowercasing the K-th character in it.

Submission attempts (in order):
import re
a = input()
b = input()
c = re.search('(\d+)\s(\d+)', a)
d = int(c.group(1))
e = int(c.group(2))
result = ''
for n in range(d):
    if n == d - 1:
        r = str(b[n]).lower()
        result += r
    else:
        result += b[n]
print(result)


import re
a = input()
b = input()
c = re.search('(\d+)\s(\d+)', a)
d = int(c.group(1))
e = int(c.group(2))
result = ''
for n in range(d):
    if n == e - 1:
        r = str(b[n]).lower()
        result += r
    else:
        result += b[n]
print(result)


Verdicts: Wrong Answer

Accepted
Problem: You are given a string S of length N consisting of `A`, `B` and `C`, and an integer K which is between 1 and N (inclusive). Print the string S after lowercasing the K-th character in it.

Submission attempts (in order):
n,k=map(int,input().split())
s=list(input())
t=chr(ord(s[k-1])+32)
s[k-1]=t
print(s)

n,k=map(int,input().split())
s=list(input())
t=chr(ord(s[k-1])+32)
s[k-1]=t
print(''.join(s))

Verdicts: Wrong Answer

Accepted
Problem: You are given a string S of length N consisting of `A`, `B` and `C`, and an integer K which is between 1 and N (inclusive). Print the string S after lowercasing the K-th character in it.

Submission attempts (in order):
N, K = map(int, input().split())
S = input()

ans = ""
for i in range(N):
  if i == K:
    ans += S[i].lower()
  else:
    ans += S[i]
print(ans)

N, K = map(int, input().split())
S = input()

ans = ""
for i in range(N):
  if i == K-1:
    ans += S[i].lower()
  else:
    ans += S[i]
print(ans)


Verdicts: Wrong Answer

Accepted
Problem: You are given a string S of length N consisting of `A`, `B` and `C`, and an integer K which is between 1 and N (inclusive). Print the string S after lowercasing the K-th character in it.

Submission attempts (in order):
N, K = map(int, input().split())
S = list(input())
for i in range(N):
    S[i] = S[i].lower()
print(''.join(S))

N, K = map(int, input().split())
S = list(input())
S[K-1] = S[K-1].lower()
print(''.join(S))

Verdicts: Wrong Answer

Accepted
Problem: You are given a string S of length N consisting of `A`, `B` and `C`, and an integer K which is between 1 and N (inclusive). Print the string S after lowercasing the K-th character in it.

Submission attempts (in order):
N,M = input().strip().split()
K = int(M)
S = input()
if K <= int(N):
  print(S[K-1].lower())

N,M = input().strip().split()
K = int(M)
S = input()
if K <= int(N):
  print(S[:K-1]+S[K-1].lower()+S[K:])

Verdicts: Wrong Answer

Accepted
Problem: You are given a string S of length N consisting of `A`, `B` and `C`, and an integer K which is between 1 and N (inclusive). Print the string S after lowercasing the K-th character in it.

Submission attempts (in order):
n,k=map(int , input().split())
string=list(input())
result=[]
for i in range(n):
  if i==k-1:
    result.append(chr(ord(string[i])+32))
  else:
    result.append(string[i])
 print(''.join(result)) 

n,k=map(int , input().split())
string=list(input())
result=[]
for i in range(n):
  if i==k-1:
    result.append(chr(ord(string[i])+32))
  else:
    result.append(string[i])
print(''.join(result))

Verdicts: Runtime Error

Accepted
Problem: You are given a string S of length N consisting of `A`, `B` and `C`, and an integer K which is between 1 and N (inclusive). Print the string S after lowercasing the K-th character in it.

Submission attempts (in order):
n, k = map(int, input().split())
s = input()
k -= 1
if s[k] == 'A':
  s[k] = 'a'
elif s[k] == 'B':
  s[k] = 'b'
else:
  s[k] = 'c'
print(s)

n, k = map(int, input().split())
s = list(input())
k -= 1
if s[k] == 'A':
  s[k] = 'a'
elif s[k] == 'B':
  s[k] = 'b'
else:
  s[k] = 'c'
ans = ''
for i in s:
  ans += i
print(ans)


Verdicts: Runtime Error

Accepted
Problem: You are given a string S of length N consisting of `A`, `B` and `C`, and an integer K which is between 1 and N (inclusive). Print the string S after lowercasing the K-th character in it.

Submission attempts (in order):
N, K = map(int,input().split())

S = input()

SL = list(S)
SL[K] = SL[K].lower()
ans = "".join(SL)

print(ans)



N, K = map(int,input().split())

S = input()

SL = list(S)
SL[K] = SL[K].lower()
ans = "".join(SL)

print(ans)

N, K = map(int,input().split())

S = input()

SL = list(S)
SL[K-1] = SL[K-1].lower()
ans = "".join(SL)

print(ans)

Verdicts: Runtime Error

Runtime Error

Accepted
Problem: You are given a string S of length N consisting of `A`, `B` and `C`, and an integer K which is between 1 and N (inclusive). Print the string S after lowercasing the K-th character in it.

Submission attempts (in order):
N, K = map(int, input().split())
S = input()

S_list = [c for c in S]
print(S_list)

if S_list[K-1] == 'A':
  S_list[K-1] = 'a'
elif S_list[K-1] == 'B':
  S_list[K-1] = 'b'
else:
  S_list[K-1] = 'c'

print  

N, K = map(int, input().split())
S = input()

S_list = [c for c in S]
#print(S_list)

if S_list[K-1] == 'A':
  S_list[K-1] = 'a'
elif S_list[K-1] == 'B':
  S_list[K-1] = 'b'
else:
  S_list[K-1] = 'c'

print(''.join(S_list))  

Verdicts: Wrong Answer

Accepted
Problem: You are given a string S of length N consisting of `A`, `B` and `C`, and an integer K which is between 1 and N (inclusive). Print the string S after lowercasing the K-th character in it.

Submission attempts (in order):
s = input()
if int(s[0:2]) == 0 or int(s[2:4]) == 0:
  print("NA")
elif 0 < int(s[0:2]) <= 12 and 0 < int(s[2:4]) <= 12 :
  print("AMBIGUOUS")
elif int(s[2:4]) < 13:
  print("YYMM")
else:
  print("MMYY")
  

n, k = map(int, input().split())
s = input()
s[k].lower
print(s)

n, k = map(int, input().split())
s = input()
ans = ""
for i in range(n):
  if i == k-1: 
    ans += s[i].lower()
  else : ans += s[i]
print(ans)

Verdicts: Wrong Answer

Runtime Error

Accepted
Problem: You are given a string S of length N consisting of `A`, `B` and `C`, and an integer K which is between 1 and N (inclusive). Print the string S after lowercasing the K-th character in it.

Submission attempts (in order):
H,W = map(int,input().split(' '))
N = list(input())
N[W] = N[W].lower()
print("".join(N))

H,W = map(int,input().split(' '))
N = list(input())
N[W-1] = N[W-1].lower()
print("".join(N))

Verdicts: Runtime Error

Accepted
Problem: You are given a string S of length N consisting of `A`, `B` and `C`, and an integer K which is between 1 and N (inclusive). Print the string S after lowercasing the K-th character in it.

Submission attempts (in order):
n,k = input().split()
s = list(input())
s[int(k)] = s[int(k)].lower()
print(''.join(s))

n,k = input().split()
s = list(input())
s[int(k)-1] = s[int(k)-1].lower()
print(''.join(s))

Verdicts: Runtime Error

Accepted
Problem: You are given a string S of length N consisting of `A`, `B` and `C`, and an integer K which is between 1 and N (inclusive). Print the string S after lowercasing the K-th character in it.

Submission attempts (in order):
N,K=map(int,input().split())
S=list(str(input()))
S[K-1]=S[K-1].lower()

m=",".join(S)
print(m)

N,K=map(int,input().split())
S=list(str(input()))
S[K-1]=S[K-1].lower()
m="".join(S)
print(m)


Verdicts: Wrong Answer

Accepted
Problem: You are given a string S of length N consisting of `A`, `B` and `C`, and an integer K which is between 1 and N (inclusive). Print the string S after lowercasing the K-th character in it.

Submission attempts (in order):
S = input()

a = 10*int(S[0])+int(S[1])
b = 10*int(S[2])+int(S[3])

if a>12 and b>12:
    print('NA')
elif a>12 and 1<=b<=12:
    print('YYMM')
elif 1<=a<=12 and b>12:
    print('MMYY')
else:
    print('AMBIGUOUS')


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

p = input()

print(p[:k-1] + p[k-1].lower() + p[k:])

Verdicts: Runtime Error

Accepted
Problem: You are given a string S of length N consisting of `A`, `B` and `C`, and an integer K which is between 1 and N (inclusive). Print the string S after lowercasing the K-th character in it.

Submission attempts (in order):
s = input()
mae = int(s[:2])
usiro = int(s[2:])
if 12 >= mae:
    if 12 >= usiro:
        print("AMBIGUOUS")
    else:
        print("MMYY")
elif 12 >= usiro:
    print("YYMM")
else:
    print("NA")

s = input()
if s[0] == 0:
    mae = int(s[1])
else:
    mae = int(s[:2])
if s[2] == 0:
    usiro =  int(s[3])
else:
    usiro = int(s[2:])
if 12 >= mae:
    if 12 >= usiro:
        print("AMBIGUOUS")
    else:
        print("MMYY")
elif 12 >= usiro:
    print("YYMM")
else:
    print("NA")

n,k = map(int,input().split())
s = input()
print(str.lower(s[k]))

n,k = map(int,input().split())
s = input()
komoji = str.lower(s[k-1])
if k-1 != 0 and k-1 != n-1:
    sum = s[0:k-1] +komoji+s[k:]
elif k-1 == 0:
    sum = komoji + s[k:]
else:
    sum = s[0:k-1] + komoji
print(sum)

Verdicts: Wrong Answer

Wrong Answer

Runtime Error

Accepted
Problem: You are given a string S of length N consisting of `A`, `B` and `C`, and an integer K which is between 1 and N (inclusive). Print the string S after lowercasing the K-th character in it.

Submission attempts (in order):
N, K = map(int, input().split())
S = list(input())
print(ord(S[K-1]))
S[K-1] = chr(ord(S[K-1])+32)
print("".join(S))

N, K = map(int, input().split())
S = list(input())
S[K-1] = chr(ord(S[K-1])+32)
print("".join(S))

Verdicts: Wrong Answer

Accepted
Problem: You are given a string S of length N consisting of `A`, `B` and `C`, and an integer K which is between 1 and N (inclusive). Print the string S after lowercasing the K-th character in it.

Submission attempts (in order):
N, K = map(int, input().split(' '))
S = input()

K -= 1

print(S[:K] + S[K].lower() + S[K:])


N, K = map(int, input().split(' '))
S = input()

K -= 1

print(S[:K] + S[K].lower() + S[K + 1:])


Verdicts: Wrong Answer

Accepted
Problem: You are given a string S of length N consisting of `A`, `B` and `C`, and an integer K which is between 1 and N (inclusive). Print the string S after lowercasing the K-th character in it.

Submission attempts (in order):
N, K = map(int, input().split())
S = input()
S[K] = str.lower(S[k])
print(S)

N, K = map(int, input().split())
S = input()
S[K-1] = S[K-1].lower()
print(S)

N, K = map(int, input().split())
S = input()
print(S[0:K-1] + S[K-1].lower() + S[K:])

Verdicts: Runtime Error

Runtime Error

Accepted
Problem: You are given a string S of length N consisting of `A`, `B` and `C`, and an integer K which is between 1 and N (inclusive). Print the string S after lowercasing the K-th character in it.

Submission attempts (in order):
N,K = map(int, input().split())
S = input()
print(*[s if i != K else s.lower() for i in range(N)])


N,K = map(int, input().split())
S = input()
print(''.join([S[i]if i+1 != K else S[i].lower() for i in range(N)]))


Verdicts: Runtime Error

Accepted
Problem: You are given a string S of length N consisting of `A`, `B` and `C`, and an integer K which is between 1 and N (inclusive). Print the string S after lowercasing the K-th character in it.

Submission attempts (in order):
inputstr1 = input().split()
n = inputstr1[0]
k = inputstr1[1]
s = input()
print("N:"+n)
print("K:"+k)
print("S:"+s)
s_list = list(s)
s_list[int(k) - 1] = s_list[int(k)-1].lower()
s = "".join(s_list)
print("S:"+s)


inputstr1 = input().split()
n = inputstr1[0]
k = inputstr1[1]
s = input()
s_list = list(s)
s_list[int(k) - 1] = s_list[int(k)-1].lower()
s = "".join(s_list)
print("S:"+s)


inputstr1 = input().split()
n = inputstr1[0]
k = inputstr1[1]
s = input()
s_list = list(s)
s_list[int(k) - 1] = s_list[int(k)-1].lower()
s = "".join(s_list)
print(s)


Verdicts: Wrong Answer

Wrong Answer

Accepted
Problem: You are given a string S of length N consisting of `A`, `B` and `C`, and an integer K which is between 1 and N (inclusive). Print the string S after lowercasing the K-th character in it.

Submission attempts (in order):
N,K = map(int, input().split())
S = input()


if S[K] == "A":
    S[K] = "a"
elif S[K] == "B":
    S[K] = "b"
elif S[K] == "C":
    S[K] = "c"

print(S)

N,K = map(str, input().split())
S = int(input())




number = (K-1)

if S[number] == "A":
    S[number] = "a"
elif S[number] == "B":
    S[number] = "b"
elif S[number] == "C":
    S[number] = "c"     

print("".join(s))

N,K = map(int, input().split())
S = input()


if S[K-1] == "A":
    S[K-1] = "a"
elif S[K-1] == "B":
    S[K-1] = "b"
elif S[K-1] == "C":
    S[K-1] = "c"

print("".join(S))

N,K = map(str, input().split())
S = int(input())




number = (K-1)

if S[number] == "A":
    S[number] = "a"
elif S[number] == "B":
    S[number] = "b"
elif S[number] == "C":
    S[number] = "c"     

print(S)

N,K = map(int, input().split())
S = input()


if S[K+1] == "A":
    S[K+1] = "a"
elif S[K+1] == "B":
    S[K+1] = "b"
elif S[K+1] == "C":
    S[K+1] = "c"

print("".join(S))

if S[K-1] == "A":
    S[K-1] = "a"
elif S[K-1] == "B":
    S[K-1] = "b"
elif S[K-1] == "C":
    S[K-1] = "c"

print("".join(S))

N,K = map(int, input().split())
S = input()


if S[K] == "A":
    S[K] = "a"
elif S[K] == "B":
    S[K] = "b"
elif S[K] == "C":
    S[K] = "c"

print("".join(S))

n, k = map(int,input().split())
s = list(input())
 
if s[k-1] == "A":
  s[k-1] = "a"
elif s[k-1] == "B":
  s[k-1] = "b"
elif s[k-1] == "C":
  s[k-1] = "c"
 
print("".join(s))

Verdicts: Runtime Error

Runtime Error

Runtime Error

Runtime Error

Runtime Error

Runtime Error

Runtime Error

Accepted
Problem: You are given a string S of length N consisting of `A`, `B` and `C`, and an integer K which is between 1 and N (inclusive). Print the string S after lowercasing the K-th character in it.

Submission attempts (in order):
N, K = map(int, input().split())
S=input()
if S[K] == "A":
    ans = S[:K] + "a" + S[K+1:]
elif S[K] == "B":
    ans = S[:K] + "b" + S[K+1:]
else:
    ans = S[:K] + "c" + S[K+1:]
print(ans)

N, K = map(int, input().split())
S=input()
if S[K-1] == "A":
    ans = S[:K-1] + "a" + S[K:]
elif S[K-1] == "B":
    ans = S[:K-1] + "b" + S[K:]
else:
    ans = S[:K-1] + "c" + S[K:]
print(ans)

Verdicts: Runtime Error

Accepted
Problem: You are given a string S of length N consisting of `A`, `B` and `C`, and an integer K which is between 1 and N (inclusive). Print the string S after lowercasing the K-th character in it.

Submission attempts (in order):
N,K = (int(x) for x in input().split())
s = input()
print ''.join(x for i,x in enumerate(s) if i != K-1 else x.lower())

N,K = (int(x) for x in input().split())
s = input()
print(''.join([x if i != K-1 else x.lower() for i,x in enumerate(s) ]))

Verdicts: Runtime Error

Accepted
Problem: You are given a string S of length N consisting of `A`, `B` and `C`, and an integer K which is between 1 and N (inclusive). Print the string S after lowercasing the K-th character in it.

Submission attempts (in order):
x = range(m)
y = range(m)
n, m = list(map(int, input().split()))
for i in range(m):
   x[i], y[i] = list(map(int, input().split()))

z = x.extend(y)
N = range(n)
for i in range(n):
    N[i] = z.count(i+1)

ans = 0
for i in range(n):
    ans = ans + N.count(i)/(2**i)
print(ans)


n, k = list(map(int, input().split()))
s = list(str(input()))

if s[k-1] == "A":
    s[k-1] = "a"
if s[k-1] == "B":
    s[k-1] = "b"
if s[k-1] == "C":
    s[k-1] = "c"
print("".join([str(i) for i in s]))

Verdicts: Runtime Error

Accepted
Problem: You are given a string S of length N consisting of `A`, `B` and `C`, and an integer K which is between 1 and N (inclusive). Print the string S after lowercasing the K-th character in it.

Submission attempts (in order):
N, K = map(int,input().split())
S = input()
if S[K - 1] == 'A':
  S[K - 1] = 'a'
elif S[K - 1] == 'B':
  S[K - 1] = 'b'
else:
  S[K - 1] = 'c'
print(S)

N, K = map(int, input().split())
S = list(input())

if S[K - 1] == 'A':
    S[K - 1] = 'a'
elif S[K - 1] == 'B':
    S[K - 1] = 'b'
else:
    S[K - 1] = 'c'

ans = ''.join(S)
print(ans)

Verdicts: Runtime Error

Accepted
Problem: You are given a string S of length N consisting of `A`, `B` and `C`, and an integer K which is between 1 and N (inclusive). Print the string S after lowercasing the K-th character in it.

Submission attempts (in order):
N,K = map(int,input().split())
S = input()
if S[K-1] == 'A':
  S[K-1] = 'a'
elif S[K-1] == 'B':
  S[K-1] = 'b'
elif S[K-1] == 'C':
  S[K-1] = 'c'
print(S)

N,K = map(int,input().split())
a = input()
res = ''
S = [el for el in a]
if S[K-1] == 'A':
  S[K-1] = 'a'
elif S[K-1] == 'B':
  S[K-1] = 'b'
elif S[K-1] == 'C':
  S[K-1] = 'c'
for el in S:
  res += el
print(res)

Verdicts: Runtime Error

Accepted
Problem: You are given a string S of length N consisting of `A`, `B` and `C`, and an integer K which is between 1 and N (inclusive). Print the string S after lowercasing the K-th character in it.

Submission attempts (in order):
# -*- coding: utf-8 -*-
# input
a, b = map(int, input().split())
s = input()
print(s[:b-1]+s[b-1:b].lower()+s[b:a]

a, b = map(int, input().split())
s = input()
print(s[:b-1]+s[b-1:b].lower()+s[b:a])

Verdicts: Runtime Error

Accepted
Problem: You are given a string S of length N consisting of `A`, `B` and `C`, and an integer K which is between 1 and N (inclusive). Print the string S after lowercasing the K-th character in it.

Submission attempts (in order):
n =  input()
f = n[:2]
a = n[2:]
#print(f,a)
month = ['01','02','03','04','05','06','07','08','09','10','11','12']
#print(type(f))
if   (f in month) & (a in month):
  print('AMBIGUOUS')
elif (f in month):
  print('MMYY')
elif (a in month):
#  a in month:
  print('YYMM')
else:
  print('NA')

i = list(map(int,(input().split())))
word = list(input())
#print(word)
count = 0
ans = []
for n,moji in enumerate(word):
  if n == (i[1]-1):
    ans.append(moji.lower())
  else:
    ans.append(moji)
    
print(('').join(ans))   

Verdicts: Wrong Answer

Accepted
Problem: You are given a string S of length N consisting of `A`, `B` and `C`, and an integer K which is between 1 and N (inclusive). Print the string S after lowercasing the K-th character in it.

Submission attempts (in order):
s = input()
YYMM, MMYY, ova = False, False, False

if(1 <= int(s[:2]) <= 12):
    MMYY = True
if(1 <= int(s[3:]) <= 12):
    YYMM = True

if(MMYY and YYMM):
    ova = True

if(ova):
    print('AMBIGUOUS')
elif(MMYY):
    print("MMYY")
elif(YYMM):
    print('YYMM')
else:
    print('NA')

N, K = map(int, input().split())
S = input()

print(S[: K-1] + S[K - 1].lower() + S[K :])

Verdicts: Runtime Error

Accepted
Problem: You are given a string S of length N consisting of `A`, `B` and `C`, and an integer K which is between 1 and N (inclusive). Print the string S after lowercasing the K-th character in it.

Submission attempts (in order):
n,k = map(int,input().split())
ans = 0
for i in range(1,n+1):
    if i < k:
      c = i
      d=0
      while c<k:
        c = c*2
        d+=1
      ans -=float((2**d-1)/(n*(2**d)))
print(ans)


n,k = map(int,input().split())
s= input()
if s[k-1] == "A":
  s[k-1] = "a"
elif s[k-1] == "B":
  s[k-1] ="b"
elif s[k-1] =="C":
  s[k-1] = "c"
print(s)

dct = {"A":"a","B":"b","C":"c"}
n,m = map(int,input().split())
s = input()
print(s[:m-1]+dct[s[m-1]]+s[m:])

Verdicts: Wrong Answer

Runtime Error

Accepted
Problem: You are given a string S of length N consisting of `A`, `B` and `C`, and an integer K which is between 1 and N (inclusive). Print the string S after lowercasing the K-th character in it.

Submission attempts (in order):
a, b = map(int, input().split())
s = list(input())
s[b] = s[b].lower()
s = str(s)
print('{}'.format(s))

a, b = map(int, input().split())
c = list(input())
c[b-1] = c[b-1].lower()
print('{}'.format(str(c)))

a, b = map(int, input().split())
c = input()
c = list(c)
if (c[b-1] == 'A'):
    c[b-1] = 'a'
if (c[b-1] == 'B'):
    c[b-1] = 'b'
if (c[b-1] == 'C'):
    c[b-1] = 'c'
c = ''.join(c)
print('{}'.format(c))

Verdicts: Runtime Error

Wrong Answer

Accepted
Problem: You are given a string S of length N consisting of `A`, `B` and `C`, and an integer K which is between 1 and N (inclusive). Print the string S after lowercasing the K-th character in it.

Submission attempts (in order):
n,k = int(input().split())
s = list(input())
s[k-1] = s[k-1].lower()
print(str(s))

n,k = map(int,input().split())
s = list(input())
s[k-1] = s[k-1].lower()
print("".join(s)) 

Verdicts: Runtime Error

Accepted
Problem: You are given a string S of length N consisting of `A`, `B` and `C`, and an integer K which is between 1 and N (inclusive). Print the string S after lowercasing the K-th character in it.

Submission attempts (in order):
import sys
sys.setrecursionlimit(20000)

N = int(input())
W = [list(map(int, input().split())) for _ in range(N-1)]
nodes = [[] for _ in range(N+1)]
for w in W:
    nodes[w[0]].append((w[1], w[2]))
    nodes[w[1]].append((w[0], w[2]))
ans = [-1] * (N+1)
ans[1] = 0
def search(num, root, dis):
    for node in nodes[num]:
        sum_d = dis
        if node[0] != root:
            idx = node[0]
            sum_d += node[1]%2
            if sum_d%2 != 0:
                ans[idx] = 1
            else:
                ans[idx] = 0
            search(idx, num, sum_d)

search(1, 0, 0)
for answer in ans[1:]:
    print(answer)


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

A[K-1::] = A[k-1::].lower()
print(A)

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

if K < len(A):
    ans = A[:K-1] + A[K-1].lower() + A[K:]
else:
    ans = A[:K-1] + A[K-1].lower()
# print(ans)
print(A[:K-1] + A[K-1].lower() + A[K:])

Verdicts: Runtime Error

Runtime Error

Accepted
Problem: You are given a string S of length N consisting of `A`, `B` and `C`, and an integer K which is between 1 and N (inclusive). Print the string S after lowercasing the K-th character in it.

Submission attempts (in order):
N, K = map(int, input().split())
S = input()
if S[K + 1] == 'A':
  S[K + 1] = 'a'
elif S[K + 1] == 'B':
  S[K + 1] = 'b'
else:
  S[K + 1] = 'c'
print(S)

N, K = map(int, input().split())
S = input()
if S[K - 1] == 'A':
  S[K - 1] = 'a'
elif S[K - 1] == 'B':
  S[K - 1] = 'b'
else:
  S[K - 1] = 'c'
print(S)


N, K = map(int, input().split())
S = input()
print(S[:K-1] + S[K-1].lower() + S[K:])

Verdicts: Runtime Error

Runtime Error

Accepted
Problem: You are given a string S of length N consisting of `A`, `B` and `C`, and an integer K which is between 1 and N (inclusive). Print the string S after lowercasing the K-th character in it.

Submission attempts (in order):
n, k = map(int, input().split())
s = input()
print(s[:k-1] + s[k-1].lower() + s[k-1:])


n, k = map(int, input().split())
s = input()
print(s[:k-1] + s[k-1].lower() + s[k:])


Verdicts: Wrong Answer

Accepted
Problem: You are given a string S of length N consisting of `A`, `B` and `C`, and an integer K which is between 1 and N (inclusive). Print the string S after lowercasing the K-th character in it.

Submission attempts (in order):
def main(n, k, s):
    l = list(s)
    print(l)
    l[k - 1] = l[k - 1].lower()
    print(''.join(l))
        
if __name__ == '__main__':
    try:
        n, k = list(map(int, input().strip().split(' ')))
        s = input().strip()
        main(n, k, s)
    except EOFError:
        pass


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


def main(n, k, s):
    l = list(s)
    # print(l)
    l[k - 1] = l[k - 1].lower()
    print(''.join(l))
        
if __name__ == '__main__':
    try:
        n, k = list(map(int, input().strip().split(' ')))
        s = input().strip()
        main(n, k, s)
    except EOFError:
        pass


Verdicts: Wrong Answer

Accepted
Problem: You are given a string S of length N consisting of `A`, `B` and `C`, and an integer K which is between 1 and N (inclusive). Print the string S after lowercasing the K-th character in it.

Submission attempts (in order):
n,k=map(int,input().split())
s=str(input())
s=list(s)
s[k-1]=str.lower(s[k-1])
print("".join(s))n,k=map(int,input().split())
s=str(input())
s=list(s)
s[k-1]=str.lower(s[k-1])
print("".join(s))

n,k=map(int,input().split())
s=str(input())
s=list(s)
s[k-1]=str.lower(s[k-1])
print("".join(s))

Verdicts: Runtime Error

Accepted
Problem: You are given a string S of length N consisting of `A`, `B` and `C`, and an integer K which is between 1 and N (inclusive). Print the string S after lowercasing the K-th character in it.

Submission attempts (in order):
N,K=map(int,input().split())
S=input()
T=list(S)
T[K-1]=T[K-1].lower()
S_changed="".join(T)
print(S_changed

N,K=map(int,input().split())
S=input()
T=list(S)
T[K-1]=T[K-1].lower()
S_changed="".join(T)
print(S_changed)

Verdicts: Runtime Error

Accepted
Problem: You are given a string S of length N consisting of `A`, `B` and `C`, and an integer K which is between 1 and N (inclusive). Print the string S after lowercasing the K-th character in it.

Submission attempts (in order):
n,k = map(int,input().split())
s = input()
ans = ''
for i in range(n):
  if i == k-1:
    ans = ans + s[i].lower()
  ans = ans + s[i]
print(ans)


n,k = map(int,input().split())
s = input()
ans = ''
for i in len(s):
  if i == k:
    ans = ans + s[i].lower()
  ans = ans + s[i]
print(ans)

n,k = map(int,input().split())
s = input()
ans = ''
for i in range(n):
  if i == k:
    ans = ans + s[i].lower()
  ans = ans + s[i]
print(ans)


n,k = map(int,input().split())
s = input()
ans = ''
for i in range(n):
    if i == k-1:
        ans = ans + s[i].lower()
    else:
        ans = ans + s[i]
print(ans)

Verdicts: Wrong Answer

Runtime Error

Wrong Answer

Accepted
Problem: You are given a string S of length N consisting of `A`, `B` and `C`, and an integer K which is between 1 and N (inclusive). Print the string S after lowercasing the K-th character in it.

Submission attempts (in order):
n, k = map(int, input().split())
s = input()
for i in range(n):
  if i == k - 1:
    print(s[i].lower(), end=="")
  else:
    print(s[i], end=="")

n, k = map(int, input().split())
s = input()
for i in range(n):
  if i == k - 1:
    print(s[i].lower(), end="")
  else:
    print(s[i], end="")
print()

Verdicts: Runtime Error

Accepted
Problem: You are given a string S of length N consisting of `A`, `B` and `C`, and an integer K which is between 1 and N (inclusive). Print the string S after lowercasing the K-th character in it.

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

c = s[k-1]
s[k-1] = c.lower()
print(s)


n, k = map(int, input().split())
s = list(input())
moji = ''

c = s[k-1]
s[k-1] = c.lower()
for x in s:
    moji += x
print(moji)


Verdicts: Wrong Answer

Accepted
Problem: You are given a string S of length N consisting of `A`, `B` and `C`, and an integer K which is between 1 and N (inclusive). Print the string S after lowercasing the K-th character in it.

Submission attempts (in order):
n,k=map(int,input().split())
s=input()
a=s[k-1].lower
print(s[:k-1]+a+s[k:])

n,k=map(int,input().split())
s=input()
print(s[:k-1]+s[k-1].lower()+s[k:])

Verdicts: Runtime Error

Accepted
Problem: You are given a string S of length N consisting of `A`, `B` and `C`, and an integer K which is between 1 and N (inclusive). Print the string S after lowercasing the K-th character in it.

Submission attempts (in order):
M,K=map(int,input().split())
if K>2**M-1:
    print(-1)
elif K==0:
    a=0
    while a<=2**M-1:
        print(a)
        a+=1
    a-=1
    while a>=0:
        print(a)
        a-=1

elif 0<K<2**M:
    print(K)
    b=0
    while b<K:
        print(b)
        b+=1
    b+=1
    while b<2**M:
        print(b)
        b+=1
    b-=1
    while b>=0:
        print(b)
        b-=1

N,K=map(int,input().split())
S=list(input())
if S[K-1]=="A":
    S[K-1]="a"
elif S[K-1]=="B":
    S[K-1]="b"
else:
    S[K-1]="c"
S="".join(S)
print(S)


Verdicts: Wrong Answer

Accepted
Problem: You are given a string S of length N consisting of `A`, `B` and `C`, and an integer K which is between 1 and N (inclusive). Print the string S after lowercasing the K-th character in it.

Submission attempts (in order):
N,K =  [int(x) for x in input().split()]

L = [0]*N
num =1
for i in range(N):
    num = 1
    if i < K:
        while num*(i+1) < K:
            num *= 2
        L[i]= 1/N * 1/num
    else:
        L[i] = 1/N

ans = 0
for i in range(N):
        ans +=L[i]

print(ans)

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

S[K-1]=S[K-1].lower()
S = "".join(S)
print(S)

Verdicts: Wrong Answer

Accepted
Problem: You are given a string S of length N consisting of `A`, `B` and `C`, and an integer K which is between 1 and N (inclusive). Print the string S after lowercasing the K-th character in it.

Submission attempts (in order):
N,K=map(int, input().split())
S=input()
print(S[K-1].lower())
#if K==1:
#  S=S[K-1].lower()+S[K:]
#elif K==N:
#  S=S[:K-1]+S[K-1].lower()
#else:
S=S[:K-1]+S[K-1].lower()+S[K:]
print(S)

N,K=map(int, input().split())
S=input()
print(S[K-1].lower())
if K==1:
  S=S[K-1].lower()+S[K:]
elif K==N:
  S=S[:K-2]+S[K-1].lower()
else:
  S=S[:K-2]+S[K-1].lower()+S[K:]
print(S)

import math
N,K=map(int,input().split())
m=0
for i in range(1,N+1):
  if i<K:
    temp=math.ceil(math.sqrt(K/i))
    m+=(1/2)**temp
  else:
    m+=1
print(m/N)

N,K=map(int, input().split())
S=input()
print(S[K-1].lower())
if K==1:
  S=S[K-1].lower()+S[K:]
elif K==N:
  S=S[:K-1]+S[K-1].lower()
else:
  S=S[:K-1]+S[K-1].lower()+S[K:]
print(S)

N,K=map(int, input().split())
S=input()
print(S[K-1].lower())
if K==1:
  S=S[K-1].lower()+S[K:]
elif K==N:
  S=S[:K-1]+S[K-1].lower()
else:
  S=S[:K-1]+S[K-1].lower()+S[K:]
print(S)

N,K=map(int, input().split())
S=input()
S=S[:K-1]+S[K-1].lower()+S[K:]
print(S)

Verdicts: Wrong Answer

Wrong Answer

Wrong Answer

Wrong Answer

Wrong Answer

Accepted
Problem: You are given a string S of length N consisting of `A`, `B` and `C`, and an integer K which is between 1 and N (inclusive). Print the string S after lowercasing the K-th character in it.

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

a=(s[n-2]).lower()

print(s[0:n-2] + a + s[n-1:])

n,k=map(int,input().split())
s=input()

a=(s[k-1]).lower()

print(s[0:k-1] + a + s[k:])

Verdicts: Wrong Answer

Accepted
Problem: You are given a string S of length N consisting of `A`, `B` and `C`, and an integer K which is between 1 and N (inclusive). Print the string S after lowercasing the K-th character in it.

Submission attempts (in order):
# coding: utf-8
n, k = map(int,input().split())
s = input()
s_list=list(s)
s_list[k-1].lower()
print(s_list)


# coding: utf-8
n, k = map(int,input().split())
s = input()
s_list=list(s)
s_list[k-1].lower()
print("".join(s_list))


# coding: utf-8
n, k = map(int,input().split())
s = input()
s_list=list(s)
character=s_list[k-1]
s_list[k-1]=character.lower()
print("".join(s_list))


Verdicts: Wrong Answer

Wrong Answer

Accepted
Problem: You are given a string S of length N consisting of `A`, `B` and `C`, and an integer K which is between 1 and N (inclusive). Print the string S after lowercasing the K-th character in it.

Submission attempts (in order):
_, k = map(int, input().split())
s = list(input())
s[k-1] = s[k-1].upper()
print(''.join(s))

_, k = map(int, input().split())
s = list(input())
s[k-1] = s[k-1].lower()
print(''.join(s))

Verdicts: Wrong Answer

Accepted
Problem: You are given a string S of length N consisting of `A`, `B` and `C`, and an integer K which is between 1 and N (inclusive). Print the string S after lowercasing the K-th character in it.

Submission attempts (in order):
N,K=map(int,input().split())
S=str(input())
print(S.replace(S[K-1],S[K-1].lower())
      

N,K=map(int,input().split())
S=list(input())
S[K-1]=S[K-1].lower()
print(''.join(S))

  

Verdicts: Runtime Error

Accepted
Problem: You are given a string S of length N consisting of `A`, `B` and `C`, and an integer K which is between 1 and N (inclusive). Print the string S after lowercasing the K-th character in it.

Submission attempts (in order):
N,K=map(int,input().split())
S = input()
S[K] = S[K].lower()
print(S)

N,K=map(int,input().split())
S = input()
list = [b.lower() if a+1==K else b for (a,b) in enumerate(S)]
moji = ''.join(list)
print(moji)

Verdicts: Runtime Error

Accepted
Problem: You are given a string S of length N consisting of `A`, `B` and `C`, and an integer K which is between 1 and N (inclusive). Print the string S after lowercasing the K-th character in it.

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

s[k-1] = s[k-1].lower()
print('',join(s))

n, k = map(int, input().split())
s = input()
print(s[k-1].lower)


n, k = map(int, input().split())
s = list(input())
 
s[k-1] = s[k-1].lower()
print(''.join(s))

Verdicts: Runtime Error

Wrong Answer

Accepted
Problem: You are given a string S of length N consisting of `A`, `B` and `C`, and an integer K which is between 1 and N (inclusive). Print the string S after lowercasing the K-th character in it.

Submission attempts (in order):
S = str(input())
li = [(i+j) for (i,j) in zip(S[::2],S[1::2])]
if int(li[0]) == 00 or int(li[1]) == 00:
    print('NA')
elif int(li[0]) <= 12 and int(li[1]) <= 12:
    print('AMBIGUOUS')
elif int(li[0]) >= 13 and int(li[1]) <= 12:
    print('YYMM')
elif int(li[0]) <= 12 and int(li[1]) >= 13:
    print('MMYY')
else:
    print('NA')

N,K = map(int,input().split())
strlist = list(input())
ans = ''
S = strlist[K-1].lower()
strlist[K-1] = S
for i in strlist:
    ans += i
print(ans)

Verdicts: Runtime Error

Accepted
Problem: You are given a string S of length N consisting of `A`, `B` and `C`, and an integer K which is between 1 and N (inclusive). Print the string S after lowercasing the K-th character in it.

Submission attempts (in order):
import sys
sys.setrecursionlimit(10 ** 6)

n = int(input())
edges = [[] for _ in range(n + 1)]
for _ in range(n - 1):
	u, v, w = list(map(int, input().split()))
	edges[u].append([v, w % 2])
	edges[v].append([u, w % 2])


bw = [-1 for i in range(n + 1)]
bw[1] = 0

def dfs(frm):
	for ne in edges[frm]:
		if bw[ne[0]] >= 0:
			continue
		else:
			bw[ne[0]] = abs(bw[frm] - ne[1])
			dfs(ne[0])

dfs(1)
for i in range(1, n + 1):
	print(bw[i])


n, k = list(map(int, input().split()))
s = list(input())
d = {"A":"a", "B":"b", "C":"c"}
s[k-1] = d[s[k-1]]
print("".join(s))

Verdicts: Runtime Error

Accepted
Problem: You are given a string S of length N consisting of `A`, `B` and `C`, and an integer K which is between 1 and N (inclusive). Print the string S after lowercasing the K-th character in it.

Submission attempts (in order):
n,k= map(int,input().split())
s = str(input())
if(s[k-1]=="A"):
  s[k-1]="a"
elif(s[k-1]=="B"):
  s[k-1]="b"
else:
  s[k-1]="c"
print(s)

n,k = map(int,input().split())
s = str(input())
ans = ""
for i in range(n):
  if(i==k-1):
    if(s[i]=="A"):
      ans+="a"
    elif(s[i]=="B"):
      ans+="b"
    else:
      ans+="c"
  else:
    ans+=s[i]
print(ans)

Verdicts: Runtime Error

Accepted
Problem: You are given a string S of length N consisting of `A`, `B` and `C`, and an integer K which is between 1 and N (inclusive). Print the string S after lowercasing the K-th character in it.

Submission attempts (in order):
N, K = map(int, input().split())
S = input()
S[K-1].lower()

print(S)

import math

N, K = map(int,input().split())
#N, K = 3, 10

ans = 0
total = 0
for i in range(0,N):
	
	dice_times = int(math.log2(K/(i+1))) + 1
	total = total + (0.5**dice_times)

ans = (1/N) * total
print(ans)


N, K = map(int, input().split())
S = input()

print(S[0:K-2]+S[K-1].lower()+S[K:N-1])


#N,K = 3,1
N, K = map(int, input().split())
S = input()
#S = "ABC"

print(S[0:K-1]+S[K-1].lower()+S[K:N])


Verdicts: Wrong Answer

Wrong Answer

Wrong Answer

Accepted
Problem: You are given a string S of length N consisting of `A`, `B` and `C`, and an integer K which is between 1 and N (inclusive). Print the string S after lowercasing the K-th character in it.

Submission attempts (in order):
N,K = map(int, input().split())
S = input()

for i in range(1,N+1):
    if i == K:
        S[i] == S[i].lower()

print(S)

N,K = map(int, input().split())
S = input()
S = list(S)

for i in range(1,N):
    if i == K:
        S[i] = S[i].lower()

S = ''.join(S)
print(S)

N,K = map(int, input().split())
S = input()
S = list(S)

for i in range(N):
    if i == K-1:
        S[i] = S[i].lower()

S = ''.join(S)
print(S)

Verdicts: Runtime Error

Wrong Answer

Accepted
Problem: You are given a string S of length N consisting of `A`, `B` and `C`, and an integer K which is between 1 and N (inclusive). Print the string S after lowercasing the K-th character in it.

Submission attempts (in order):
S = input()
A = S[:2]
A = int(A)
B = S[2:]
B = int(B)
if 0<A<13 and 0<B<13:
  print("AMBIGUOUS")
elif 0<A<13:
  print("MMYY")
elif 0<B<13:
  print("YYMM")
else:
  print("NA")

N,K = map(int,input().split())
S = input()
x = ''
for i in range(N):
  if i != K-1:
    x += S[i]
  else:
    x += S[i].lower()
print(x)

Verdicts: Wrong Answer

Accepted
Problem: You are given a string S of length N consisting of `A`, `B` and `C`, and an integer K which is between 1 and N (inclusive). Print the string S after lowercasing the K-th character in it.

Submission attempts (in order):
n,m = map(int,input().split())
s = str(input())
print(s[:m-1]+s[m-1].lower+s[m-1])

n,m = map(int,input().split())
s = str(input())
print(s[:m-1]+chr(ord(s[m-1])-ord("A")+ord("a"))+s[m:])

Verdicts: Runtime Error

Accepted
Problem: You are given a string S of length N consisting of `A`, `B` and `C`, and an integer K which is between 1 and N (inclusive). Print the string S after lowercasing the K-th character in it.

Submission attempts (in order):
N, K =map(int, input().split())
st = input()
print(st[:N-1] + st[N-1].lower()+st[N+1:])

N, K = map(int, input().split())
s = input()

print(s[:K-1]+s[K-1].lower()+s[K:])


Verdicts: Wrong Answer

Accepted
Problem: You are given a string S of length N consisting of `A`, `B` and `C`, and an integer K which is between 1 and N (inclusive). Print the string S after lowercasing the K-th character in it.

Submission attempts (in order):
N, K = map(int, input().split())
S = input()
print(S[:K-1] + S[K-1].lower + S[K:])

N, K = map(int, input().split())
S = input()
print(S[:K-1] + S[K-1].lower() + S[K:])

Verdicts: Runtime Error

Accepted
Problem: You are given a string S of length N consisting of `A`, `B` and `C`, and an integer K which is between 1 and N (inclusive). Print the string S after lowercasing the K-th character in it.

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

str = ""
for i in range(n):
  if i == k:
    str += s[i].lower()
  else:
    str += s[i]

print(str)
  

n, k = map(lambda x: int(x), input().split())
s = input()
 
str = ""
for i in range(n):
  if i - 1 == k:
    str += s[i].lower()
  else:
    str += s[i]
print(str)

n, k = map(lambda x: int(x), input().split())
s = input()

st = s[k].upper()
print(s[:k] + st + s[k+1:])

n, k = map(lambda x: int(x), input().split())
s = input()

str = ""
for i in range(n):
  if i == k:
    str += s[i].upper()
  else:
    str += s[i]

print(str)
  

n, k = map(lambda x: int(x), input().split())
s = input()

s[k] = s[k].upper()
print(s)

n, k = map(lambda x: int(x), input().split())
s = input()
 
str = ""
for i in range(n):
  if i + 1 == k:
    str += s[i].lower()
  else:
    str += s[i]
print(str)

Verdicts: Wrong Answer

Wrong Answer

Runtime Error

Wrong Answer

Runtime Error

Accepted
Problem: You are given a string S of length N consisting of `A`, `B` and `C`, and an integer K which is between 1 and N (inclusive). Print the string S after lowercasing the K-th character in it.

Submission attempts (in order):
N=int(input(""))
K=int(input(""))
s=str(input(""))
print(s[0:K-1]+s[K-1].lower()+s[K:])

N=int(input(""))
K=int(input(""))
s=str(input(""))
print(s[0:K-1]+s[K-1].lower()+s[K:])

N=input("")
N=N.split(" ")
K=int(N[1])
N=N[0]
s=str(input(""))
print(s[0:K-1]+s[K-1].lower()+s[K:])

Verdicts: Runtime Error

Runtime Error

Accepted
Problem: You are given a string S of length N consisting of `A`, `B` and `C`, and an integer K which is between 1 and N (inclusive). Print the string S after lowercasing the K-th character in it.

Submission attempts (in order):
N, K = map(int, input().split())
S = list(input())
S[K-1] = S[K-1].lower()
print(S)
for c in S:
    print(c, end="")
print()


N, K = map(int, input().split())
S = list(input())
S[K-1] = S[K-1].lower()
for c in S:
    print(c, end="")
print()


Verdicts: Wrong Answer

Accepted
Problem: You are given a string S of length N consisting of `A`, `B` and `C`, and an integer K which is between 1 and N (inclusive). Print the string S after lowercasing the K-th character in it.

Submission attempts (in order):
n, k = map(int, input().split())
s = input()
result = ""
for i in range(len(s)):
  if i == k:
    result += s[i].lower()
  else:
    result += s[i]
print(result)

n, k = map(int, input().split())
s = input()
result = ""
for i in range(len(s)):
  if i == k-1:
    result += s[i].lower()
  else:
    result += s[i]
print(result)

Verdicts: Wrong Answer

Accepted
Problem: You are given a string S of length N consisting of `A`, `B` and `C`, and an integer K which is between 1 and N (inclusive). Print the string S after lowercasing the K-th character in it.

Submission attempts (in order):
N,K = map(int, input().split())
S = input()

if S[K] = 'A':
  S[K] = 'a'
if S[K] = 'B':
  S[K] = 'b'
if S[K] = 'C':
  S[K] = 'c'

print(S)

N,K = map(int, input().split())
S = input()
newS = ''
for i in range(N):
  if i == K-1:
    if S[i] == 'A':
      newS += 'a'
    if S[i] == 'B':
      newS += 'b'
    if S[i] == 'C':
      newS += 'c'
  else:
    newS += '{}'.format(S[i])

print(newS)

Verdicts: Runtime Error

Accepted
Problem: You are given a string S of length N consisting of `A`, `B` and `C`, and an integer K which is between 1 and N (inclusive). Print the string S after lowercasing the K-th character in it.

Submission attempts (in order):
s = input()
if int(s[:2]) > 12 and int(s[2:]) > 12\
        or s[2:] == "00":
        print("NA")
elif  0 <=  int(s[2:]) < 100 and 1 <= int(s[:2]) <= 12:
        print("YYMM")
elif  1<= int(s[:2]) <= 12 and 0 <= int(s[2:]) < 100:
        print("MMYY")
else:
        print("AMBIGUOUS")

# -*- coding:utf-8 -*-

n, k = map(int, input().split())
s = input()
word2 = []
for i, word in enumerate(s):
        if i == k-1:
                word2.append(word.lower())
        else:
                word2.append(word)
print(''.join(word2))

Verdicts: Wrong Answer

Accepted
Problem: You are given a string S of length N consisting of `A`, `B` and `C`, and an integer K which is between 1 and N (inclusive). Print the string S after lowercasing the K-th character in it.

Submission attempts (in order):
n,k = map(int,input().split())
#print(n,k)
S=list(input())
print(S)
s=S.pop(k-1)
print(s)
s=s.lower()
print(s)
S.insert(k-1, s)

print(''.join(S))

n,k = map(int,input().split())
#print(n,k)
s=list(input())
#print(s)
print(s[k-1].lower())



n,k = map(int,input().split())
#print(n,k)
S=list(input())
#print(S)
s=S.pop(k-1)
#print(s)
s=s.lower()
#print(s)
S.insert(k-1, s)

print(''.join(S))



Verdicts: Wrong Answer

Wrong Answer

Accepted
Problem: You are given a string S of length N consisting of `A`, `B` and `C`, and an integer K which is between 1 and N (inclusive). Print the string S after lowercasing the K-th character in it.

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

print(s[:k-1]+s[k-1].lower()+s[k-1:])

n,k=map(int,input().split())
s=input()

print(s[:k-1]+s[k-1].lower()+s[k:])


Verdicts: Wrong Answer

Accepted
Problem: You are given a string S of length N consisting of `A`, `B` and `C`, and an integer K which is between 1 and N (inclusive). Print the string S after lowercasing the K-th character in it.

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

if moji[b-1]=="A":
  print(moji[:b-2]+"a"+moji[b:])
elif moji[b-1]=="B":
  print(moji[:b-2]+"b"+moji[b:])
else:
  print(moji[:b-2]+"c"+moji[b:])

a,b=map(int,input().split())
moji=input()

if moji[b-1]=="A":
  print(moji[:b-1]+"a"+moji[b:])
elif moji[b-1]=="B":
  print(moji[:b-1]+"b"+moji[b:])
else:
  print(moji[:b-1]+"c"+moji[b:])

Verdicts: Wrong Answer

Accepted