problem_id stringclasses 100
values | submission_id stringlengths 10 10 | status stringclasses 2
values | code stringlengths 6 806 |
|---|---|---|---|
p03282 | s267763627 | Accepted | #!/usr/bin/env python3
import sys
import math
from bisect import bisect_right as br
from bisect import bisect_left as bl
sys.setrecursionlimit(2147483647)
from heapq import heappush, heappop,heappushpop
from collections import defaultdict
from itertools import accumulate
from collections import Counter
from collections import deque
from operator import itemgetter
from itertools import permutations
mod = 10**9 + 7
inf = float('inf')
def I(): return int(sys.stdin.readline())
def LI(): return list(map(int,sys.stdin.readline().split()))
s = input()
n = len(s)
k = I()
for i in range(n):
if s[i] != '1':
break
else:
print(1)
quit()
if k <= i:
print(1)
else:
print(s[i]) |
p03282 | s695481114 | Accepted | # coding = SJIS
s = str(input())
k = int(input())
ans = 1
for i in range(k):
if s[i] != "1":
print(s[i])
exit()
print(ans) |
p03282 | s495285335 | Accepted | s = input()
k = int(input())
if all(s[i]=="1" for i in range(min(len(s),k))):
print(1)
else:
while s[0]=="1":
s = s[1:]
print(s[0])
|
p03282 | s460505039 | Accepted | S=input()
K=int(input())
if all(S[i]=="1" for i in range(min(K,len(S)))):
print(1)
else:
for i in range(min(K,len(S))):
if S[i]!="1":
print(int(S[i]))
break
|
p03282 | s564513038 | Accepted | def main():
s = list(input())
k = int(input())
if max(s[:k]) == '1':
print(1)
return 0
for i in s:
if i > '1':
print(i)
return 0
if __name__ == '__main__':
main()
|
p03282 | s176091596 | Accepted | S=input()
K=int(input())
a=[]
x=0
for i in range(2,10):
x=S.find(str(i))
if x!=-1:
a.append(x)
else:
a.append(K)
m=min(a)
if m>K-1:
print(1)
else:
print(a.index(m)+2)
|
p03282 | s768254254 | Accepted | s = input()
k = int(input())
front1 = 0
if s == "1":
print(1)
exit()
for i in range(len(s)):
if s[i] == "1":
front1 += 1
else:
break
print(s[min(k-1, front1)]) |
p03282 | s678237760 | Accepted | S = input()
K = int(input())
for s in S[:K]:
if s != "1":
print(s)
break
else:
print(S[K-1]) |
p03282 | s433111409 | Accepted | def myAnswer(S:list,K:int) -> int:
if(K == 1): return S[0]
ans = ""
for n,s in enumerate(S):
if(s != "1"):
ans = s
break
elif(s == "1" and n == K -1 ):
ans = "1"
break
return ans
def modelAnswer():
tmp=1
def main():
S = list(input())
K = int(input())
print(myAnswer(S[:],K))
if __name__ == '__main__':
main() |
p03282 | s262882817 | Accepted |
s = input()
k = int(input())
for si in s:
if si != '1':
print(si)
break
else:
k -= 1
if k == 0:
print(1)
break
|
p03282 | s167480746 | Accepted | S = input()
K = int(input())
for i,s in enumerate(S):
if s != "1" and i < K:
print(s)
exit()
print(1) |
p03282 | s287372606 | Accepted | S = list(input())
K = int(input())
for i in range(K):
if int(S[i]) != 1:
print(int(S[i]))
exit()
print(1)
|
p03282 | s297653720 | Accepted | S = input()
K = int(input())
ans = 1
for i in range(len(S)):
if int(S[i]) > 1 and i < K:
ans = int(S[i])
break
print(ans) |
p03282 | s737248645 | Accepted | s=input()
k=int(input())
ans=1
for i in range(k):
if s[i]!='1':
ans=int(s[i])
print(ans)
exit()
print(1) |
p03282 | s568638133 | Accepted | import sys
def I(): return int(sys.stdin.readline().rstrip())
def LI2(): return list(map(int,sys.stdin.readline().rstrip())) #空白なし
S = LI2()
K = I()
for i in range(K):
if i == K-1 or S[i] != 1:
print(S[i])
break
else:
print(1) |
p03282 | s817869752 | Accepted | S = input()
K = int(input())
if K == 1:
print(S[0])
else:
if len(S) == 1:
print(S)
else:
for i in range(min(K,len(S))):
if S[i] != '1':
print(S[i])
exit()
print(1)
|
p03282 | s440696439 | Accepted | s = input()
k = int(input())
for i in range(min(len(s),k)):
if s[i] != '1':
print(s[i])
quit()
print('1') |
p03282 | s101297567 | Accepted | S = input()
K = int(input())
OK = True
for i in range(min(K, len(S))):
if S[i] != '1':
OK = False
if OK:
print('1')
exit()
for i in range(len(S)):
if S[i] != '1':
print(S[i])
exit() |
p03282 | s974878069 | Accepted | import sys
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)
sys.exit()
else:
print(A[i])
sys.exit()
print(1) |
p03282 | s368172650 | Accepted | S = input()
K = int(input())
for i in range(K):
if S[i] != '1':
print(S[i])
break
else:
print(1)
|
p03282 | s719425208 | Accepted | S = str(input())
K = int(input())
s = list(S)
i = 0
p = 0
for i in range(len(s)):
s[i] = int(s[i])
i = 0
while i < len(s):
if s[i] == 1:
p = i + 1
else:
q = s[i]
break
i = i+1
if K < p + 1:
print(1)
else:
print(q) |
p03282 | s995787676 | Accepted | S = input()
K = int(input())
i = 0
while i < K - 1 and S[i] == '1':
i += 1
print(S[i]) |
p03282 | s680935570 | Accepted | S = input()
K = int(input())
ans = '1'
for i in range(len(S)):
if S[i]!='1':
if i<K:
ans = S[i]
break
print(ans) |
p03282 | s274807704 | Accepted | #coding: utf-8
import math
import heapq
import bisect
import numpy as np
from collections import Counter
#from scipy.misc import comb
S = input()
K = int(input())
cnt_1 = 0
for s in S:
if s=="1":
cnt_1 += 1
else:
break
if cnt_1>=K:
print(1)
else:
print(S[cnt_1]) |
p03282 | s570494024 | Accepted | S = list(str(input()))
K = int(input())
ones = 0
v = 0
for s in S:
if s == '1':
ones += 1
else:
v = s
break
if ones >= K:
print(1)
else:
print(v) |
p03282 | s521119807 | Accepted | def main():
s=input()
k=int(input())
for i in s[:k]:
if i!="1":
print(i)
return
print("1")
main() |
p03282 | s903818049 | Accepted | s = input()
k = int(input())
pos = -1
for i in range(len(s)):
if s[i] != '1':
pos = i
break
if 0 <= pos < k:
print(s[pos])
else:
print(1)
|
p03282 | s890399470 | Accepted | S = input()
K = int(input())
l = 0
for i in range(len(S)):
if S[i] == '1':
l += 1
if l >= K:
print(S[i])
exit()
if S[i] != '1':
print(S[i])
exit()
|
p03282 | s331666456 | Accepted | # coding: utf-8
def main():
S = input()
K = int(input())
ans = '1'
tmp = -1
for i, s in enumerate(S):
if s != '1':
ans = s
break
else:
tmp = i
if K - 1 <= tmp:
ans = '1'
print(ans)
if __name__ == "__main__":
main()
|
p03282 | s487591114 | Accepted | s = input()
k = int(input())
if len(s) == 1:
print(s)
else:
countone = 0
for i in s:
if i == '1':
countone += 1
else:
break
if k <= countone:
print('1')
else:
print(s[countone]) |
p03282 | s782400777 | Accepted | s=input()
k=int(input())
for i in s:
if i!='1':
print(i)
break
else:
k-=1
if k==0:
print(i)
break |
p03282 | s161030281 | Accepted | def main():
s, k = input(), int(input())
count_1 = 0
tmp = ''
for l in s:
if l == '1':
count_1 += 1
else:
tmp = l
break
if count_1 < k:
ans = tmp
else:
ans = 1
print(ans)
if __name__ == '__main__':
main() |
p03282 | s940376998 | Accepted | S = list(str(input()))
K = int(input())
#rint(S)
ans = 1
for i in range(K):
#print(i)
if S[i] != '1' :
ans = S[i]
break
print(ans)
|
p03282 | s929424678 | Accepted | s=input()
k=int(input())
a=1
for i in range(len(s)):
if s[i]!='1':
a=s[i]
break
print(1 if k<=len(s) and s[0:k]=='1'*k else a) |
p03282 | s036147844 | Accepted | s=input()
k=int(input())
for i in list(s[:k]):
if i!="1":print(i);exit()
else:print(1) |
p03282 | s190004479 | Accepted | 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:
print(1)
else:
print(S[ind-1]) |
p03282 | s536211607 | Accepted | s = input()
k = int(input())
for i in range(min(len(s), k)):
if int(s[i]) > 1:
print(s[i])
exit(0)
print(1) |
p03282 | s426783963 | Accepted | def resolve():
s = list(input())
k = int(input())
for i in range(len(s)):
if int(s[i]) == 1:
continue
else:
for j in range(i, len(s)):
s[j] = s[i]
if k < len(s):
print(s[k-1])
return
print(s[-1])
resolve() |
p03282 | s720491096 | Accepted | 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
else:
break
if K <= cnt:
print(1)
else:
print(S[cnt])
|
p03282 | s428743849 | Accepted | s=input()
k=int(input())
t=""
if k==1:
print(s[0])
else:
for i in s:
if int(i)==1:
t+=i
else:
t+=i
break
if k>len(t):
print(t[-1])
else:
print(t[k-1])
|
p03282 | s587766142 | Accepted | s = input()
k = int(input())
one_cnt = 0
for i in range(len(s)):
if s[i] == '1':
one_cnt += 1
else:
break
if k <= one_cnt:
print(1)
exit()
for i in range(len(s)):
if s[i] != '1':
print(s[i])
exit() |
p03282 | s312016990 | Accepted | 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 and len(s[0:k]) == k:
print(1)
else:
i = 0
while s[i] == 1:
i += 1
if s[i] != 1:
print(s[i])
break |
p03282 | s393625116 | Accepted | s=input()
k=int(input())
ans=1
if len(s)==1:
ans=s
else:
for i in range(k):
if s[i]!='1':
ans=s[i]
break
print(ans) |
p03282 | s224220044 | Accepted | s = input()
k = int(input())
ans = 1
for i in range(k):
if int(s[i]) != 1:
ans = int(s[i])
break
print(ans) |
p03282 | s160665370 | Accepted | s_list = list(input())
k = int(input())
for s in s_list[:k]:
if s != "1":
print(s)
exit()
print(1)
|
p03282 | s631315887 | Accepted | s = input()
K = int(input())
ind = 0
for i in range(len(s)):
if s[i] != "1":
ind = i
break
ind += 1
if ind == len(s):
print(1)
else:
if K <= ind:
print(1)
else:
print(s[ind]) |
p03282 | s714103777 | Accepted | def main():
S = input()
K = int(input())
for i in range(min(len(S), K)):
if S[i] != '1':
print(S[i])
return
print(1)
return
main()
|
p03282 | s244284273 | Accepted | s=input()
len_s=len(s)
cnt=0
k=int(input())
for v in s:
if v!='1':
print(int(v))
break
else:
cnt+=1
if k==cnt:
print(1)
break |
p03282 | s975332246 | Accepted | S=input()
K=int(input())
mark=0
for i in range(len(S)):
if(S[i]!='1'):
mark=i
break
if(K-1>=mark):
print(S[mark])
else:
print(1) |
p03282 | s231532605 | Accepted | s=input()
k=int(input())
not1=-1
for i in range(len(s)):
if s[i] != "1":
not1=i
break
if not1==-1:
print(1)
elif k > not1:
print(s[not1])
else:
print(1) |
p03282 | s880742515 | Accepted | import sys
input = sys.stdin.readline
S = input()
K = input()
if len(S) <= int(K):
a = len(S)
else:
a = int(K)
for i in range(a):
ans = S[i]
if ans != '1':
print(ans)
exit()
print(ans)
|
p03282 | s941009396 | Accepted | s = input()
k = int(input())
ans = 1
for v in range(k):
if s[v] != "1":
ans = s[v]
break
print(ans) |
p03282 | s452092481 | Accepted | S = list(input())
K = int(input())
ans = '1'
for i in range(K):
if S[i] != '1':
ans = S[i]
break
print(ans) |
p03282 | s048609816 | Accepted | S = input()
K = int(input())
if S[0] != "1":
print(S[0])
else:
ind = 0
while S[ind] == "1" and ind < len(S) - 1:
ind += 1
if ind < K:
print(S[ind])
else:
print("1")
|
p03282 | s294235210 | Accepted | ns = list(map(int,input()))
n = int(input())
cnt = 1
ans = 0
for i in range(len(ns)):
if (ns[i] == 1 and n == cnt) or ns[i] != 1:
ans = ns[i]
break
else:
cnt += 1
print(ans) |
p03282 | s648324295 | Accepted | s = input()
k = int(input())
for i in range(len(s)):
if '1' != s[i]:
print(s[i])
exit()
if i == k - 1:
print(s[i])
exit()
print(1)
|
p03282 | s442488430 | Accepted | s = list(input())
K = int(input())
if set(s[:K]) == {"1"}:
print("1")
else:
for ss in s:
if ss != "1":
print(ss)
break
|
p03282 | s192469444 | Accepted | S = input()
K = int(input())
for i in range(K):
if int(S[i])!=1:
break
print(S[i])
|
p03282 | s740132981 | Accepted |
def submit():
s = str(input())
k = int(input())
for i, c in enumerate(s, start=1):
if c != "1":
if i > k:
break
else:
print(c)
return
# 全て1 or kまで1
print("1")
if __name__ == "__main__":
submit() |
p03282 | s519720691 | Accepted |
s = input()
k = int(input())
# 1の連続性を確認し終わった段階の数字を記録
cnt = 1
if len(s) == 1:
print(s)
exit()
for i in range(len(s)-1):
if s[i] != '1':
num = s[i]
break
if s[i] == s[i+1] == '1':
cnt += 1
if cnt >= k:
print(1)
else:
print(num)
|
p03282 | s363403389 | Accepted | S = input()
K = int(input())
tmp = 1
tmp_idx = -1
for i in range(len(S)):
if S[i] != "1":
tmp = S[i]
tmp_idx = i
break
if tmp_idx == -1:
print(1)
else:
if K > tmp_idx:
print(tmp)
else:
print(1)
|
p03282 | s248787113 | Accepted | s = input()
k = int(input())
if k == 1: print(s[0])
else:
for i in range(len(s)):
if s[i] != "1":
print(s[i])
break
elif i+1 == k:
print(s[i])
break |
p03282 | s950176748 | Accepted | s = input()
k = int(input())
if set(s[:min(k, len(s))]) == {'1'}:
print(1)
else:
for si in s[:min(k, len(s))]:
if si != '1':
print(si)
break |
p03282 | s848379297 | Accepted | s=input()
k=int(input())
def check(i):
global k
global s
if i==k-1:
print(s[i])
elif s[i]!="1":
print(s[i])
else:
check(i+1)
check(0) |
p03282 | s579729813 | Accepted | import sys
s=input()
k=int(input())
if k<=100:
if s[:k]=='1'*k:
print(1)
sys.exit()
for i in s:
if i!='1':
print(i)
break |
p03282 | s772463232 | Accepted | s = str(input())
k = int(input())
if s[:k].count('1') == len(s[:k]):
print(1)
else:
for i in s:
if i != '1':
print(i)
break |
p03282 | s373206558 | Accepted | s = input()
k = int(input())
num = 0
for i in s:
if i == "1":
num +=1
if num == k:
print(1)
exit()
else:
print(i)
exit() |
p03282 | s606402946 | Accepted | s = input()
k = int(input())
count = 0
for i in range(len(s)) :
if s[i] == "1" :
count += 1
else :
break
if k > count :
print(s[count])
else :
print("1") |
p03282 | s695204237 | Accepted | s=input()
k=int(input())
cnt=0
i=0
while s[i] =="1" and i<=len(s):
cnt+=1
i+=1
if i==len(s):
break
#print(cnt)
if k<=cnt:
print(1)
else:
print(s[i]) |
p03282 | s890280289 | Accepted | from collections import defaultdict
def readInt():
return int(input())
def readInts():
return list(map(int, input().split()))
def readChar():
return input()
def readChars():
return input().split()
s = readChar()
k = readInt()
for i in range(k):
if s[i]!="1":
print(s[i])
exit()
print(1) |
p03282 | s788640172 | Accepted | S = str(input())
N = int(input())
Ones = 0
nxt = ""
for i in range(len(S)):
if S[i] == "1":
Ones += 1
else:
nxt = S[i]
break
if N <= Ones:
print(1)
else:
print(nxt)
|
p03282 | s416474957 | Accepted | S = input()
K = int(input())
cnt = 1
for s in S:
if s != '1':
break
else:
cnt += 1
if K < cnt:
ans = S[0]
else:
ans = S[cnt - 1]
print(ans)
|
p03282 | s174879026 | Accepted | S = input()
K = int(input())
ind = -1
for i in range(len(S)):
if S[i] == '1':
ind = i
else:
break
if ind == -1:
print(S[0])
elif ind + 1 >= K:
print(1)
else:
print(S[ind+1])
|
p03282 | s925632239 | Accepted | s = str(input())
k = int(input())
for i in range(k):
if s[i] != "1":
print(s[i])
break
else:
print(1) |
p03282 | s465644963 | Accepted | s=str(input())
n = int(input())
for i in range(n):
if s[i] != "1":
print(int(s[i]))
break
else:
print("1")
|
p03282 | s355632038 | Accepted | s = input()
k = int(input())
for i in range(k):
if s[i] != "1":
print(s[i])
break
else:
print(1) |
p03282 | s033899674 | Accepted | #n=int(input())
#a,b,c=map(int,input().split())
#t=int(input())
#al=list(map(int,input().split()))
#l=[list(map(int,input().split())) for i in range(n)]
s=list(input())
k=int(input())
if s.count("1")==len(s):
ans="1"
else:
for i in range(len(s)):
if s[i]!= "1":
break
if k>i:
ans=s[i]
else:
ans=s[i-1]
print(ans) |
p03282 | s630219799 | Accepted | #-*-coding:utf-8-*-
import sys
input=sys.stdin.readline
def main():
S = input().rstrip()
k = int(input())
for i in range(k):
if S[i]!="1":
break
print(S[i])
if __name__=="__main__":
main() |
p03282 | s525079985 | Accepted | s=input()
k=int(input())
ans,bns=0,0
for i in range(len(s)):
if s[i]!="1":
ans=s[i]
break
else:
bns+=1 #0の連続
if k<=bns: #k=何番目
print(1)
else:
print(ans) |
p03282 | s563244896 | Accepted | s, k = input(), int(input())
ans = "1"
for i in range(k):
if s[i]!="1":
ans = s[i]
break
print(ans) |
p03282 | s178950953 | Accepted | s = list(input())
k = int(input())
one = 0
for i in range(k+1):
if s[i] == '1':
one += 1
if one == k:
print('1')
exit()
else:
print(s[i])
exit()
|
p03282 | s016507706 | Accepted | S = input()
K = int(input())
ans = S[0]
for i in range(min(len(S),K)):
if S[i] != '1':
ans = S[i]
break
print(ans) |
p03282 | s465297949 | Accepted | S = input()
K = int(input())
mem = 1
for i in S:
if i != "1" or mem == K:
print(i)
break
mem += 1
else: print("1") |
p03282 | s258647769 | Accepted | import sys
s = input()
k = int(input())
if k <= 100:
a = 0
for i in range(k):
if s[i] != '1':
break
if i == str(k-1):
print(1)
sys.exit()
print(s[i])
else:
for i in range(100):
if s[i] != '1':
print(s[i])
break |
p03282 | s471379797 | Accepted | s = input()
k = int(input())
ans = 1
for i in range(k):
if s[i] != "1":
ans = s[i]
break
print(ans)
|
p03282 | s956740678 | Accepted | def resolve():
S = str(input())
K = int(input())
if S[0] != '1':
print(S[0])
return
else:
for i in range(1, K):
if S[i] != '1':
print(S[i])
return
else:
continue
print('1')
return
resolve() |
p03282 | s268845797 | Accepted | s = input()
k = int(input())
for i in range(k):
if s[i] == "1":
continue
else:
print(s[i])
exit()
print(1) |
p03282 | s014938108 | Accepted | S=input()
K=int(input())
first_not_1=-1
for i,s in enumerate(S):
if s=="1":
continue
else:
first_not_1=i
break
if K-1<first_not_1:
print(1)
else:
print(S[first_not_1])
|
p03282 | s001607315 | Accepted | s = input()
k = int(input())
cnt1 = 0
for i in range(k):
if s[i] == '1':
cnt1+=1
else:
not1ind = i
break
if cnt1 >= k:
print(1)
else:
print(s[not1ind])
|
p03282 | s297765622 | Accepted | s=input()
k=int(input())
for i in range(len(s)):
if s[i]!="1":
print(s[i])
exit()
elif i==k-1:
print(1)
exit() |
p03282 | s734641012 | Accepted | S = input()
K = int(input())
lista = list(S)
flag = 0
if(K<= len(lista)):
for i in range(K):
if(lista[i] != "1"):
flag = 1
ans = lista[i]
break
if(flag == 0):
print(1)
else:
print(ans)
else:
i = 0
while True:
if(lista[i] != "1"):
print(lista[i])
break
i+= 1 |
p03282 | s828414364 | Accepted | # -*- 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(1)
exit()
else:
print(n)
exit()
if __name__ == '__main__':
main()
|
p03282 | s286106793 | Accepted | S = input()
K = int(input())
for i, s in enumerate(S):
if s == "1":
K -= 1
else:
print(s)
break
if K <= 0:
print("1")
break
|
p03282 | s732059757 | Accepted | s = input()
k = int(input())
if k == 1:
print(s[0])
else:
if s[0] == '1':
for i in range(min(len(s),k)):
if s[i] != '1':
print(s[i])
exit()
print(s[1])
else:
print(s[0]) |
p03282 | s728220150 | Accepted | from itertools import groupby
n = list(input())
k = int(input())
if n == 1:
print(1)
exit()
li = []
for key,v in groupby(n):
li.append(list(v))
if li[0][0] == "1":
if len(li[0])>= k:
print(1)
exit()
for i in range(len(n)):
if n[i] != "1":
print(n[i])
break |
p03282 | s628124093 | Accepted | S = input()
K = int(input())
if len(S) >= K and S[K-1] == "1" and len(set(S[:K]))==1:
print(1)
else:
print([c for c in S if c != "1"][0])
|
p03282 | s806170622 | Accepted | S=input()
K=int(input())
for i in range(len(S)):
si=int(S[i])
if si>1:
print(si)
break
elif i==K-1:
print(si)
break |
p03282 | s790505409 | Accepted | s = input()
k = int(input())
for i in range(k):
if s[i] != '1':
print(s[i])
break
if i == k-1:
print(1) |
p03282 | s482955231 | Accepted | s = str(input())
k = int(input())
num = 1
for i in range(len(s)):
ind = i+1
if s[i] != '1':
num = int(s[i])
break
if k>= ind:
ans = num
else:
ans = 1
print(ans) |
p03282 | s868879271 | Accepted | S = input()
K = int(input())
if len(S) == 1:
print(S)
else:
if S[:K].count('1') == K:
print(1)
else:
print(list(filter(lambda x: x!= '1', S))[0]) |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.