problem_id stringclasses 100
values | submission_id stringlengths 10 10 | status stringclasses 2
values | code stringlengths 6 806 |
|---|---|---|---|
p03282 | s950298497 | Wrong Answer | a = input()
k = int(input())
b = list(a)
if k == 1:
print(b[0])
elif int(b[0]) == 1:
print(b[1])
else:
print(b[0]) |
p03282 | s852683152 | Wrong Answer | S = list(input())
K = int(input())
if len(S) == 1 or K == 1:
print(S[0])
elif S[0] == 1 and K >= 2:
print(S[1])
elif S[1] != 1 and K >= 2:
print(S[0]) |
p03282 | s330556731 | Wrong Answer | def main():
S = input()
K = int(input())
# 10**15
if S[0] == '1':
if K == 1:
print(S[0])
else:
print(S[1])
else:
print(S[0])
if __name__ == '__main__':
main() |
p03282 | s622803704 | Wrong Answer | S = input()
if len(S) == S.count("1"):
print(1)
else:
for c in S:
if c != "1":
print(c)
break |
p03282 | s206834231 | Wrong Answer | def resolve():
s = input()
k = int(input())
if len(s) == 1:
print(s)
return
for i in s:
if int(i) == 1:
continue
print(i)
return
print(s[0])
resolve() |
p03282 | s562993876 | Wrong Answer | s=input()
k=input()
if s[0]=='1':
if len(s)>1:
print(s[1])
else:
print(1)
else:
print(s[0]) |
p03282 | s451252023 | Wrong Answer | def resolve():
s = input()
k = int(input())
for i in s:
if int(i) == 1:
continue
print(i)
return
resolve() |
p03282 | s156235303 | Wrong Answer | S = list(input())
K = int(input())
if len(S) == 1 or K == 1:
print(S[0])
elif S[0] == 1:
print(S[1])
else:
print(S[0]) |
p03282 | s872565094 | Wrong Answer | S = input()
K = input()
ans = -1
for i, s in enumerate(S):
if i == K:
ans = s
break
if s == '1':
continue
else:
ans = s
break
print(ans) |
p03282 | s094041164 | Wrong Answer | a=input()
b=int(input())
c=1
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-1])
|
p03282 | s595096465 | Wrong Answer | s=str(input())
n=int(input())
if(n==1 and s[0]=='1'):
print(1)
elif(s[0]!='1'):
print(s[0])
else:
print(s[1])
|
p03282 | s426289187 | Wrong Answer | S = list(map(int, input()))
K = int(input())
if len(S) == 1:
print(S[0])
exit()
cnt = 0
for s in S:
if s == 1:
cnt += 1
if K <= cnt:
print(1)
else:
print(S[cnt])
|
p03282 | s144547532 | Wrong Answer | S = list(input())
K = int(input())
ans = 1
for i in range(len(S)):
if S[i] != 1 :
ans = S[i]
break
print(ans) |
p03282 | s819452678 | Wrong Answer | s=input()
k=int(input())
if k==1:
print(int(s[0]))
elif int(s[0])==1:
num=1
for i in range(len(s)):
if int(s[i])!=1:
num=int(s[i])
break
print(num)
elif int(s[0])!=1:
print(int(s[0])) |
p03282 | s937082081 | Wrong Answer | s=list(map(int,list(input())))
k=int(input())
if s[0]!=1:print(s[0])
elif len(s)>1 and k>1:print(s[1])
else:print(1) |
p03282 | s717706349 | Wrong Answer | def main():
s = input()
k = int(input())
for i in range(len(s)):
if s[i] != "1":
print(s[i])
break
else:
print(1)
if __name__ == "__main__":
main()
|
p03282 | s727027015 | Wrong Answer | S = input()
K = int(input())
ans = '1'
if K == 1:
ans = S[0]
else:
for i in S:
if i == ans:
continue
else:
ans = i
break
print(ans) |
p03282 | s802246536 | Wrong Answer | s=list(input())
k=int(input())
for i in range(len(s)):
if s[i] != "1":
print(s[i])
break
else:
print(1) |
p03282 | s460846046 | Wrong Answer | S = input()
K = int(input())
if len(S) == 1:
ans = int(S)
elif S[0] == '1' and K == 1:
ans = 1
elif S[0] != '1':
ans = int(S[0])
else:
ans = int(S[1])
print(ans) |
p03282 | s496875813 | Wrong Answer | s = list(input())
k = int(input())
for i in range(k):
if s[i] != 1:
l = [i for i in s if i != 1]
print(l[0])
break
else:
print(1)
|
p03282 | s139392680 | Wrong Answer | S = input()
K = int(input())
if sum(map(int, list(S[:K]))) == K:
print(1)
else:
for si in S:
if si != '1':
print(si)
break |
p03282 | s345773983 | Wrong Answer | s = input()
k = int(input())
ans = 1
for i in range(len(s)):
if s[i] != '1':
ans = int(s[i])
break
print(ans)
|
p03282 | s445392963 | Wrong Answer | s = list(input())
k = int(input())
for i in range(k):
if str(s[i]) != 1:
print(i)
exit()
print(1) |
p03282 | s564923210 | Wrong Answer | s = input()
k = int(input())
for i in s:
if i != "1":
print(i)
exit()
print(1) |
p03282 | s911739994 | Wrong Answer | s=input()
k=int(input())
for i in range(len(s)):
if s[i]!=1:
print(s[i])
exit()
print(1) |
p03282 | s805132284 | Wrong Answer | s = list(input())
s = [int(l) for l in s]
k = int(input())
s_set = set(s)
if s[0] > 1:
print(s[0])
elif sum(s_set) == 1:
print(1)
else:
i = 0
while s[i] == 1:
i += 1
if s[i] != 1:
print(s[i])
break |
p03282 | s985795236 | Wrong Answer | s = list(input())
k = int(input())
n_L = s[:k]
for i in n_L:
if i != 1:
print(i)
exit()
print(1) |
p03282 | s731908951 | Wrong Answer | S = input()
K = int(input())
if len(S) == '1':
print(S)
exit()
if K == 1:
print(S[0])
exit()
for i in S:
if i != '1' and K != 1:
print(i)
exit()
|
p03282 | s007592098 | 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-1]) |
p03282 | s326034959 | Wrong Answer | def To_Infinity(s , k):
ans = 0
if int(s[0]) == 1:
if k == 1:
ans = 1
else:
ans = s[1]
else:
ans = s[0]
return ans
def main():
s = list(str(input()))
k = int(input())
print(To_Infinity(s , k))
if __name__ == '__main__':
main() |
p03282 | s240323467 | Wrong Answer | S = input()
print(S) if len(S) == 1 else print([S[0],S[1]][S[0] == '1']) |
p03282 | s400875157 | Wrong Answer | S = str(input())
K = int(input())
gosencho = 5 * (10**15)
for i in S:
if i != '1':
K -= int(i) * gosencho
else:
K -= 1
if K <= 0:
print(i)
exit(0) |
p03282 | s085281815 | Wrong Answer | S = input()
K = int(input())
if K == 1 and S[0] == '1':
print(S[0])
exit()
for i in range(len(S)):
if S[i] != '1':
print(S[i])
exit() |
p03282 | s678133547 | Wrong Answer | S = input()
K = int(input())
if len(S) == 1:
print(S)
exit()
if K == 1:
print(S[0])
exit()
for i in S:
if i != '1' and K != 1:
print(i)
exit()
print(1)
|
p03282 | s716572135 | Wrong Answer | s = list(map(str, input().rstrip()))
_ = int(input())
ans = 1
for x in s:
if int(x) != 1:
ans = int(x)
break
print(ans) |
p03282 | s338080506 | Wrong Answer | s = input()
k = int(input())
tyou = 5000000000000000
for i in range(len(s)):
if int(s[i]) == 1:
pass
else:
print(s[i])
exit()
|
p03282 | s171172149 | 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 K < i+1:
n = 1
else:
n = int(S[i])
break
print(n)
|
p03282 | s925430740 | Wrong Answer | numstr = input()
num = int(input())
def check():
for i in range(len(numstr)):
if numstr[i] != 1:
return numstr[i]
print(check())
|
p03282 | s457943451 | Wrong Answer | import sys
input = sys.stdin.readline
def main():
ans = 0
s = input().rstrip('\n')
k = int(input())
for i in range(len(s)):
if s[i] != '1':
if k < i+1:
ans = s[i]
else:
ans = '1'
print(ans)
if __name__ == '__main__':
main() |
p03282 | s394482015 | Wrong Answer | S=input()
K=int(input())
if len(S)==1:
print(S)
quit()
i=0
while i<len(S):
if S[i]!="1":
print(S[i])
quit()
i+=1 |
p03282 | s018649674 | Wrong Answer | s = input()
k = int(input())
ans = 0
for i in range(len(s)):
if int(s[i]) != 1:
ans = int(s[i])
break
else:
next
print(ans) |
p03282 | s684336501 | Wrong Answer | # -*- coding: utf-8 -*-
s = input()
k = int(input())
for i in range(k):
if s[i] != '1':
print(s[i])
break
print(1)
|
p03282 | s785815632 | Wrong Answer | s = input()
k = int(input())
if(k-1 < len(s)):
if(s[k-1] == '1'):
print(1)
exit()
for i in s:
if(i != '1'):
print(i)
exit()
|
p03282 | s774784459 | Wrong Answer | def main():
S = input()
K = int(input())
idx = 0
num = ""
for i in range(len(S)):
idx = i
num = S[i]
if S[i] != "1":
break
if idx >= K - 1:
print("1")
else:
print(num)
if __name__ == "__main__":
main() |
p03282 | s552044018 | Wrong Answer | S=input()
K=int(input())
kazu=5*10**5
for i in range(len(S)):
print(K)
if K<=int(S[i])**kazu:
print(int(S[i]))
break
else:
K-=int(S[i])**kazu
|
p03282 | s212020098 | Wrong Answer | S=input()
K=float(input())
lis=list(S)
ss=set(lis)
if len(ss)==1:
print(S[0])
else:
for num in lis:
if int(num)!=1:
print(num)
break |
p03282 | s527048227 | Wrong Answer | S = list(input())
S = [int(s) for s in S]
K = int(input())
num_digit = 0
for s in S:
if s == 1:
num_digit += 1
else:
num_digit += s * 5 * 10**15
if num_digit >= K:
print(s)
break |
p03282 | s131771734 | Wrong Answer | S = input()
K = int(input())
ans = "1"
for i in range(len(S)):
if S[i] != "1":
ans = S[i]
break
print(ans)
|
p03282 | s143092489 | 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)
cnt += pow(i, c)
if cnt > k:
ans = i
break
print(ans) |
p03282 | s362072947 | Wrong Answer | s=int(input())
s=list(str(s))
k=int(input())
i=0
while True:
if i==len(s):
print(1)
break
if s[i]!="1":
print(s[i])
break
else:
i=i+1
if i==k-1:
print(1)
break |
p03282 | s638790825 | Wrong Answer | S=input()
K=int(input())
kazu=5*10**5
for i in range(len(S)):
if K<=int(S[i])**kazu:
print(int(S[i]))
break
else:
K-int(S[i])**kazu
|
p03282 | s013869485 | Wrong Answer | S=input()
K=int(input())
N=len(S)
for i in range(N):
if not(S[i]=="1"):
print(S[i])
break
|
p03282 | s045597732 | Wrong Answer | s = list(map(int,input()))
k = int(input())
if k == 1:
print(s[0])
else:
if s[0] == 1:
print(s[1])
else:
print(s[0]) |
p03282 | s351725420 | Wrong Answer | S=input()
K=int(input())
N=len(S)
if N==1:
print(S)
else:
if S[0]=="1":
print(S[1])
else:
print(S[0]) |
p03282 | s882078885 | Wrong Answer | s = str(input())
k = int(input())
ans=0
for x in s:
if(int(x)==1):
continue
else:
ans=int(x)
break
print(ans) |
p03282 | s107061897 | Wrong Answer | def main():
import sys
#input = sys.stdin.readline
sys.setrecursionlimit(10000000)
from collections import Counter, deque
#from collections import defaultdict
from itertools import combinations
#from itertools import accumulate, product, permutations
from math import floor, ceil
#mod = 1000000007
s = input()
input()
n = 0
while n<len(s):
if not s[n]=='1':
print(s[n])
exit()
else:
n += 1
print('1')
if __name__ == '__main__':
main() |
p03282 | s611636701 | Wrong Answer | # -*- coding: utf-8 -*-
import sys
sys.setrecursionlimit(10**9)
INF=10**18
MOD=10**9+7
def input(): return sys.stdin.readline().rstrip()
def main():
S=list(map(int,list(input())))
K=int(input())
for n in S:
if n==1:
K-=1
if K==0:
print(0)
exit()
else:
print(n)
exit()
if __name__ == '__main__':
main()
|
p03282 | s282168088 | Wrong Answer | # coding = SJIS
s = str(input())
k = int(input())
ans = 1
for i in s:
if int(i) != 1:
print(i)
exit()
print(ans) |
p03282 | s319058630 | Wrong Answer | s=input()
k=int(input())
if k==1:
print(s[0])
elif s[0]==1:
print(s[1])
else:
print(s[0]) |
p03282 | s617929981 | Wrong Answer | S = list(input())
K = int(input())
for i in S:
if i != "1":
print(i)
exit()
print(1)
|
p03282 | s105862973 | Wrong Answer | s = list(map(int,list(input())))
li = [2,3,4,5,6,7,8,9]
ans = 1
for i in range(len(s)):
if s[i] in li:
ans = s[i]
break
print(ans) |
p03282 | s961528434 | Wrong Answer | S=input()
k=int(input())
for s in S:
if s!='1':
print(s)
exit()
|
p03282 | s864210012 | Wrong Answer | S = input()
K = int(input())
if K > 100:
print(S[0])
else:
for i in range(K):
if S[i] != "1":
print(S[i])
break
if i == K-1:
print(S[K-1]) |
p03282 | s866715865 | Wrong Answer | S = input()
K = int(input())
for i in range(K):
if S[i] != "1":
print(S[i])
break |
p03282 | s778031892 | Wrong Answer | s = input()
k = int(input())
m = 0
for i in s:
if i==1:
m += 1
else:
break
if m>=k:
print(1)
else:
for i in s:
if i!="1":
print(i)
break
else:
continue |
p03282 | s082386213 | Wrong Answer | s = input()
k = int(input())
ans = 1
for i in range(len(s)):
if s[i] != '1':
ans = int(s[i])
break
print(ans)
|
p03282 | s332927102 | Wrong Answer | s=input()
k=int(input())
if s[0]!='1':
print(s[0])
else:
if k==1:
print(1)
else:
print(s[1]) |
p03282 | s487746300 | Wrong Answer | s = input()
input()
if s[0] != '1':
print(s[0])
else:
for e in s:
if e != '1':
print(e)
break |
p03282 | s441260780 | Wrong Answer | S = input()
K = int(input())
ans = ""
for i in range(len(S)):
if int(S[i]) == 1:
continue
else:
if i+1 <= K:
ans = S[i]
break
else:
ans = 1
break
print(ans) |
p03282 | s611527312 | Wrong Answer | def main(s, k):
for i in s:
if i != "1":
print(i)
return
print(1)
if __name__ == "__main__":
s = input()
k = int(input())
main(s, k)
|
p03282 | s084028613 | Wrong Answer |
def submit():
s = str(input())
k = int(input())
for i, c in enumerate(s):
if c != "1":
if i + 1 > k:
print("1")
return
else:
print(c)
return
if __name__ == "__main__":
submit() |
p03282 | s525238265 | Wrong Answer | s = input()
k = int(input())
if k == 1:
print(int(s[0]))
elif s[0] == "1":
print(int(s[1]))
else:
print(int(s[0])) |
p03282 | s800398235 | Wrong Answer | s = input()
k = int(input())
tyou = 5000000000000000
ichi = True
for i in s:
if int(i) != 1:
ichi = False
if k == 1 or ichi :
print(s[0])
else:
for i in range(len(s)):
if int(s[i]) == 1:
pass
else:
print(s[i])
exit()
|
p03282 | s068557785 | Wrong Answer | S=input()
K=int(input())
i=0
while S[i]!='1' and K<i+1:
i+=1
else:
i=0
print(S[i])
|
p03282 | s926876290 | Wrong Answer | # https://atcoder.jp/contests/abc106/tasks/abc106_c
s = input()[:-1]
k = int(input())
for i in range(len(s)):
if s[i] != '1':
print(s[i])
break
else:
print('1') |
p03282 | s598227119 | Wrong Answer | A = str(input())
B = int(input())
count = 0
for i in range(len(A)):
if A[i] == "1":
count += 1
else:
if B <= count:
print(1)
break
else:
print(A[i])
break |
p03282 | s864944761 | Wrong Answer | S = input()
K = int(input())
if S[0] != 1:
print(S[0])
elif S[0] == 1 and K > 1:
print(S[1])
else:
print(1) |
p03282 | s623434172 | Wrong Answer | S = input()
K = int(input())
one = 0
for i in range(len(S)):
tmp = S[i]
if(tmp == "1"):
one += 1
else:
ans = tmp
if(one >= K):
print("1")
exit()
else:
print(str(ans))
exit() |
p03282 | s080669176 | Wrong Answer | #abc106 c
s=input()
k=int(input())
ans="1"
if len(s)!=s.count("1"):
for c in s:
if c!="1":
ans=c
break
print(ans)
|
p03282 | s993939655 | Wrong Answer | s=input()
k=int(input())
for i in range(k):
if s[i]!=1:
print(s[i])
exit()
print(1) |
p03282 | s477195702 | Wrong Answer | s = input()
k = int(input())
for i in range(k):
if i > len(s):
print(1)
break
if s[i] != "1":
print(int(s[i]))
break
|
p03282 | s634420830 | Wrong Answer | s=input()
k=int(input())
if s[0]!="1":
print(s[0])
else:
if k==1:
print(1)
else:
print(s[1]) |
p03282 | s487196443 | Wrong Answer | S = input()
K = int(input())
for i, s in enumerate(S, 1):
if s != "1":
print(s)
exit()
if i == K:
print(1)
|
p03282 | s346584854 | Wrong Answer | S = input()
K = int(input())
for i in range(len(S)):
if(S[i] == "1"):
if(i == len(S)-1 and S[i] == "1"):
print(1)
else:
continue
else:
print(S[i])
break |
p03282 | s132517315 | Wrong Answer | s = str(input())
k = int(input())
if k == 1:
print(s[0])
quit()
else:
for i in s:
if i != '1':
print(i)
quit()
print('1')
|
p03282 | s692102845 | Wrong Answer | S = input()
K = int(input())
length = 0
t = 5 * 10 ** 15
for s in S:
s = int(s)
if s == 1: length += 1
else:
length += s * t
if K < length:
print(s)
exit() |
p03282 | s460166698 | Wrong Answer | S = input()
K = int(input())
for i in range(len(S)):
if(S[i] != '1'):
print(int(S[i]))
exit() |
p03282 | s136163106 | Wrong Answer | S = input()
K = int(input())
index = 0
for i in range(K):
if (S[i] != '1'):
index = i
break
if (index == K - 1):
print(1)
else:
print(S[index]) |
p03282 | s455329312 | Wrong Answer | s = input()
k = int(input())
ans = 1
for i in s:
if i!= '1':
ans = i
break
print(ans) |
p03282 | s106538713 | Wrong Answer | s=list(input())
k=int(input())
for i in s:
if i =="1":
continue
else:
print(i)
break |
p03282 | s581839304 | Wrong Answer | def myAnswer(S:list,K:int) -> int:
if(K == 1): return S[0]
ans = ""
for s in S:
if(s != "1"):
ans = s
break
return ans
def modelAnswer():
tmp=1
def main():
S = list(input())
K = int(input())
print(myAnswer(S[:],K))
if __name__ == '__main__':
main() |
p03282 | s748587623 | Wrong Answer | S = input()
K = int(input())
for i in range(K):
if S[i] != "1":
print(S[i])
break
print("1") |
p03282 | s262706110 | Wrong Answer | s = input()
n = int(input())
for i in s:
if n == 1:
print(i)
exit()
else:
if i == "1":
continue
else:
print(i)
exit() |
p03282 | s651856339 | Wrong Answer | s = input()
k = int(input())
front1 = 0
if s == "1":
print(1)
for i in range(len(s)):
if s[i] == "1":
front1 += 1
else:
break
print(s[min(k-1, front1)]) |
p03282 | s968758417 | Wrong Answer | def main():
s, k = input(), input()
t = set(s)
if len(t) == 1 or s[0] != '1':
ans = s[0]
else:
ans = s[1]
print(ans)
if __name__ == '__main__':
main() |
p03282 | s752777838 | Wrong Answer | import sys
INPUT = lambda: sys.stdin.readline().rstrip()
INT = lambda: int(INPUT())
sys.setrecursionlimit(10 ** 9)
def main():
S = INT()
_ = INT()
for i in str(S):
if int(i) != 1:
print(i)
break
else:
print(1)
if __name__ == '__main__':
main() |
p03282 | s888981810 | Wrong Answer | S=str(input())
K=int(input())
first_number=0
location=0
for i in range(len(S)):
if int(S[i]) != 1:
first_number = S[i]
location = i
break
if K <= location:
print(1)
else:
print(first_number) |
p03282 | s022115901 | Wrong Answer | import itertools
import math
import sys
from collections import Counter
from fractions import gcd
from functools import reduce
s = input()
k = int(input())
for i in s:
if i != "1":
print(i)
break
else:
print(s[0]) |
p03282 | s600078801 | Wrong Answer | S=input()
K=int(input())
for i in range(K):
if S[i] != '1':
print(S[i])
break
if i == K:
print(1) |
p03282 | s727170826 | Wrong Answer | S = input()
K = int(input())
length = 0
t = 5 * 10 ** 15
for c in range(t):
for s in S:
if int(s) == 1:
length += 1
else:
length += t * int(s)
if K <= length:
print(s)
exit() |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.