problem_id stringlengths 6 6 | user_id stringlengths 10 10 | time_limit float64 1k 8k | memory_limit float64 262k 1.05M | problem_description stringlengths 48 1.55k | codes stringlengths 35 98.9k | status stringlengths 28 1.7k | submission_ids stringlengths 28 1.41k | memories stringlengths 13 808 | cpu_times stringlengths 11 610 | code_sizes stringlengths 7 505 |
|---|---|---|---|---|---|---|---|---|---|---|
p03041 | u624218488 | 2,000 | 1,048,576 | 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. | ["a, b = map(int, input().split())\ns = list(input())\ns[b] = s[b].lower()\ns = str(s)\nprint('{}'.format(s))", "a, b = map(int, input().split())\nc = list(input())\nc[b-1] = c[b-1].lower()\nprint('{}'.format(str(c)))", "a, b = map(int, input().split())\nc = input()\nc = list(c)\nif (c[b-1] == 'A'):\n c[b-1] = 'a'\n... | ['Runtime Error', 'Wrong Answer', 'Accepted'] | ['s442849504', 's446889287', 's911556620'] | [2940.0, 2940.0, 3060.0] | [17.0, 17.0, 17.0] | [103, 101, 204] |
p03041 | u626228246 | 2,000 | 1,048,576 | 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. | ['n,k = int(input().split())\ns = list(input())\ns[k-1] = s[k-1].lower()\nprint(str(s))', 'n,k = map(int,input().split())\ns = list(input())\ns[k-1] = s[k-1].lower()\nprint("".join(s)) '] | ['Runtime Error', 'Accepted'] | ['s772748858', 's257303013'] | [2940.0, 2940.0] | [17.0, 17.0] | [82, 146] |
p03041 | u626337957 | 2,000 | 1,048,576 | 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. | ['import sys\nsys.setrecursionlimit(20000)\n\nN = int(input())\nW = [list(map(int, input().split())) for _ in range(N-1)]\nnodes = [[] for _ in range(N+1)]\nfor w in W:\n nodes[w[0]].append((w[1], w[2]))\n nodes[w[1]].append((w[0], w[2]))\nans = [-1] * (N+1)\nans[1] = 0\ndef search(num, root, dis):\n for node ... | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s081824003', 's739133544', 's815730269'] | [3064.0, 2940.0, 3060.0] | [18.0, 17.0, 17.0] | [625, 82, 197] |
p03041 | u627234757 | 2,000 | 1,048,576 | 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. | ["N, K = map(int, input().split())\nS = input()\nif S[K + 1] == 'A':\n S[K + 1] = 'a'\nelif S[K + 1] == 'B':\n S[K + 1] = 'b'\nelse:\n S[K + 1] = 'c'\nprint(S)", "N, K = map(int, input().split())\nS = input()\nif S[K - 1] == 'A':\n S[K - 1] = 'a'\nelif S[K - 1] == 'B':\n S[K - 1] = 'b'\nelse:\n S[K - 1] = 'c'\npr... | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s599147899', 's757898828', 's550080499'] | [2940.0, 2940.0, 2940.0] | [17.0, 17.0, 17.0] | [152, 153, 84] |
p03041 | u627434558 | 2,000 | 1,048,576 | 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. | ['n, k = map(int, input().split())\ns = input()\nprint(s[:k-1] + s[k-1].lower() + s[k-1:])\n', 'n, k = map(int, input().split())\ns = input()\nprint(s[:k-1] + s[k-1].lower() + s[k:])\n'] | ['Wrong Answer', 'Accepted'] | ['s387586044', 's877610296'] | [2940.0, 2940.0] | [17.0, 17.0] | [87, 85] |
p03041 | u627747800 | 2,000 | 1,048,576 | 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. | ["def main(n, k, s):\n l = list(s)\n print(l)\n l[k - 1] = l[k - 1].lower()\n print(''.join(l))\n \nif __name__ == '__main__':\n try:\n n, k = list(map(int, input().strip().split(' ')))\n s = input().strip()\n main(n, k, s)\n except EOFError:\n pass\n", "#!/usr/bin/e... | ['Wrong Answer', 'Accepted'] | ['s803647566', 's867399110'] | [3064.0, 2940.0] | [17.0, 17.0] | [289, 333] |
p03041 | u629350026 | 2,000 | 1,048,576 | 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. | ['n,k=map(int,input().split())\ns=str(input())\ns=list(s)\ns[k-1]=str.lower(s[k-1])\nprint("".join(s))n,k=map(int,input().split())\ns=str(input())\ns=list(s)\ns[k-1]=str.lower(s[k-1])\nprint("".join(s))', 'n,k=map(int,input().split())\ns=str(input())\ns=list(s)\ns[k-1]=str.lower(s[k-1])\nprint("".join(s))'] | ['Runtime Error', 'Accepted'] | ['s740081218', 's912490106'] | [2940.0, 2940.0] | [17.0, 17.0] | [192, 96] |
p03041 | u630004940 | 2,000 | 1,048,576 | 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. | ['N,K=map(int,input().split())\nS=input()\nT=list(S)\nT[K-1]=T[K-1].lower()\nS_changed="".join(T)\nprint(S_changed', 'N,K=map(int,input().split())\nS=input()\nT=list(S)\nT[K-1]=T[K-1].lower()\nS_changed="".join(T)\nprint(S_changed)'] | ['Runtime Error', 'Accepted'] | ['s246850952', 's456957613'] | [2940.0, 2940.0] | [17.0, 17.0] | [107, 108] |
p03041 | u631429391 | 2,000 | 1,048,576 | 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. | ["n,k = map(int,input().split())\ns = input()\nans = ''\nfor i in range(n):\n if i == k-1:\n ans = ans + s[i].lower()\n ans = ans + s[i]\nprint(ans)\n", "n,k = map(int,input().split())\ns = input()\nans = ''\nfor i in len(s):\n if i == k:\n ans = ans + s[i].lower()\n ans = ans + s[i]\nprint(ans)", "n,k = map(... | ['Wrong Answer', 'Runtime Error', 'Wrong Answer', 'Accepted'] | ['s225096056', 's266843166', 's953039689', 's937257687'] | [2940.0, 2940.0, 2940.0, 2940.0] | [17.0, 17.0, 17.0, 17.0] | [145, 140, 143, 166] |
p03041 | u633355062 | 2,000 | 1,048,576 | 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. | ['n, k = map(int, input().split())\ns = input()\nfor i in range(n):\n if i == k - 1:\n print(s[i].lower(), end=="")\n else:\n print(s[i], end=="")', 'n, k = map(int, input().split())\ns = input()\nfor i in range(n):\n if i == k - 1:\n print(s[i].lower(), end="")\n else:\n print(s[i], end="")\nprint()'] | ['Runtime Error', 'Accepted'] | ['s959756413', 's267373010'] | [2940.0, 2940.0] | [18.0, 17.0] | [146, 152] |
p03041 | u634173914 | 2,000 | 1,048,576 | 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. | ['n, k = map(int, input().split())\ns = list(input())\n\nc = s[k-1]\ns[k-1] = c.lower()\nprint(s)\n', "n, k = map(int, input().split())\ns = list(input())\nmoji = ''\n\nc = s[k-1]\ns[k-1] = c.lower()\nfor x in s:\n moji += x\nprint(moji)\n"] | ['Wrong Answer', 'Accepted'] | ['s610706693', 's776021828'] | [2940.0, 2940.0] | [17.0, 17.0] | [91, 130] |
p03041 | u635252313 | 2,000 | 1,048,576 | 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. | ['n,k=map(int,input().split())\ns=input()\na=s[k-1].lower\nprint(s[:k-1]+a+s[k:])', 'n,k=map(int,input().split())\ns=input()\nprint(s[:k-1]+s[k-1].lower()+s[k:])'] | ['Runtime Error', 'Accepted'] | ['s271157321', 's146752272'] | [2940.0, 2940.0] | [17.0, 18.0] | [76, 74] |
p03041 | u635958201 | 2,000 | 1,048,576 | 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. | ['M,K=map(int,input().split())\nif K>2**M-1:\n print(-1)\nelif K==0:\n a=0\n while a<=2**M-1:\n print(a)\n a+=1\n a-=1\n while a>=0:\n print(a)\n a-=1\n\nelif 0<K<2**M:\n print(K)\n b=0\n while b<K:\n print(b)\n b+=1\n b+=1\n while b<2**M:\n ... | ['Wrong Answer', 'Accepted'] | ['s998535338', 's401303354'] | [18768.0, 2940.0] | [2103.0, 17.0] | [374, 152] |
p03041 | u638033979 | 2,000 | 1,048,576 | 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. | ['N,K = [int(x) for x in input().split()]\n\nL = [0]*N\nnum =1\nfor i in range(N):\n num = 1\n if i < K:\n while num*(i+1) < K:\n num *= 2\n L[i]= 1/N * 1/num\n else:\n L[i] = 1/N\n\nans = 0\nfor i in range(N):\n ans +=L[i]\n\nprint(ans)', 'N,K = [int(x) for x in input()... | ['Wrong Answer', 'Accepted'] | ['s131436952', 's893382809'] | [3060.0, 2940.0] | [17.0, 17.0] | [267, 103] |
p03041 | u639104973 | 2,000 | 1,048,576 | 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. | ['N,K=map(int, input().split())\nS=input()\nprint(S[K-1].lower())\n#if K==1:\n# S=S[K-1].lower()+S[K:]\n#elif K==N:\n# S=S[:K-1]+S[K-1].lower()\n#else:\nS=S[:K-1]+S[K-1].lower()+S[K:]\nprint(S)', 'N,K=map(int, input().split())\nS=input()\nprint(S[K-1].lower())\nif K==1:\n S=S[K-1].lower()+S[K:]\nelif K==N:\n S=S[:K... | ['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s001336107', 's106231229', 's140070680', 's916240624', 's948472853', 's419977560'] | [2940.0, 3060.0, 3060.0, 3060.0, 3060.0, 2940.0] | [17.0, 17.0, 17.0, 18.0, 17.0, 17.0] | [184, 181, 159, 181, 181, 79] |
p03041 | u640800355 | 2,000 | 1,048,576 | 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. | ['n,k=map(int,input().split())\ns=input()\n\na=(s[n-2]).lower()\n\nprint(s[0:n-2] + a + s[n-1:])', 'n,k=map(int,input().split())\ns=input()\n\na=(s[k-1]).lower()\n\nprint(s[0:k-1] + a + s[k:])'] | ['Wrong Answer', 'Accepted'] | ['s338331781', 's326675905'] | [2940.0, 2940.0] | [17.0, 17.0] | [89, 87] |
p03041 | u641384894 | 2,000 | 1,048,576 | 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. | ['# coding: utf-8\nn, k = map(int,input().split())\ns = input()\ns_list=list(s)\ns_list[k-1].lower()\nprint(s_list)\n', '# coding: utf-8\nn, k = map(int,input().split())\ns = input()\ns_list=list(s)\ns_list[k-1].lower()\nprint("".join(s_list))\n', '# coding: utf-8\nn, k = map(int,input().split())\ns = input()\ns_list=l... | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s141607478', 's451040815', 's654354902'] | [2940.0, 2940.0, 2940.0] | [17.0, 17.0, 17.0] | [109, 118, 150] |
p03041 | u642120132 | 2,000 | 1,048,576 | 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. | ["_, k = map(int, input().split())\ns = list(input())\ns[k-1] = s[k-1].upper()\nprint(''.join(s))", "_, k = map(int, input().split())\ns = list(input())\ns[k-1] = s[k-1].lower()\nprint(''.join(s))"] | ['Wrong Answer', 'Accepted'] | ['s921337423', 's561494211'] | [2940.0, 2940.0] | [17.0, 17.0] | [92, 92] |
p03041 | u642418876 | 2,000 | 1,048,576 | 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. | ['N,K=map(int,input().split())\nS=str(input())\nprint(S.replace(S[K-1],S[K-1].lower())\n ', "N,K=map(int,input().split())\nS=list(input())\nS[K-1]=S[K-1].lower()\nprint(''.join(S))\n\n "] | ['Runtime Error', 'Accepted'] | ['s834117668', 's587032112'] | [2940.0, 2940.0] | [17.0, 17.0] | [89, 88] |
p03041 | u644360640 | 2,000 | 1,048,576 | 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. | ['N,K=map(int,input().split())\nS = input()\nS[K] = S[K].lower()\nprint(S)', "N,K=map(int,input().split())\nS = input()\nlist = [b.lower() if a+1==K else b for (a,b) in enumerate(S)]\nmoji = ''.join(list)\nprint(moji)"] | ['Runtime Error', 'Accepted'] | ['s826917882', 's095666822'] | [2940.0, 2940.0] | [17.0, 17.0] | [69, 135] |
p03041 | u644568755 | 2,000 | 1,048,576 | 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. | ["n, k = map(int, input().split())\ns = list(input())\n\ns[k-1] = s[k-1].lower()\nprint('',join(s))", 'n, k = map(int, input().split())\ns = input()\nprint(s[k-1].lower)\n', "n, k = map(int, input().split())\ns = list(input())\n \ns[k-1] = s[k-1].lower()\nprint(''.join(s))"] | ['Runtime Error', 'Wrong Answer', 'Accepted'] | ['s275551669', 's883926853', 's043323860'] | [2940.0, 2940.0, 2940.0] | [18.0, 17.0, 17.0] | [93, 65, 94] |
p03041 | u646401590 | 2,000 | 1,048,576 | 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. | ["S = str(input())\nli = [(i+j) for (i,j) in zip(S[::2],S[1::2])]\nif int(li[0]) == 00 or int(li[1]) == 00:\n print('NA')\nelif int(li[0]) <= 12 and int(li[1]) <= 12:\n print('AMBIGUOUS')\nelif int(li[0]) >= 13 and int(li[1]) <= 12:\n print('YYMM')\nelif int(li[0]) <= 12 and int(li[1]) >= 13:\n print('MMYY'... | ['Runtime Error', 'Accepted'] | ['s328625931', 's407433051'] | [3064.0, 3060.0] | [17.0, 17.0] | [332, 147] |
p03041 | u653807637 | 2,000 | 1,048,576 | 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. | ['import sys\nsys.setrecursionlimit(10 ** 6)\n\nn = int(input())\nedges = [[] for _ in range(n + 1)]\nfor _ in range(n - 1):\n\tu, v, w = list(map(int, input().split()))\n\tedges[u].append([v, w % 2])\n\tedges[v].append([u, w % 2])\n\n\nbw = [-1 for i in range(n + 1)]\nbw[1] = 0\n\ndef dfs(frm):\n\tfor ne in edges[frm]... | ['Runtime Error', 'Accepted'] | ['s101344609', 's121612763'] | [3064.0, 3316.0] | [17.0, 21.0] | [440, 125] |
p03041 | u655048024 | 2,000 | 1,048,576 | 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. | ['n,k= map(int,input().split())\ns = str(input())\nif(s[k-1]=="A"):\n s[k-1]="a"\nelif(s[k-1]=="B"):\n s[k-1]="b"\nelse:\n s[k-1]="c"\nprint(s)', 'n,k = map(int,input().split())\ns = str(input())\nans = ""\nfor i in range(n):\n if(i==k-1):\n if(s[i]=="A"):\n ans+="a"\n elif(s[i]=="B"):\n ans+="b"\n ... | ['Runtime Error', 'Accepted'] | ['s614444492', 's654323537'] | [3060.0, 3064.0] | [18.0, 17.0] | [136, 217] |
p03041 | u658627575 | 2,000 | 1,048,576 | 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. | ['N, K = map(int, input().split())\nS = input()\nS[K-1].lower()\n\nprint(S)', 'import math\n\nN, K = map(int,input().split())\n#N, K = 3, 10\n\nans = 0\ntotal = 0\nfor i in range(0,N):\n\t\n\tdice_times = int(math.log2(K/(i+1))) + 1\n\ttotal = total + (0.5**dice_times)\n\nans = (1/N) * total\nprint(ans)\n', 'N, K = map... | ['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s231673264', 's336432144', 's929399002', 's380550246'] | [2940.0, 3060.0, 2940.0, 2940.0] | [17.0, 17.0, 17.0, 17.0] | [69, 253, 86, 106] |
p03041 | u663014688 | 2,000 | 1,048,576 | 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. | ['N,K = map(int, input().split())\nS = input()\n\nfor i in range(1,N+1):\n if i == K:\n S[i] == S[i].lower()\n\nprint(S)', "N,K = map(int, input().split())\nS = input()\nS = list(S)\n\nfor i in range(1,N):\n if i == K:\n S[i] = S[i].lower()\n\nS = ''.join(S)\nprint(S)", "N,K = map(int, input().split... | ['Runtime Error', 'Wrong Answer', 'Accepted'] | ['s638364736', 's706219871', 's247782387'] | [2940.0, 2940.0, 2940.0] | [17.0, 17.0, 17.0] | [121, 145, 145] |
p03041 | u664762434 | 2,000 | 1,048,576 | 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. | ['S = input()\nA = S[:2]\nA = int(A)\nB = S[2:]\nB = int(B)\nif 0<A<13 and 0<B<13:\n print("AMBIGUOUS")\nelif 0<A<13:\n print("MMYY")\nelif 0<B<13:\n print("YYMM")\nelse:\n print("NA")', "N,K = map(int,input().split())\nS = input()\nx = ''\nfor i in range(N):\n if i != K-1:\n x += S[i]\n else:\n x += S[i].l... | ['Wrong Answer', 'Accepted'] | ['s037661956', 's468797067'] | [3060.0, 2940.0] | [17.0, 17.0] | [174, 136] |
p03041 | u667024514 | 2,000 | 1,048,576 | 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. | ['n,m = map(int,input().split())\ns = str(input())\nprint(s[:m-1]+s[m-1].lower+s[m-1])', 'n,m = map(int,input().split())\ns = str(input())\nprint(s[:m-1]+chr(ord(s[m-1])-ord("A")+ord("a"))+s[m:])'] | ['Runtime Error', 'Accepted'] | ['s618332362', 's336119658'] | [2940.0, 2940.0] | [16.0, 17.0] | [82, 103] |
p03041 | u667084803 | 2,000 | 1,048,576 | 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. | ['N, K =map(int, input().split())\nst = input()\nprint(st[:N-1] + st[N-1].lower()+st[N+1:])', 'N, K = map(int, input().split())\ns = input()\n\nprint(s[:K-1]+s[K-1].lower()+s[K:])\n'] | ['Wrong Answer', 'Accepted'] | ['s354996595', 's111338498'] | [3316.0, 2940.0] | [20.0, 17.0] | [87, 82] |
p03041 | u667458133 | 2,000 | 1,048,576 | 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. | ['N, K = map(int, input().split())\nS = input()\nprint(S[:K-1] + S[K-1].lower + S[K:])', 'N, K = map(int, input().split())\nS = input()\nprint(S[:K-1] + S[K-1].lower() + S[K:])'] | ['Runtime Error', 'Accepted'] | ['s954423647', 's560304383'] | [2940.0, 2940.0] | [17.0, 17.0] | [82, 84] |
p03041 | u668352391 | 2,000 | 1,048,576 | 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. | ['n, k = map(lambda x: int(x), input().split())\ns = input()\n\nstr = ""\nfor i in range(n):\n if i == k:\n str += s[i].lower()\n else:\n str += s[i]\n\nprint(str)\n ', 'n, k = map(lambda x: int(x), input().split())\ns = input()\n \nstr = ""\nfor i in range(n):\n if i - 1 == k:\n str += s[i].lower()\n els... | ['Wrong Answer', 'Wrong Answer', 'Runtime Error', 'Wrong Answer', 'Runtime Error', 'Accepted'] | ['s003774421', 's403070974', 's475297652', 's681586523', 's971371928', 's066345742'] | [2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0] | [18.0, 17.0, 17.0, 17.0, 17.0, 17.0] | [162, 163, 104, 162, 87, 163] |
p03041 | u669098512 | 2,000 | 1,048,576 | 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. | ['N=int(input(""))\nK=int(input(""))\ns=str(input(""))\nprint(s[0:K-1]+s[K-1].lower()+s[K:])', 'N=int(input(""))\nK=int(input(""))\ns=str(input(""))\nprint(s[0:K-1]+s[K-1].lower()+s[K:])', 'N=input("")\nN=N.split(" ")\nK=int(N[1])\nN=N[0]\ns=str(input(""))\nprint(s[0:K-1]+s[K-1].lower()+s[K:])'] | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s468162049', 's552575666', 's692552934'] | [8980.0, 9076.0, 9120.0] | [29.0, 21.0, 26.0] | [87, 87, 99] |
p03041 | u669686752 | 2,000 | 1,048,576 | 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. | ['N, K = map(int, input().split())\nS = list(input())\nS[K-1] = S[K-1].lower()\nprint(S)\nfor c in S:\n print(c, end="")\nprint()\n', 'N, K = map(int, input().split())\nS = list(input())\nS[K-1] = S[K-1].lower()\nfor c in S:\n print(c, end="")\nprint()\n'] | ['Wrong Answer', 'Accepted'] | ['s371993382', 's187734075'] | [2940.0, 2940.0] | [18.0, 18.0] | [125, 116] |
p03041 | u672898046 | 2,000 | 1,048,576 | 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. | ['n, k = map(int, input().split())\ns = input()\nresult = ""\nfor i in range(len(s)):\n if i == k:\n result += s[i].lower()\n else:\n result += s[i]\nprint(result)', 'n, k = map(int, input().split())\ns = input()\nresult = ""\nfor i in range(len(s)):\n if i == k-1:\n result += s[i].lower()\n else:\n res... | ['Wrong Answer', 'Accepted'] | ['s963954341', 's347660241'] | [2940.0, 2940.0] | [17.0, 17.0] | [161, 163] |
p03041 | u674951726 | 2,000 | 1,048,576 | 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. | ["N,K = map(int, input().split())\nS = input()\n\nif S[K] = 'A':\n S[K] = 'a'\nif S[K] = 'B':\n S[K] = 'b'\nif S[K] = 'C':\n S[K] = 'c'\n\nprint(S)", "N,K = map(int, input().split())\nS = input()\nnewS = ''\nfor i in range(N):\n if i == K-1:\n if S[i] == 'A':\n newS += 'a'\n if S[i] == 'B':\n newS +... | ['Runtime Error', 'Accepted'] | ['s199727120', 's234978873'] | [2940.0, 3060.0] | [17.0, 17.0] | [138, 252] |
p03041 | u680004123 | 2,000 | 1,048,576 | 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. | ['s = input()\nif int(s[:2]) > 12 and int(s[2:]) > 12\\\n or s[2:] == "00":\n print("NA")\nelif 0 <= int(s[2:]) < 100 and 1 <= int(s[:2]) <= 12:\n print("YYMM")\nelif 1<= int(s[:2]) <= 12 and 0 <= int(s[2:]) < 100:\n print("MMYY")\nelse:\n print("AMBIGUOUS")', "# -*- coding:utf-8 -... | ['Wrong Answer', 'Accepted'] | ['s012920807', 's123669194'] | [3060.0, 2940.0] | [17.0, 17.0] | [284, 243] |
p03041 | u680851063 | 2,000 | 1,048,576 | 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. | ["n,k = map(int,input().split())\n#print(n,k)\nS=list(input())\nprint(S)\ns=S.pop(k-1)\nprint(s)\ns=s.lower()\nprint(s)\nS.insert(k-1, s)\n\nprint(''.join(S))", 'n,k = map(int,input().split())\n#print(n,k)\ns=list(input())\n#print(s)\nprint(s[k-1].lower())\n\n', "n,k = map(int,input().split())\n#print(n,k)\nS=list(inpu... | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s688378456', 's790854995', 's200337858'] | [3060.0, 2940.0, 2940.0] | [17.0, 17.0, 18.0] | [146, 92, 151] |
p03041 | u681110193 | 2,000 | 1,048,576 | 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. | ['n,k=map(int,input().split())\ns=input()\n\nprint(s[:k-1]+s[k-1].lower()+s[k-1:])', 'n,k=map(int,input().split())\ns=input()\n\nprint(s[:k-1]+s[k-1].lower()+s[k:])\n'] | ['Wrong Answer', 'Accepted'] | ['s106490744', 's074313831'] | [2940.0, 2940.0] | [17.0, 17.0] | [77, 76] |
p03041 | u681444474 | 2,000 | 1,048,576 | 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. | ['a,b=map(int,input().split())\nmoji=input()\n\nif moji[b-1]=="A":\n print(moji[:b-2]+"a"+moji[b:])\nelif moji[b-1]=="B":\n print(moji[:b-2]+"b"+moji[b:])\nelse:\n print(moji[:b-2]+"c"+moji[b:])', 'a,b=map(int,input().split())\nmoji=input()\n\nif moji[b-1]=="A":\n print(moji[:b-1]+"a"+moji[b:])\nelif moji[b-1]=="B"... | ['Wrong Answer', 'Accepted'] | ['s338557563', 's228154962'] | [3060.0, 3060.0] | [17.0, 17.0] | [187, 187] |
p03041 | u682467216 | 2,000 | 1,048,576 | 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. | ['import math\n\nS = int(input())\n\nfirst_half = math.floor(S / 100)\nsecond_half = S - first_half * 100\n\nif 1 <= second_half <= 12 and 1 <= first_half <= 12 :\n print("AMBIGUOUS")\nelse:\n if 1 <= second_half <= 12 :\n \t\tprint("YYMM")\n elif 0 == first_half or 12 < first_half :\n \tprint("NA")\n else: \n... | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s125607850', 's323283728', 's395116781', 's731889510', 's799085190', 's826737687', 's254967327'] | [3060.0, 2940.0, 3060.0, 3060.0, 3060.0, 2940.0, 3060.0] | [17.0, 17.0, 17.0, 17.0, 18.0, 17.0, 17.0] | [321, 163, 301, 290, 330, 274, 167] |
p03041 | u682860781 | 2,000 | 1,048,576 | 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. | ['n, k = map(int, input().split())\ns = input()\nanswer = []\n\nprint(s[k-1].lower())\nfor i, c in enumerate(s, 1):\n if i == k:\n answer.append(c.lower())\n else:\n answer.append(c)\nprint("".join(answer))', 'n, k = map(int, input().split())\ns = input()\nanswer = []\n\nfor i, c in enumerate(s, 1):... | ['Wrong Answer', 'Accepted'] | ['s691721648', 's196392741'] | [3060.0, 2940.0] | [17.0, 17.0] | [214, 192] |
p03041 | u689626103 | 2,000 | 1,048,576 | 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. | ['N, K = list(map(int, input().split()))\nS = int(input())\n\nS[K-1] = S[K-1].lower()\n\nprint(S)', "N, K = input().split()\nK = int(K)\nS = list(input())\n\nS[K-1] = S[K-1].lower()\n \nprint(''.join(S))"] | ['Runtime Error', 'Accepted'] | ['s003598290', 's557197731'] | [2940.0, 2940.0] | [18.0, 17.0] | [90, 96] |
p03041 | u691896522 | 2,000 | 1,048,576 | 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. | ['n, k = list(map(int, input().split()))\ns = input()\ns[k - 1] = (s[k - 1]).lower()\nprint(s)', 'n, k = list(map(int, input().split()))\ns = input()\ns[k - 1] =\u3000lower(s[k - 1])\nprint(s)', 'n, k = list(map(int, input().split()))\ns = list(input())\nprint(s[k - 1])\ns[k - 1] = s[k - 1].lower()\nprint(*s, sep = "")... | ['Runtime Error', 'Runtime Error', 'Wrong Answer', 'Accepted'] | ['s031582182', 's170607433', 's394548954', 's784343687'] | [2940.0, 2940.0, 2940.0, 2940.0] | [19.0, 17.0, 17.0, 17.0] | [89, 88, 120, 105] |
p03041 | u694402282 | 2,000 | 1,048,576 | 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. | ['n, k = map(int, input().split())\ns = input()\nt = s[k-1]\nans = s[:k-1] + t.lower() + s[k:]\n', 'n, k = map(int, input().split())\ns = input()\nt = s[k-1]\nans = s[:k-1] + t.lower() + s[k:]\nprint(ans)\n'] | ['Wrong Answer', 'Accepted'] | ['s323754770', 's568295599'] | [2940.0, 2940.0] | [17.0, 17.0] | [90, 101] |
p03041 | u698416089 | 2,000 | 1,048,576 | 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. | ['k = int(input().split()[1])\ns = input()\nprint(s[0:k]+s[k:k+1].lower()+s[k+1:len(s)+1])', 'k = int(input().split()[1])\ns = input()\nprint(s[0:k-1]+s[k-1:k].lower()+s[k:len(s)+1])'] | ['Wrong Answer', 'Accepted'] | ['s251905955', 's833020510'] | [2940.0, 2940.0] | [17.0, 19.0] | [86, 86] |
p03041 | u700556286 | 2,000 | 1,048,576 | 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. | ['def get_s(w, e):\n s = w + 1\n if s == k:\n if e == "A":\n return "a"\n elif e == "B":\n return "b"\n else:\n return "c"\n else:\n return e\n\n\ni = list(map(int, input().split()))\n\nk = i[1]\n\n\na = list(input())\n\n\nab = 0\n\nwhile ab < i[0]:\... | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s252227994', 's887788648', 's499235510'] | [3060.0, 3060.0, 3064.0] | [17.0, 17.0, 17.0] | [356, 357, 394] |
p03041 | u701318346 | 2,000 | 1,048,576 | 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. | ["S = input()\nS1 = int(S[:2])\nS2 = int(S[2:])\n\nif (1 <= S1 <= 12) and (1 <= S2 <= 12):\n\tprint('AMBIGUOUS')\nelif (1 <= S1 <= 12):\n\tprint('MMYY')\nelif (1 <= S2 <= 12):\n\tprint('YYMM')\nelse:\n\tprint('NA')", "S = input()\nS1 = S[:1]\nS2 = S[2:]\nmonth = ['01', '02', '03', '04', '05', '06', '07', '08', '09', '1... | ['Wrong Answer', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s243336181', 's401914873', 's542923998', 's160450572'] | [3316.0, 2940.0, 2940.0, 3316.0] | [20.0, 17.0, 17.0, 19.0] | [197, 318, 226, 130] |
p03041 | u703130195 | 2,000 | 1,048,576 | 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. | ['N, K = map(int, input().split())\ns = list(input())\ns[K-1] = s[K-1].lower()\nprint(s)', "N, K = map(int, input().split())\ns = list(input())\ns[K-1] = s[K-1].lower()\nprint(''.join(s))\n"] | ['Wrong Answer', 'Accepted'] | ['s004161977', 's005889237'] | [3064.0, 2940.0] | [17.0, 17.0] | [83, 93] |
p03041 | u703499662 | 2,000 | 1,048,576 | 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. | ['a=input().split()\na=list(map(int,a))\nini=a[0]\nobj=a[1]\nposs=0\ni=1\ndivini=1\npot=0\nposini=i/ini\nwhile i<=ini:\n pot=0\n divini=i\n while divini<obj:\n divini=divini*2\n pot+=1\n i=i+1\n poss=poss+(posini*((1/2)**pot))\nprint(poss)', "a=input()\ni=0\nn=[]\nwhile i<len(a):\n n.append(a[i])\n i+=1\np... | ['Wrong Answer', 'Runtime Error', 'Accepted'] | ['s193810640', 's607132156', 's444123925'] | [3064.0, 3064.0, 3060.0] | [17.0, 17.0, 17.0] | [231, 456, 164] |
p03041 | u704252625 | 2,000 | 1,048,576 | 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. | ["N, K = map(int, input().split())\nS = input()\n\nprint(S[1:K] + {'A': 'a', 'B': 'b', 'C': 'c'}[S[K]] + (S[K+1:] if K+1 < N else ''))", "N, K = map(int, input().split())\nS = input()\n\nprint(S[:K] + {'A': 'a', 'B': 'b', 'C': 'c'}[S[K]] + (S[K+1:] if K+1 < N else ''))\n", "N, K = map(int, input().split())\nS = input()... | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s638233762', 's854702824', 's975624790'] | [3060.0, 2940.0, 2940.0] | [17.0, 17.0, 17.0] | [129, 129, 135] |
p03041 | u704460404 | 2,000 | 1,048,576 | 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. | ["N = int(input())\nK = int(input())\nS = input()\ns1 = S[:K - 1]\ns2 = S[K:]\n\nif S[K - 1] == 'A':\n s = s1 + 'a' + s2\n\nelif S[K - 1] == 'B':\n s = s1 + 'b' + s2\n\nelse:\n s = s1 + 'c' + s2\n\nprint(s)\n", "N = int(input())\nK = int(input())\nS = input()\n\nif S[K - 1] == 'A':\n s = S.replace('A', 'a')\n... | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s245648699', 's353345581', 's421981565', 's532816412', 's845815262', 's600364458'] | [3060.0, 3060.0, 2940.0, 3060.0, 3188.0, 2940.0] | [17.0, 17.0, 17.0, 17.0, 18.0, 17.0] | [199, 185, 175, 203, 314, 121] |
p03041 | u705418271 | 2,000 | 1,048,576 | 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. | ['n,k=map(int,input().split())\ns=str(input())\nif s[k-1]=="A":\n s[k-1]=="a"\nelif s[k-1]=="B":\n s[k-1]=="b"\nelse:\n s[k-1]="c"\nprint(s)', "n,k=map(int,input().split())\ns=list(input())\ns[k-1]=s[k-1].lower()\nprint(''.join(s))"] | ['Runtime Error', 'Accepted'] | ['s263046274', 's788573486'] | [9160.0, 9024.0] | [26.0, 24.0] | [133, 84] |
p03041 | u708255304 | 2,000 | 1,048,576 | 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. | ['N = int(input())\ngraph = [[] for _ in range(N)]\n\nfor i in range(N-1):\n u, v, w = map(int, input().split())\n graph[u-1].append((v-1, w))\n graph[v-1].append((u-1, w))\n\n# print(graph)\n\nflag = [None for _ in range(N)] \n\n\ndef k(v, distance): \n flag[v] = distance \n\n for next_v, w in graph[... | ['Runtime Error', 'Accepted'] | ['s212139569', 's972502214'] | [3064.0, 2940.0] | [17.0, 17.0] | [872, 127] |
p03041 | u710398282 | 2,000 | 1,048,576 | 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. | ["N, K = map(int, input().split())\ns3 =[]\n\ns = list(input())\n\ns1 = s\n\n\ns2= s1[K]\n\ns3 = s2.lower()\n\ns1[K] = s3\n\nprint('' .join(s1))\n", "N, K = map(int, input().split())\ns3 =[]\n\ns = list(input())\n\ns1 = s\n\n\ns2= s1[K-1]\n\ns3 = s2.lower()\n\ns1[K-1] = s3\n\nprint('' .join(s1))"] | ['Runtime Error', 'Accepted'] | ['s994401702', 's592363028'] | [9140.0, 9088.0] | [26.0, 26.0] | [129, 132] |
p03041 | u711950144 | 2,000 | 1,048,576 | 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. | ['n,k=tuple(map(int,input().split()))\nprint(n,k)\ns=list(input())\ns[k-1]=s[k-1].lower()\nprint("".join(s))', 'n,k=tuple(map(int,input().split()))\nprint(n,k)\ns=list(input())\ns[k-1]=s[k-1].lower()\nprint("".join(s))', 'n,k=tuple(int,input().split())\ns=list(input())\ns[k-1]=s[k-1].lower()\nprint("".join(s))\n', 'n,k... | ['Wrong Answer', 'Wrong Answer', 'Runtime Error', 'Accepted'] | ['s258394608', 's269552289', 's609383154', 's676499287'] | [9100.0, 9160.0, 8808.0, 9048.0] | [25.0, 29.0, 23.0, 26.0] | [102, 102, 87, 91] |
p03041 | u716611746 | 2,000 | 1,048,576 | 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. | ['import sys\n\n\ndef main():\n\n N, K = [int(x) for x in sys.stdin.readline().rstrip().split()]\n S = list(sys.stdin.readline().rstrip())\n\n S_new = []\n for i, s in enumerate(S):\n if i + 1 == K:\n s = s.lower()\n S_new.append(s)\n\n print(S_new)\n\n\nif __name__ == "__main__"... | ['Wrong Answer', 'Accepted'] | ['s858323890', 's542876813'] | [2940.0, 2940.0] | [17.0, 17.0] | [313, 323] |
p03041 | u718706790 | 2,000 | 1,048,576 | 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. | ["n, k = map(int, input().split())\n\ns = list(input())\n\nif n == 1:\n print(s.lower())\n break\nelse:\n l = []\n for x in s:\n if x == s[k - 1]:\n l.append(x.lower())\n else:\n l.append(x)\n a = ''.join(l)\n print(a)", "n, k = map(int, input().split())\n\ns = list... | ['Runtime Error', 'Accepted'] | ['s819919073', 's426195685'] | [3060.0, 2940.0] | [17.0, 18.0] | [255, 104] |
p03041 | u724844363 | 2,000 | 1,048,576 | 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. | ['N, K = map(int, input().split())\nS = str(input())\nS.replace(S[K-1], S[K-1].lower())\nprint(S)', 'N, K = map(int, input().split())\nS = str(input())\nans = ""\nfor i in range(N):\n if i == K-1:\n ans += S[i].lower()\n else:\n ans += S[i]\n\nprint(ans)'] | ['Wrong Answer', 'Accepted'] | ['s636403028', 's919825183'] | [2940.0, 2940.0] | [17.0, 17.0] | [92, 164] |
p03041 | u728274111 | 2,000 | 1,048,576 | 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. | ['N, K = (int(x) for x in input().split())\nS = input()\n\nS[K-1].lower()\nprint(S)', 'N, K = (int(x) for x in input().split())\nS = input()\n\nS = S[:K-1] +S[K-1].lower() +S[K:]\nprint(S)\n'] | ['Wrong Answer', 'Accepted'] | ['s302656992', 's735280423'] | [9084.0, 9004.0] | [24.0, 23.0] | [77, 98] |
p03041 | u730318873 | 2,000 | 1,048,576 | 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. | ["N,K = map(int,input().split())\nS = list(input())\nprint(S)\nif S[K-1] == 'A':\n S[K-1] = 'a'\nelif S[K-1] == 'B':\n S[K-1] = 'b'\nelse:\n S[K-1] = 'c'\nprint(''.join(S))", "N,K = map(int,input().split())\nS = list(input())\nprint(S)\nif S[K-1] == 'A':\n S[K-1] = 'a'\nelif S[K-1] == 'B':\n S[K-1] = 'b'\nelse:\n ... | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s827398896', 's985284447', 's842284002'] | [3060.0, 3068.0, 3060.0] | [17.0, 17.0, 17.0] | [164, 164, 156] |
p03041 | u731627862 | 2,000 | 1,048,576 | 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. | ["N = int(input())\nK = int(input())\nS = str(input())\n\ns_up = list(S)\ns_low = s_up[K-1].lower()\ns_up [K-1] = s_low\n\nfor n in range(N):\n print(s_up[n], end='')\n\nprint()\n", "l = input().split()\nN = int(l[0])\nK = int(l[1])\nS = str(input())\n\ns_up = list(S)\ns_up [K-1] = s_up[K-1].lower()\n\nfor n in rang... | ['Runtime Error', 'Accepted'] | ['s310872906', 's839688397'] | [3060.0, 3060.0] | [17.0, 18.0] | [168, 167] |
p03041 | u732651691 | 2,000 | 1,048,576 | 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. | ["def checkMM(i):\n if i >= 1 and i <= 12:\n result = 1\n else:\n result = 0\n return result\n\ndef checkYY(i):\n if i >= 0 and i <= 99:\n result = 1\n else:\n result = 0\n return result\n\n\ns = input()\n\ns1 = int(s[:2])\ns2 = int(s[2:])\n\nresult = 'NA'\n\nif checkMM(s1)... | ['Wrong Answer', 'Accepted'] | ['s102813374', 's658459839'] | [3064.0, 2940.0] | [18.0, 17.0] | [470, 92] |
p03041 | u732963817 | 2,000 | 1,048,576 | 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. | ['(n, k) = map(int, input().split())\ns = list(input())\ns[k] = s[k].lower()\nprint("".join(s))', 'N, K = map(int, input().split())\nS = list(input())\n\nS[K-1] = S[K-1].lower()\nprint("".join(S))'] | ['Runtime Error', 'Accepted'] | ['s793737189', 's276683085'] | [2940.0, 2940.0] | [17.0, 17.0] | [90, 93] |
p03041 | u739843002 | 2,000 | 1,048,576 | 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. | ['small = [\'a\', \'b\', \'c\']\ncapital = [\'A\', \'B\', \'C\']\n\ntmp = input().split(" ")\nN = int(tmp[0])\nK = int(tmp[1])\nstr = input()\n\nstr[K] = small[capital.index(str[K])]\n\nprint(str)', 'small = [\'a\', \'b\', \'c\']\ncapital = [\'A\', \'B\', \'C\']\n \ntmp = input().split(" ")\nN = int(tmp[0])\nK = int(tm... | ['Runtime Error', 'Accepted'] | ['s939359892', 's516302840'] | [9108.0, 9172.0] | [22.0, 29.0] | [172, 198] |
p03041 | u739959951 | 2,000 | 1,048,576 | 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. | ["n,k=map(int,input().split())\nl=[i for i in str(input())]\n\nl[k]=l[k].lower()\n\nprint(''.join(l))", "n,k=map(int,input().split())\nl=[i for i in str(input())]\n\nl[k-1]=l[k-1].lower()\n\nprint(''.join(l))"] | ['Runtime Error', 'Accepted'] | ['s968100758', 's776968660'] | [3064.0, 2940.0] | [17.0, 17.0] | [94, 98] |
p03041 | u740047492 | 2,000 | 1,048,576 | 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. | ['n,k=map(int,input().split())\ns=list(input())\ns[k-1]=s[k-1].lower()\nprint(s)', 'n,k=map(int,input().split())\ns=input()\nprint(s[k-1].lower())', 'n,k=map(int,input().split())\ns=input()\nprint(s[k].lower())', 'n,k=map(int,input().split())\ns=input()\ns[k-1]=s[k-1].lower()\nprint(s)', 'n,k=map(int,input().split())\n... | ['Wrong Answer', 'Wrong Answer', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s495519172', 's620755660', 's778472256', 's873115785', 's345972323'] | [2940.0, 2940.0, 2940.0, 2940.0, 2940.0] | [17.0, 17.0, 18.0, 17.0, 17.0] | [75, 60, 58, 69, 74] |
p03041 | u741495664 | 2,000 | 1,048,576 | 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. | ["N,K = [int(x) for x in input().split()]\nS = list(input())\n\n\nS[K-1] = S[K-1].lower()\n\n\nanswer = ''.join(replace)\n\nprint(answer)", "N,K = [int(x) for x in input().split()]\nS = list(input())\n\n\nS[K-1] = S[K-1].lower()\n\n\nanswer = ''.join(S)\n\nprint(answer)\n"] | ['Runtime Error', 'Accepted'] | ['s575332823', 's059462380'] | [2940.0, 2940.0] | [17.0, 17.0] | [204, 199] |
p03041 | u745554846 | 2,000 | 1,048,576 | 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. | ["a,b=[int(i) for i in input().split()]\nc=list(input())\n\nc[b] = str.lower(c[b])\n\nc = ''.join(c)\n\nprint(c)", "a,b=[int(i) for i in input().split()]\nc=list(input())\n\nc[b-1] = str.lower(c[b-1])\n\nc = ''.join(c)\n\nprint(c)"] | ['Runtime Error', 'Accepted'] | ['s462154262', 's754934126'] | [2940.0, 2940.0] | [17.0, 17.0] | [103, 107] |
p03041 | u746793065 | 2,000 | 1,048,576 | 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. | ['n, k = map(int, input().split())\ns = list(input().split())\n\nprint(join(s[k-1].swapcase()))', 'n, k = map(int, input().split())\ns = list(input().split())\n\nprint(s[k-1].swapcase)', 's = list(input())\ns = [int(i+j) for (i,j) in zip(s[::2],s[1::2])]\n\nzero = int(\'{0:02d}\'.format(0))\n\nif zero <= s[0] <= 12:\n ... | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s234335764', 's472166853', 's476430067', 's327323613'] | [9028.0, 9104.0, 9132.0, 9100.0] | [20.0, 25.0, 27.0, 24.0] | [90, 82, 268, 96] |
p03041 | u747427153 | 2,000 | 1,048,576 | 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. | ['n,k = map(int, input().split())\ns = list(input())\nif s[k-1] == A:\n s[k-1] = a\nelif s[k-1] == B:\n s[k-1] = b\nelse:\n s[k-1] = c\nprint("".join(s))\n', 'n, k = map(int, input().split())\ns = list(input())\nif s[k-1] == "A":\n s[k-1] = "a"\nelif s[k-1] == "B":\n s[k-1] = "b"\nelse:\n s[k-1] = "c"\nprint("".j... | ['Runtime Error', 'Accepted'] | ['s616076409', 's061574871'] | [2940.0, 3060.0] | [17.0, 17.0] | [147, 157] |
p03041 | u747873993 | 2,000 | 1,048,576 | 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. | ['N.K=(int(i) for i in input().split())\nS=input()\nprint(S[:K]+lower(S[K+1])+S[K+1:])', 'N,K=(int(i) for i in input().split())\nS=input()\nprint(S[:K]+S[K+1].lower()+S[K+1:])', 'N,K=(int(i) for i in input().split())\nS=input()\nprint(S[:K-1]+S[K-1].lower()+S[K:])'] | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s203534026', 's852003960', 's788971204'] | [2940.0, 2940.0, 2940.0] | [17.0, 18.0, 17.0] | [82, 83, 83] |
p03041 | u748311048 | 2,000 | 1,048,576 | 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. | ["N,K=map(int, input().split())\nS=str(input())\nA=''\n\nfor i in range(N):\n if i==K:\n A=A+S[K].lower()\n else:\n A=A+S[i]\n\nprint(A)", "N,K=map(int, input().split())\nS=str(input())\nA=''\n\nfor i in range(N):\n if i==K-1:\n A=A+S[i].lower()\n else:\n A=A+S[i]\n\nprint(A)"] | ['Wrong Answer', 'Accepted'] | ['s800411899', 's177895751'] | [2940.0, 2940.0] | [17.0, 17.0] | [132, 134] |
p03041 | u749601238 | 2,000 | 1,048,576 | 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. | ["import sys\n\ns = input()\n\nformer = int(s[:2])\nlatter = int(s[2:])\n\n##YYMM\nif ((former > 12) and (latter <= 12 and latter > 0)):\n print('YYMM')\n sys.exit()\n\n##MMYY\nif ((former <= 12 and former > 0) and (latter > 12)):\n print('MMYY')\n sys.exit()\n\n##AMBIGUOUS\nif ((former <= 12) and (latter <... | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s443198176', 's837140527', 's888622104'] | [3064.0, 3064.0, 2940.0] | [17.0, 17.0, 17.0] | [363, 393, 126] |
p03041 | u750257808 | 2,000 | 1,048,576 | 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. | ['N, K = map(int, input().split())\nS = input()\n\nS_new = S.replace(S[K-1], S[K-1].lower())\n', "N, K = map(int, input().split())\nS = input()\nS_new = []\nfor i in range(N):\n if i == K-1:\n S_new.append(S[i].lower())\n else:\n S_new.append(S[i])\n\nSA = ''.join(S_new)\nprint(SA)"] | ['Wrong Answer', 'Accepted'] | ['s157042127', 's163762039'] | [2940.0, 3060.0] | [17.0, 17.0] | [88, 182] |
p03041 | u752898745 | 2,000 | 1,048,576 | 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. | ['n,k=map(int,input().split());s=input();print(s[k-1].lower())', 'n,k=map(int,input().split());s=input();print(s[:k-1]+s[k-1].lower()+s[k:])'] | ['Wrong Answer', 'Accepted'] | ['s871954842', 's744019827'] | [2940.0, 2940.0] | [17.0, 18.0] | [60, 74] |
p03041 | u753079666 | 2,000 | 1,048,576 | 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. | ["import sys\n\ndef countTotalBits(num):\n\n # convert number into it's binary and\n \n binary = bin(num)[2:]\n return(len(binary))\n\nlines = sys.stdin.readlines()\nsides = int((lines[0].rstrip()).split()[0])\nK = int((lines[0].rstrip()).split()[1])\nbase_win = 0\nlucky_win = 0\nif K == 1:\n print(1... | ['Wrong Answer', 'Accepted'] | ['s475127086', 's979825775'] | [3064.0, 3060.0] | [17.0, 17.0] | [1124, 225] |
p03041 | u754022296 | 2,000 | 1,048,576 | 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. | ['n, k =map(int,input().split())\ns = input()\nx = s[k-1]\nif x == "A":\n s[k-1] = "a"\nelif x == "B":\n s[k-1] = "b"\nelse:\n s[k-1] = "c"\nprint(s)', 'n, k =map(int,input().split())\ns = input()\nx = s[k-1]\nif x == "A":\n t = s[:k-1] + "a" + s[k:]\nelif x == "B":\n t = s[:k-1] + "b" + s[k:]\nelse:\n t = s[:k-1... | ['Runtime Error', 'Accepted'] | ['s494375235', 's968413792'] | [2940.0, 3060.0] | [17.0, 17.0] | [141, 180] |
p03041 | u754511616 | 2,000 | 1,048,576 | 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. | ['a,b=list(map(int,input().split()))\nc=input().split()\nd=c[b].swapecase()\nc[b]=d\nprint(c)\n', "a,b=list(map(int,input().split()))\nc=list(input())\nd=c[b-1].swapcase()\nc[b]=d\nc=''.join(c)\nprint(c)", "a,b=list(map(int,input().split()))\nc=list(input())\nd=c[b-1].swapcase()\nc[b-1]=d\nc=''.join(c)\nprint(c)"] | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s701736639', 's729241713', 's574165839'] | [9068.0, 8996.0, 9068.0] | [27.0, 23.0, 28.0] | [88, 99, 101] |
p03041 | u756518877 | 2,000 | 1,048,576 | 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. | ['# -*- coding: utf-8 -*-\nn,k=map(int,input().split(" "))\ns=input()\ns[k-1].lower()\nprint(s)', '# -*- coding: utf-8 -*-\nn,k=map(int,input().split(" "))\ns=input()\ns=s[:k-1]+s[k-1].lower()+s[k]\nprint(s)', '# -*- coding: utf-8 -*-\nn,k=map(int,input().split(" "))\ns=input()\ns=s[:k-1]+s[k-1].lower()+s[k:]\nprint(s)... | ['Wrong Answer', 'Runtime Error', 'Accepted'] | ['s850666108', 's947315409', 's970960466'] | [2940.0, 2940.0, 2940.0] | [17.0, 17.0, 17.0] | [89, 104, 105] |
p03041 | u756829954 | 2,000 | 1,048,576 | 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. | ['n, k = map(int, input().split())\nprint("A" * (k - 1) + "a" + "A" * (n - k))', 'n, k = map(int, input().split())\ns = input()\nprint(s[:k - 1] + str.lower(s[k - 1]) + s[k:])'] | ['Wrong Answer', 'Accepted'] | ['s633492993', 's153435390'] | [2940.0, 2940.0] | [19.0, 17.0] | [75, 91] |
p03041 | u759412327 | 2,000 | 1,048,576 | 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. | ['N,K = map(int,input().split())\nS = input()\nprint(S[:k-1]+S[k-1].lower()+S[k:])', 'N,K = map(int,input().split())\nS = input()\nprint(S[:K-1]+S[K-1].lower()+S[K:])'] | ['Runtime Error', 'Accepted'] | ['s887145932', 's864924461'] | [2940.0, 9156.0] | [17.0, 35.0] | [78, 78] |
p03041 | u759510609 | 2,000 | 1,048,576 | 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. | ['import math\nN,K = map(int,input().split())\n\n\nprint(sum([(1/N)*(0.5)**math.ceil(math.log2(math.ceil(K/i))) if i<K else 1/N for i in range(1,N+1)]))', 'N,K=map(int,input().split())\nS = list(input())\n\nS[K-1] = S[K-1].lower()\n\nprint("".join(S)', 'N,K=map(int,input().split())\nS = list(input())\n\nS[K-1] = S[K-1]... | ['Wrong Answer', 'Runtime Error', 'Accepted'] | ['s179454337', 's736277399', 's928631985'] | [3060.0, 2940.0, 2940.0] | [17.0, 17.0, 17.0] | [146, 89, 90] |
p03041 | u760831084 | 2,000 | 1,048,576 | 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. | ['N, K = map(int, input().split())\nS = list(input())\nans = S\nans[K-1] = ans[K-1].lower()\nprint(ans)', 'N, K = map(int, input().split())\nS = list(input())\nans = S\nans[K-1] = ans[K-1].lower()\nprint(ans)', 'N, K = map(int, input().split())\nS = list(input())\n\nans = S\nfor i in range(N):\n if i+1 == K:\n ... | ['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s173530896', 's405786048', 's651283697', 's502430607'] | [2940.0, 2940.0, 2940.0, 2940.0] | [17.0, 17.0, 17.0, 19.0] | [97, 97, 138, 106] |
p03041 | u762960952 | 2,000 | 1,048,576 | 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. | ['N,K = map(int,input().split(" "))\nS = input()\n\ntmp = S[K-1].lower()\nS[K-1] = tmp\nans = "".join(S)\n\nprint(ans)', 'N,K = map(int,input().split(" "))\nS = list(input())\n\ntmp = S[K-1].lower()\nS[K-1] = tmp\nans = "".join(S)\n\nprint(ans)'] | ['Runtime Error', 'Accepted'] | ['s654514275', 's605737265'] | [2940.0, 2940.0] | [17.0, 17.0] | [109, 115] |
p03041 | u763380276 | 2,000 | 1,048,576 | 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. | ["A=list(map(int,input().split()))\nS=input().split('')\n\nS(A(1)-1).lower()\nprint(''.join(S))\n", 'A=list(map(int,input().split()))\nS=input()\nS=S[0:(A[1]-1)]+S[A[1]-1].lower()+S[(A[1]+1):A[0]]\nprint(S)', 'A=list(map(int,input().split()))\nS=input()\nS=S[0:(A[1]-1)]+S[A[1]-1].lower()\nprint(S)', 'A=list(map(int,inp... | ['Runtime Error', 'Wrong Answer', 'Wrong Answer', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s375239124', 's687008142', 's692847597', 's774624378', 's994039181', 's764258471'] | [2940.0, 2940.0, 2940.0, 2940.0, 3060.0, 2940.0] | [17.0, 17.0, 18.0, 18.0, 17.0, 18.0] | [90, 102, 85, 71, 133, 98] |
p03041 | u764399371 | 2,000 | 1,048,576 | 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. | ['N, K = map(int, input().split())\nS = input()\n\nS[K] = S[K].lower()\n\nprint(S)', "N, K = map(int, input().split())\nS = list(input())\n\nS[K] = S[K].lower()\n\nprint(''.join(S))", "N, K = map(int, input().split())\nS = list(input())\n\nS[K - 1] = S[K - 1].lower()\n\nprint(''.join(S))\n"] | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s540580553', 's815374078', 's448695023'] | [9096.0, 9144.0, 9092.0] | [27.0, 23.0, 26.0] | [75, 90, 99] |
p03041 | u764956288 | 2,000 | 1,048,576 | 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. | ['N, K = map(int, input().split())\n\nS = input()\n\nK += 1\nreplaced_S = S[:K] + S[K].lower() + S[K+1:]\n\nprint(replaced_S)', 'N, K = map(int, input().split())\n\nS = input()\n\nK -= 1\nreplaced_S = S[:K] + S[K].lower() + S[K+1:]\n\nprint(replaced_S)'] | ['Runtime Error', 'Accepted'] | ['s272308854', 's619824955'] | [2940.0, 2940.0] | [17.0, 17.0] | [116, 116] |
p03041 | u765815947 | 2,000 | 1,048,576 | 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. | ['n, k = map(int, input().split())\ns = input()\nprint(s[:k]+s.[k]lower()+s[k+1:])\n', 'n, k = map(int, input().split())\ns = input()\nprint(s[:k]+s[k].lower()+s[k+1:])\n', 'n, k = map(int, input().split())\ns = input()\nprint(s[:k]+lower(s[k])+s[k+1:])\n', 'n, k = map(int, input().split())\ns =input()\nprint(s[:k-1] +... | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Wrong Answer', 'Runtime Error', 'Accepted'] | ['s001850541', 's123247864', 's340252901', 's351034645', 's400116834', 's092172547'] | [2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0] | [17.0, 17.0, 17.0, 17.0, 17.0, 17.0] | [79, 79, 78, 74, 36, 82] |
p03041 | u766566560 | 2,000 | 1,048,576 | 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. | ["N, K = map(int, input().split())\nS = list(input())\n\nfor i in range(N):\n if i == K:\n S[i] = S[i].lower()\n\nprint(''.join(S))", "N, K = map(int, input().split())\nS = list(input())\n\nfor i in range(N):\n if i == K - 1:\n S[i] = S[i].lower()\n\nprint(''.join(S))"] | ['Wrong Answer', 'Accepted'] | ['s970315641', 's939099372'] | [2940.0, 2940.0] | [17.0, 17.0] | [126, 130] |
p03041 | u766877416 | 2,000 | 1,048,576 | 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. | ['import sys\nimport numpy as np\nimport math\ndef main():\n input = sys.stdin.readline\n N, K =map(int,input().split())\n p = []\n for d in range(1,N+1):\n if d >= K:\n p.append(1/N)\n else:\n n = math.floor(np.log2(K/d)) + 1\n p.append( 1/N * 1/2 ** n)\n print(sum(p))\nmain()\t', 'import sys... | ['Wrong Answer', 'Accepted'] | ['s047977945', 's463790580'] | [21408.0, 21520.0] | [310.0, 281.0] | [289, 286] |
p03041 | u768256617 | 2,000 | 1,048,576 | 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. | ['n,k=map(int,input().split())\ns=input()\ns[k-1]=s[k-1].lower()\n\nprint(s)', 'n,k=map(int,input().split())\ns=input()\nprint(s[:k-1]+str.lower(s[k-1])+s[k:])\n'] | ['Runtime Error', 'Accepted'] | ['s054697533', 's542327760'] | [2940.0, 2940.0] | [17.0, 17.0] | [70, 78] |
p03041 | u769411997 | 2,000 | 1,048,576 | 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. | ['n, k = map(int, input().split())\ns = input()\ntmp = ord(s[k])\ntmp1 = (chr(tmp+32))\nans = []\n\nfor i in range(len(s)):\n if i == k:\n ans.append(tmp1)\n else:\n ans.append(s[i])\n\nprint("".join(map(str, ans)))', 'n, k = map(int, input().split())\ns = input()\ntmp = ord(s[k-1])\ntmp1 = (chr(tmp... | ['Runtime Error', 'Accepted'] | ['s247092483', 's427721637'] | [3060.0, 3060.0] | [17.0, 18.0] | [221, 225] |
p03041 | u769630892 | 2,000 | 1,048,576 | 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. | ['import numpy as np\nimport fractions\n \nS = input()\nF = int(S[0:2])\nE = int(S[2:4])\nif(F==0 or E==0 or (F>13 and E>13)):\n print("NA")\nelif(F<13 and E<13):\n print("AMBIGUOUS")\nelif(F<13 and E>13):\n print("MMYY")\nelif(F>13 and E<13):\n print("YYMM")', 'import numpy as np\nimport fractions\n\nN,K =... | ['Wrong Answer', 'Accepted'] | ['s037718279', 's861732516'] | [13644.0, 21536.0] | [160.0, 288.0] | [256, 131] |
p03041 | u772588522 | 2,000 | 1,048,576 | 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. | ['s = list(input())\n\nt = input()\n\nprint(t[int(s[1])-1].lower() + t[int(s[1]):])', 's = input().split()\nt = input()\nk = int(s[1]) - 1\n\nprint(t[:k] + t[k].lower() + t[k+1:])'] | ['Runtime Error', 'Accepted'] | ['s196078112', 's089032493'] | [2940.0, 2940.0] | [17.0, 17.0] | [77, 88] |
p03041 | u773920480 | 2,000 | 1,048,576 | 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. | [',K = (int(x) for x in input().split())\nS = input()\nif N <= 50:\n komoji = S[K-1:K].lower()\n\n Out = S[:K-1] + komoji + S[K:]\n\n print(Out)', "N,K = int(input('N = ')), int(input('K = '))\nS = input('S = ')\n\nkomoji = S[K-1:K].lower()\n\nOut = S[:K-1] + komoji + S[K:N+1]\n\nprint(Out)", 'N,K = int(input(... | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s168344584', 's234497041', 's625985655', 's798362420', 's829494827'] | [2940.0, 3060.0, 2940.0, 2940.0, 2940.0] | [17.0, 18.0, 17.0, 17.0, 17.0] | [144, 136, 118, 138, 183] |
p03041 | u777394984 | 2,000 | 1,048,576 | 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. | ['a,b = map(int,input().split())\ntxt = input()\ntxt[b] = txt[b].lower()\nprint(txt)\n', 'a,b = map(int,input().split())\ntxt = input()\ntxt[b] = txt[b].lower\nprint(txt)', 'a,b = map(int,input().split())\ntxt = list(input())\ntxt[b - 1] = txt[b - 1].lower()\nprint("".join(txt))'] | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s438400725', 's573187892', 's481323855'] | [2940.0, 2940.0, 2940.0] | [17.0, 17.0, 17.0] | [80, 77, 102] |
p03041 | u778700306 | 2,000 | 1,048,576 | 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. | ['\nn,k=map(int,input().split())\ns=input()\ns = s[:k-1]+str(s[k]).lower()+s[k+1:]\nprint(s)', '\nn,k=map(int,input().split())\ns=input()\nk=k-1\ns = s[:k]+str(s[k]).lower()+s[k+1:]\nprint(s)'] | ['Runtime Error', 'Accepted'] | ['s455078044', 's948524634'] | [2940.0, 3444.0] | [17.0, 21.0] | [86, 90] |
p03041 | u778878014 | 2,000 | 1,048,576 | 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. | ["N, K = map(int, input().split())\nS = list(map(str, input()))\n\nif S[K] == 'A':\n S[K] = 'a'\nelif S[K] == 'B':\n S[K] = 'b'\nelse:\n S[K] = 'c'\n \nT = ''.join(S)\n\nprint(T)", "N, K = map(int, input().split())\nS = list(map(str, input()))\n\nif S[K] == 'A':\n S[K] = 'a'\nelif S[K] == 'B':\n S[K] ... | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s152471712', 's702170770', 's040370690'] | [3060.0, 2940.0, 2940.0] | [17.0, 17.0, 17.0] | [176, 156, 186] |
p03041 | u779455925 | 2,000 | 1,048,576 | 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. | ['N,K=map(int,input().split())\nS=input()\nfor i,m in enumerate(S):\n if m=="A":\n S[i]="A"\n if m=="B":\n S[i]="B"\n if m=="C"\n S[i]="C"\nprint(S)\n', 'S=input()\nif S[0:2]=="00" and int(S[2:4])>=13\\\n or S[2:4]=="00" and int(S[0:2])>=13\\\n or int(S[0:2])>=13 and int(S[2:4])>=13\\\n or... | ['Runtime Error', 'Wrong Answer', 'Runtime Error', 'Wrong Answer', 'Accepted'] | ['s363574575', 's676750008', 's857885143', 's951363030', 's354342124'] | [2940.0, 3064.0, 2940.0, 3060.0, 2940.0] | [17.0, 17.0, 17.0, 17.0, 17.0] | [168, 286, 169, 229, 216] |
p03041 | u779703200 | 2,000 | 1,048,576 | 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. | ['s = input()\na = int(s[0:2])\nb = int(s[2:4])\n\nif 1 <= a <= 12 and 1 <= b <= 12:\n print("AMBIGUOUS")\nelif (a == 0 or 12 < a < 100) and (b == 0 or 12 < b < 100):\n print("NA")\nelif (a == 0 or 12 < a < 100) and 1 <= b <= 12:\n print("YYMM")\nelse:\n print("MMYY")\n', 'a=list(map(int, input().split()))\... | ['Wrong Answer', 'Accepted'] | ['s285596392', 's917589117'] | [3064.0, 3064.0] | [18.0, 17.0] | [268, 152] |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.