problem_id stringclasses 100
values | submission_id stringlengths 10 10 | status stringclasses 2
values | code stringlengths 6 806 |
|---|---|---|---|
p03282 | s746419250 | Wrong Answer | A = input()
B = input()
for i in range(len(A)):
if A[i] != "1":
print(A[i])
break |
p03282 | s752953918 | Wrong Answer | import sys
s, k = sys.stdin.read().split()
k = int(k)
def main():
for i in range(len(s)):
if s[i] != '1':
print(1 if k < i + 1 else s[i])
return
if __name__ == '__main__':
main() |
p03282 | s940918888 | Wrong Answer | import math
s=input()
k=int(input())
logk=math.log10(k)
ss=[]
for i in range(len(s)):
if s[i]!="1":
ss.append(int(s[i]))
n=5000*10000**3
if len(ss)==0:
print(1)
else:
logketa=n*math.log10(ss[0])
if logketa>logk:
print(ss[0])
else:
print(ss[1]) |
p03282 | s124412922 | Wrong Answer | # AL006 C
s = input()
k = int(input())
if s[0] == "1":
if k == 1:
print("1")
else:
print(s[1])
else:
print(s[0]) |
p03282 | s161740735 | Wrong Answer | s = input()
k = int(input())
for elem in s:
if int(elem) == 1:
if k == 1:
print(elem)
break
else:
pass
else:
print(elem)
break |
p03282 | s451862488 | Wrong Answer | S = input()
K = int(input())
not_1_idx = -1
not_1_num = -1
for i, c in enumerate(S):
if c != "1":
not_1_idx = i
not_1_num = c
break
if not_1_idx >= 0:
print(1) if K <= not_1_idx + 1 else print(not_1_num)
else:
print(not_1_num)
|
p03282 | s809279750 | Wrong Answer | import sys
import itertools
import numpy as np
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
N = readline().decode().strip()
K = int(readline())
cnt = 0
ans = 0
for i in N:
if i == '1':
cnt += 1
continue
else:
if int(i) * 5000 * 10 ** 12 + cnt >= K:
ans = i
break
else:
ans = N[N.find(i) + 1]
break
print(ans)
|
p03282 | s000734234 | Wrong Answer | s = input()
k = int(input())
for i in range(k):
if s[i] != '1':
print(s[i])
break
print(1) |
p03282 | s284690229 | Wrong Answer | s = input()
k = int(input())
n = 5000 * 10**12
for c in s:
if c != '1':
print(c)
break
|
p03282 | s939498409 | Wrong Answer | S = input()
K = int(input())
for i in range(len(S)):
if(S[i] != '1' and S[i] != '0'):
print(int(S[i]))
exit()
|
p03282 | s228032848 | Wrong Answer | s = list(input())
s = [int(l) for l in s]
k = int(input())
if s[0] > 1:
print(s[0])
elif sum(s[0:k]) == k:
print(1)
else:
i = 0
while s[i] == 1:
i += 1
if s[i] != 1:
print(s[i])
break |
p03282 | s779673711 | Wrong Answer | s = list(str(input()))
k = int(input())
s = [int(i) for i in s]
for i in s:
if i == 1:
continue
else:
print(i)
exit(0) |
p03282 | s469949859 | Wrong Answer | S = input()
K = int(input())
index = 0
for i in range(K):
if (S[i] != '1'):
print(S[i])
break
if (index == 0):
print(1)
else:
print(int(S[index]))
|
p03282 | s306682052 | Wrong Answer | def resolve():
S = input()
for i in range(len(S)):
if S[i] == "1":
continue
else:
print(S[i])
exit()
print("1")
resolve() |
p03282 | s258465925 | Wrong Answer | c = 5*pow(10, 14)
list_N = list(input())
k = int(input())
cnt = 0
ans = 0
for i in list_N:
i = int(i)
if i != 1:
ans = i
break
print(ans) |
p03282 | s118525993 | Wrong Answer | import sys
S = input()
K = int(input())
if len(S) == 1:
print(S)
sys.exit(0)
if K == 1:
print(S[0])
i = 0
while i<len(S):
if S[i] == '1':
i += 1
else:
break
if i < len(S):
keep = S[i]
else:
keep = S[i-1]
if K <= i:
print(1)
sys.exit(0)
else:
if S[0] != '1':
print(S[0])
else:
print(keep) |
p03282 | s172016471 | Wrong Answer | S = str(input())
K = int(input())
ans = 1
index = 0
for j in range(len(S)):
if S[j] != '1':
ans = int(S[j])
index = j
break
if ans == 1:
print(ans)
elif index >= K-1:
print(1)
else:
print(ans)
|
p03282 | s766771651 | Wrong Answer | s = input()
k = int(input())
# sが1文字目から最後の文字 or k番目の文字までが1なら1
for i in range(len(s)):
if s[i] != '1':
print (s[i])
exit ()
if k < i:
print (1)
exit ()
else:
print (1)
exit ()
|
p03282 | s693002868 | Wrong Answer | S = [int(i) for i in input()]
K = int(input())
ans = 1
for i in S:
if i!=1:
ans=i
break
print(i) |
p03282 | s859917382 | Wrong Answer | S = input()
K = int(input())
s = int(S[0])
if K == 1:
print(s)
else:
if s == 1:
print(int(S[1]))
else:
print(s) |
p03282 | s678971325 | Wrong Answer | import sys
import math
s=input()
k = int(input())
cnt = False
ans=0
for i in range(0,k):
if s[i] != '1':
ans = s[i]
cnt = True
break
cnt+=1
if (not cnt):
print(1)
else:
print(ans)
|
p03282 | s260196379 | Wrong Answer |
def solve():
for i in s:
if i == 1:
continue
else:
print(i)
exit()
if __name__=="__main__":
S = input()
K = int(input())
# d = 5*10**15
s = [int(c) for c in S]
# print(s)
solve()
|
p03282 | s386194149 | Wrong Answer | ns = list(map(int,input()))
n = int(input())
ans = 0
for i in range(len(ns)):
if (ns[i] == 1 and n == 1) or ns[i] != 1:
ans = ns[i]
break
else:
continue
print(ans) |
p03282 | s301318389 | Wrong Answer | n = list(input())
m = int(input())
n = [int(x) for x in n]
if all([x==1 for x in n]):
print("1")
exit()
for i in range(len(n)):
if n[i] != 1:
print(n[i])
break
|
p03282 | s525767185 | Wrong Answer | s = input()
k = int(input())
b = list(map(int,s))
for i in b:
if i!=1:
print(i)
break
else:print(1) |
p03282 | s843743745 | Wrong Answer | s = input()
k = int(input())
for i in s:
if i != "1":
ans = int(i)
break
else:
ans = 1
print(ans)
|
p03282 | s484448705 | Wrong Answer | import sys
s = input()
k = int(input())
for i in range(len(s)):
if s[i] != "1":
print(s[i])
sys.exit()
print("1") |
p03282 | s781219860 | Wrong Answer | s = input()
k = int(input())
for i in range(k):
if s[i] != '1':
print(s[i])
break
else:
print(1) |
p03282 | s840553780 | Wrong Answer | s = input()
k = int(input())
cnt = 0
for i in s:
if i == "1":
cnt += 1
else:
break
if cnt == 0:
print(s[0])
elif k <= cnt:
print("1")
else:
print(s[1]) |
p03282 | s122592289 | Wrong Answer | s = input()
k = int(input())
for v in range(k):
if (s[v] == "2" or s[v] == "3" or s[v] == "4"):
print(s[v])
break
if v+1 == k:
print(1)
break |
p03282 | s102721041 | Wrong Answer | S = list(input())
K = int(input())
for s in S:
if s != '1':
ans = s
break
else:
ans = 1
continue
print(ans) |
p03282 | s252385054 | Wrong Answer |
s = input()
k = int(input())
for si in s:
k -= int(si)*10**12*5000 if int(si) != 1 else 1
if k <= 0:
print(si)
break
|
p03282 | s160888447 | Wrong Answer | S = input()
ans = 0
for i in S:
if i == "1":
continue
else:
ans = i
break
print(ans) |
p03282 | s706964461 | Wrong Answer | S=input()
K=int(input())
one = True
for i in range(len(S)):
one = one and S[i]=='1'
if not one: break
print(S[i]) |
p03282 | s627134636 | Wrong Answer | # Problem C - To Infinity
# input
S = list(input())
s_len = len(S)
K = int(input())
# initialization
pos = 0
while K>0:
K -= 1
if int(S[pos])==1:
pos += 1
else:
break
if pos==s_len:
pos -= 1
break
# output
print(S[pos])
|
p03282 | s701585414 | Wrong Answer | S = input()
K = int(input())
if S[0] == "1":
if K == 1:
print(1)
else:
S.replace("1", "")
print(S[0])
else:
print(S[0])
|
p03282 | s678135105 | Wrong Answer | A = str(input())
B = input()
count = 0
for i in range(len(A)):
if A[i] == 1:
count += 1
else:
if count == B:
print(1)
else:
print(A[i]) |
p03282 | s317216170 | Wrong Answer | A = str(input())
B = input()
count = 0
for i in range(len(A)):
if A[i] == 1:
count += 1
else:
if count == B:
print(1)
break
else:
print(A[i])
break |
p03282 | s061700908 | Wrong Answer |
s = input()
k = int(input())
for si in s:
if si != '1':
print(si)
break
|
p03282 | s617131325 | Wrong Answer | # Problem C - To Infinity
# input
S = list(input())
s_len = len(S)
K = int(input())
# initialization
pos = 0
while K>0:
K -= 1
if int(S[pos])==1:
pos += 1
else:
break
if pos==s_len:
pos -= 1
break
# output
if K==0:
print(S[pos-1])
else:
print(S[pos])
|
p03282 | s087537253 | Wrong Answer | s=input()
k=int(input())
cnt = 0
for i in s:
if i =='1':
cnt +=1
if cnt >=k:
print(1)
exit()
for i in s:
if i !='1':
print(i)
exit() |
p03282 | s483143466 | Wrong Answer | s = input()
k = int(input())
if len(s) == 1 or k == 1: print(s[0])
else:
if s[0] == "1": print(s[1])
else: print(s[0]) |
p03282 | s947369318 | Wrong Answer | S = list(input())
K = int(input())
for j, i in enumerate(S, start=1):
if i != '1':
if K <= j:
print(1)
exit()
print(i)
exit()
else:
print(1)
|
p03282 | s254138527 | Wrong Answer | S = input()
K = int(input())-1
if S[0] == '1' and K == 0:
print('1')
elif S[0] == '1':
print(S[1])
else:
print(S[0]) |
p03282 | s373424869 | Wrong Answer | S = input()
K = int(input())
if len(S) == 1:
print(S)
else:
for x in S:
if x != "1":
print(x)
exit()
|
p03282 | s946726397 | Wrong Answer | import bisect,collections,copy,itertools,math,string
import sys
def I(): return int(sys.stdin.readline().rstrip())
def LI(): return list(map(int,sys.stdin.readline().rstrip().split()))
def S(): return sys.stdin.readline().rstrip()
def LS(): return list(sys.stdin.readline().rstrip().split())
def main():
s = S()
k = max(len(s),I())
ans = 1
for i in range(k-1):
if s[i] != "1":
ans = s[i]
break
print(ans)
main()
|
p03282 | s528935119 | Wrong Answer | ns = list(map(int,input()))
n = int(input())
ans = 0
for i in range(len(ns)):
if ns[i] == 1:
continue
else:
ans = ns[i]
break
print(ans) |
p03282 | s592354122 | Wrong Answer | a=input()
b=int(input())
c=0
if a[0]!="1":
print(a[0])
if a[0]=="1":
for i in range(len(a)-1):
if a[i]=="1" and a[i+1]=="1":
c=c+1
else:
break
if c>b:
print(1)
else:
print(a[c])
|
p03282 | s945426676 | Wrong Answer | import sys
S = input()
K = int(input())
for i in range(len(S)):
if S[i] != "1":
print(S[i])
sys.exit()
print(1) |
p03282 | s341862643 | Wrong Answer | import sys
input = sys.stdin.readline
S = list(input().rstrip('\n'))
K = int(input())
n = 0
for i in range(len(S)):
if S[i] != '1':
if i+1 > K:
n = 1
else:
n = int(S[i])
break
print(n)
|
p03282 | s245829559 | Wrong Answer | # -*- coding: utf-8 -*-
s = input()
k = int(input())
for i in range(k):
if s[i] != '1':
print(s[i])
break
|
p03282 | s429261499 | Wrong Answer | # https://atcoder.jp/contests/abc106/tasks/abc106_c
s = input()[:-1]
k = int(input())
repr(s)
for i in range(len(s)):
if s[i] != '1':
print(s[i])
break
else:
print('1') |
p03282 | s701020160 | Wrong Answer | n = list(input())
k = int(input())
if n.count('1') == len(n):
print(1)
else:
for i in n:
if i != '1':
print(i)
exit() |
p03282 | s153218052 | Wrong Answer | s = input()
k = int(input())
for i in s:
if i!= '1':
print(i)
break |
p03282 | s560774369 | Wrong Answer | s = input().strip()
k = int(input().strip())
days = 5 * (10 ** 15)
if len(s) == 1:
print(s)
exit()
before = 0
for i in range(0, len(s)):
diff = 0
if s[i] == "1":
diff = 1
else:
for j in range(1, (days + 1), 1):
if 10 ** 18 <= int(s[i]) ** j:
diff = int(s[i]) ** j
break
if (k - 1) <= (before + diff):
print(s[i])
break
else:
before = before + diff |
p03282 | s016564935 | Wrong Answer | S = input()
for s in S:
if s != '1':
print(s)
exit()
print('1') |
p03282 | s805106562 | Wrong Answer | import sys
s = input()
n = int(input())
if n == 1:
print(s[0])
sys.exit()
for i in s:
if i != '1':
print(i)
sys.exit() |
p03282 | s163180636 | Wrong Answer | S = input()
K = int(input())
ans = 1
for i in S:
print(i,K)
if i > '1':
ans = i
break
if K==1:
ans = i
break
K-=1
print(ans) |
p03282 | s664888951 | Wrong Answer | s=input()
k=int(input())
for v in s:
if v!='1':
print(v)
break |
p03282 | s906341777 | Wrong Answer | S = input().strip()
K = int(input())
ind = len(S)+1
for i in range(len(S)):
if S[i]!="1":
ind = i+1
break
if K<=ind+1:
print(1)
else:
print(S[ind-1]) |
p03282 | s195622065 | Wrong Answer | s = list(input())
k = int(input())
coun= 0
for i in range(k):
coun += 1
if s[i] != '1':
print(i)
exit()
if coun == 100:
print(1)
exit()
|
p03282 | s725679381 | Wrong Answer | s = input()
k = int(input())
if s[0]=='1':
if k==1:
print(s[0])
else:
print(s[1])
else:
print(s[0]) |
p03282 | s749940049 | Wrong Answer | s = input()
k = int(input())
if k == 1:
print(s[0])
elif s[0] != '1':
print(s[0])
else:
print(s[1]) |
p03282 | s839401575 | Wrong Answer | s = input()
for i in s:
if i != "1":
print(i)
exit() |
p03282 | s883602062 | Wrong Answer | S=str(input())
K=int(input())
L=[1]*len(S)
count=0
#うしたぷにきあ君笑
for i in range(len(S)):
if S[i]!='1':
print(int(S[i]))
exit()
|
p03282 | s136298047 | Wrong Answer | S = input()
K = int(input())
for i in range(len(S)):
if S[i] != '1': break
nth = i + 1
if K < nth:
print(1)
answer = S[i]
print(answer)
|
p03282 | s930817997 | Wrong Answer | s = str(input())
k = int(input())
if s[0] == '1':
if k == 1:
print(1)
else:
print(s[1])
else:
print(s[0]) |
p03282 | s163077526 | Wrong Answer | s = input()
k = int(input())
for i in s:
if i != "1":
print(i)
break
print(1)
|
p03282 | s342095081 | Wrong Answer | S = input()
K = int(input())
for i in S:
if i != "1":
print(i)
break
else: print("1") |
p03282 | s016466441 | Wrong Answer | s = input()
k = int(input())
if len(s) >= k and s == '1'*k:
print(1)
else:
for i in s:
if i != '1':
print(i)
exit() |
p03282 | s108722699 | Wrong Answer | s=input()
k=int(input())
cnt = 0
for i in s:
if i == '1':
cnt +=1
if cnt >=k:
print(1)
exit()
for i in s:
if i != '1':
print(i)
exit()
print(1) |
p03282 | s337836323 | Wrong Answer | s = input()
input()
found = s.find('1')
if found == -1:
print(s[0])
else:
for e in s[found+1:]:
if e != '1':
print(e)
break |
p03282 | s940175543 | Wrong Answer | s = str(input())
k = int(input())
num = 1
for i in s:
if i != '1':
num = i
break
print(num)
|
p03282 | s048139318 | Wrong Answer | S = input()
K = int(input())
if S[0] != 1 and len(S) != 1:
print(S[1])
elif S[0] != 1 and len(S) == 1:
print(S[0])
else:
print(1) |
p03282 | s611791630 | Wrong Answer | s = list(str(input()))
k = int(input())
s = [int(i) for i in s]
for i,a in enumerate(s):
if a == 1:
continue
elif i == k and i == 1:
print(1)
else:
print(a)
exit(0) |
p03282 | s430072786 | Wrong Answer | import sys
input = sys.stdin.readline
def main():
S = input().strip()
for s in S:
if s != "1":
print(s)
exit()
if __name__ == '__main__':
main()
|
p03282 | s893347976 | Wrong Answer | s = input()
k = int(input())
k -= 1
cnt = 0
for i in range(len(s)):
if s[i] == '1':
cnt += 1
else:
break
if cnt < k:
print(s[cnt])
else:
print(1) |
p03282 | s347843733 | Wrong Answer | s=input()
k=int(input())
for i in range(len(s)):
if s[i]!=1:
print(s[i])
break |
p03282 | s977229795 | Wrong Answer | s = input()
k = int(input())
for i, v in enumerate(s):
if i == k-1:
print(1)
exit()
elif v != 1:
print(v)
exit() |
p03282 | s320511792 | Wrong Answer | s = input()
k = int(input())
if k == 1:
print(s[0])
elif k >= 2 and s[0] == '1':
print(s[1])
else:
print(s[0]) |
p03282 | s713650161 | Wrong Answer | s=input()
k=int(input())
cnt=0
if s[0]!="1":
print(int(s[0]))
if s[0]=="1":
for i in s:
cnt+=1
if i!="1":
if cnt<=k:
print(int(i))
exit()
else:
print(1)
exit() |
p03282 | s939187209 | Wrong Answer | S=input()
K=int(input())
count=0
for i in range(len(S)):
if S[i]==1:
count+=1
else:
break
if count>=K:
print(1)
else:
print(S[count]) |
p03282 | s113270368 | Wrong Answer | s=input()
k=int(input())
if len(s) == 1:
print(s)
elif s[0] == "1":
print(s[1])
else:
print(s[0]) |
p03282 | s958181197 | Wrong Answer | s=input()
k=int(input())
sl=list(s)
for i in range(len(sl)):
if s[i]!='1':
print(s[i])
exit()
if k<len(sl):print(s[k]) |
p03282 | s170485721 | Wrong Answer | S = input()
K = int(input())
if S[0] == "1" and len(S) > 1:
print(S[1])
else:
print(S[0])
|
p03282 | s578189306 | Wrong Answer | s = list(input())
k = int(input())
if s[0] == "1":
print(1)
elif len(s) == 1:
print(s)
else:
print(s[0]) |
p03282 | s704570410 | Wrong Answer | import sys
s = list(input())
k = int(input())
if len(s) == 1:
print(s)
elif k == 1:
print(s[0])
else:
for i in range(k):
if s[i] != "1":
print(s[i])
sys.exit()
print(1) |
p03282 | s731951897 | Wrong Answer | s = input()
k = int(input())
for i, v in enumerate(s):
if i == k-1:
print(1)
exit()
elif v != "1":
print(v)
exit() |
p03282 | s491468384 | Wrong Answer | s = str(input())
S = [int(s[i]) for i in range(len(s))]
K = int(input())
ans = 1
count = 0
for i in range(len(S)):
if S[i] != 1 and count == 0:
ans = S[i]
count += 1
print(ans) |
p03282 | s849300291 | Wrong Answer |
url = "https://atcoder.jp//contests/abc106/tasks/abc106_c"
def main():
s = input()
k = int(input())
ans = 0
tyou = 500000000000000
for v in s:
if v == '1':
continue
ans += tyou ** int(v)
if ans >= k:
print(v)
exit()
if __name__ == '__main__':
main()
|
p03282 | s354734943 | Wrong Answer | numstr = input()
num = int(input())
def check():
infinity = ""
for i in range(len(numstr)):
if numstr[i] is not "1":
infinity = infinity + numstr[i]
return infinity
else:
infinity = infinity + "1"
return "1"
infinity = check()
print(infinity[len(infinity)-1])
|
p03282 | s043522437 | Wrong Answer | S = [i for i in input()]
K = int(input())
if S[0]!='1':
print(S[0])
else:
for i in range(len(S)):
if S[i]!='1':
print(S[i])
break |
p03282 | s602998104 | Wrong Answer | def resolve():
S = input()
s = [int(c) for c in S]
K = int(input())
if len(s) == 1:
print(s[0])
else:
if K == 1:
print(s[0])
else:
for i in range(len(s)):
if s[i] != 1:
print(s[i])
break
resolve() |
p03282 | s632190030 | Wrong Answer | S = input()
K = int(input())
for i in range(len(S)):
if S[i] != "1":
print(S[i])
break
else:
if i == K - 1:
print("1")
|
p03282 | s846087448 | Wrong Answer | s = input()
k = int(input())
if len(s) == 1:
print(s)
exit()
if s[0] == "1" and k == 1:
print(1)
elif s[0] == "1" and k != 1:
print(s[1])
elif s[0] != "1":
print(s[0]) |
p03282 | s755266750 | Wrong Answer | # row = [int(x) for x in input().rstrip().split(" ")]
# n = int(input().rstrip())
# s = input().rstrip()
def resolve():
import sys
input = sys.stdin.readline
s = input().rstrip()
k = int(input().rstrip())
i = 0
for c in s:
if c != "1":
break
if i == k:
break
i += 1
print(c)
if __name__ == "__main__":
resolve()
|
p03282 | s473668506 | Wrong Answer | s = input()
k = int(input())
if s[0] == '1' and k > 1:
print(s[1])
else:
print(s[0]) |
p03282 | s961182821 | Wrong Answer | S = str(input())
K = int(input())
gosencho = 5 * (10**15)
for i in range(len(S)):
if K <= 0:
print(S[i-1])
exit(0)
elif S[i] != '1':
K -= int(S[i]) * gosencho
else:
K -= 1
print(S[-1]) |
p03282 | s044118683 | Wrong Answer | S = input()
K = int(input())
if K == 1:
print(S[0])
elif S[0] == '1' and K != 1:
print(S[1])
else:
print(S[0])
|
p03282 | s383269437 | Wrong Answer | a = input()
b = int(input())
cnt = b
for i in a:
if cnt != 0:
if i == "1":
cnt -= 1
else:
print(i)
break
else:
print("1")
break
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.