problem_id stringclasses 100
values | submission_id stringlengths 10 10 | status stringclasses 2
values | code stringlengths 6 806 |
|---|---|---|---|
p03282 | s114357149 | Accepted | import sys
s=input()
k=int(input())
for i in range(k):
if s[i]!='1':
print(s[i])
sys.exit()
print(1) |
p03282 | s742589138 | Accepted | import sys
def input(): return sys.stdin.readline().strip()
def main():
S = input()
K = int(input())
for i in range(K):
n = int(S[i])
if n != 1:
print(n)
return
print(1)
if __name__ == "__main__":
main()
|
p03282 | s171777213 | Accepted | s = input()
k = int(input())
for i in range(0,k):
if s[i] != '1':
print(s[i])
exit()
print(s[0])
|
p03282 | s374024046 | Accepted | def main():
S = input()
K = int(input())
cnt = 0
while cnt<len(S) and S[cnt]=='1':
cnt = cnt + 1
if K<=cnt:
print(S[0])
elif cnt==len(S):
print(S[cnt-1])
else:
print(S[cnt])
if __name__ == '__main__':
main() |
p03282 | s850411518 | Accepted | S = input()
K = int(input())
flag = False
if set(S[:K]) == set(['1']):
print(1)
else:
for i in range(K):
if S[i] != '1':
print(S[i])
break
|
p03282 | s468205613 | Accepted | S=input()
K=int(input())
if K==1:
print(S[0])
else:
for i,s in enumerate(S):
if i==K-1:
print(s)
exit()
if s!="1":
print(s)
exit() |
p03282 | s306583161 | Accepted | #!/usr/bin/env python3
s = str(int(input()))
k = int(input())
for i in range(k):
if s[i] != "1":
print(s[i])
exit()
print(s[i])
# if s[0] == "1":
# if k == 1:
# print(1)
# else:
# print(s[1])
# else:
# print(s[0])
|
p03282 | s939453401 | Accepted | s = input()
k = int(input())
cnt = 0
for j in range(len(s)):
cnt += 1
if s[j] == "1":
if cnt == k:
print("1")
exit()
else:
print(s[j])
exit()
|
p03282 | s523997678 | Accepted | s = input()
k = int(input())
for i in range(k):
if s[i] != '1':
print(s[i])
exit()
print(1) |
p03282 | s761771802 | Accepted | def main():
S = input()
k = int(input())
for s in S[:k]:
if s != '1':
print(s)
break
else:
print(1)
if __name__ == '__main__':
main()
|
p03282 | s150391737 | Accepted | S=input()
K=int(input())
i=0
while S[i]=='1' and K>i+1 and i<len(S):
i+=1
if i==len(S):
i=0
print(S[i])
|
p03282 | s992656840 | Accepted | s = str(input())
k = int(input())
len_s = len(s)
cnt_1 = 0
for i in range(len_s):
if s[i] == '1':
cnt_1 += 1
else:
moji = s[i]
break
if cnt_1 >= k:
print(1)
else:
print(s[i]) |
p03282 | s990875287 | Accepted | import sys
S = input()
K = int(input())
if len(S) == 1:
print(S)
sys.exit(0)
if K == 1:
print(S[0])
sys.exit(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 | s066986329 | Accepted | s=list(input())
k=int(input())
ans='1'
for i in range(k):
if s[i]=='1':
continue
else:
ans=s[i]
break
print(ans) |
p03282 | s580649717 | Accepted | S = input()
K = int(input())
T = "N"
for i in range(len(S)):
if S[i] != "1":
T = "Y"
k = i+1
x = int(S[i])
break
if T == "N":
print(1)
else:
if K < k:
print(1)
else:
print(x) |
p03282 | s340930027 | Accepted | s = list(str(input()))
k = int(input())
ans = '1'
for i in range(k):
if s[i] != '1':
ans = s[i]
break
if len(s)-1 == i:
break
print(int(ans)) |
p03282 | s417175369 | Accepted | s = input().rstrip()
n = int(input().rstrip())
if s[:n].count('1') == n:
print(1)
else:
print(s.replace('1', '')[0]) |
p03282 | s654501874 | Accepted | S = input().strip()
ind = -1
for i in range(len(S)):
if S[i]=="1":
ind = i
else:break
K = int(input())
ind += 1
if K<=ind:
print(1)
else:
print(S[ind]) |
p03282 | s084605329 | Accepted | import re
S = input()
K = int(input())
m = re.match(r'\A(1+)([1-9]*)\Z', S)
if m:
print('1' if len(m.group(1)) >= K else m.group(2)[0])
else:
print(S[0])
|
p03282 | s998952151 | Accepted | import re
S = input()
K = int(input())
m = re.match(r'\A(1*)([1-9]*)\Z', S)
print('1' if len(m.group(1)) >= K else m.group(2)[0])
|
p03282 | s844235231 | Accepted | # 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())
for i in range(k):
if s[i] != "1":
print(s[i])
return
print(1)
if __name__ == "__main__":
resolve()
|
p03282 | s596574945 | Accepted | s=input()
k=int(input())
pos=-1
for i in range(len(s)):
if(s[i]!='1'):
pos=i;break;
if(pos==-1 or k<pos+1):
print(1);exit()
print(s[pos]) |
p03282 | s784730766 | Accepted | s = input().rstrip()
k = int(input())
c = '1'
for i in range(min(len(s), k)):
if s[i] != '1':
c = s[i]
break
print(c) |
p03282 | s032567220 | Accepted | S=input()
K=int(input())
tmp = 0
for i in S:
if i=='1':
tmp += 1
else:
break
if K <= tmp:
print(1)
else:
print(S[tmp]) |
p03282 | s167574474 | Accepted | s=input()
li=list(set([s[i] for i in range(len(s))]))
k=int(input())
c=0
for i in range(len(s)):
if s[i] != "1":
t = s[i]
j=i
c=1
break
if c==0:
print(1)
else:
if j<=k-1:
print(t)
else:
print(1) |
p03282 | s027823940 | Accepted | S = input()
K = int(input())
ans = "1"
for i in range(K):
if S[i] != "1":
ans = S[i]
break
print(ans)
|
p03282 | s715676175 | Accepted | S=input()
K=int(input())
for i in range(len(S)):
if i==K-1:
print(S[i])
exit()
if S[i]!="1":
print(S[i])
exit()
print(1) |
p03282 | s610421616 | Accepted | s = input()
k = int(input())
for i in range(min(len(s), k)):
if not s[i] == '1':
print(s[i])
break
else:
print(1) |
p03282 | s347003915 | Accepted | S=list(input())
S=list(map(int,S))
K=int(input())
i=0
while i<K:
if S[i]>1:
ans=S[i]
break
else:
ans=1
i+=1
print(ans) |
p03282 | s264017985 | Accepted | S = input()
K = int(input())
for i, s in enumerate(S, 1):
if s == '1':
if i == K:
print(s)
break
else:
continue
else:
print(s)
break |
p03282 | s340715629 | Accepted | 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
else:
cnt += 1
if cnt == k:
ans = 1
break
print(ans) |
p03282 | s702239976 | Accepted | import sys
def input():
return sys.stdin.readline().rstrip()
S=input()
K=int(input())
ichi=0
for i in range(len(S)):
if S[i]=="1":
ichi+=1
else:
break
print(1 if K<=ichi else S[ichi])
|
p03282 | s236581908 | Accepted | s = list(input())
k = int(input())
sum1 = 0
for i in s:
if(int(i) == 1):
sum1 += 1
else:
ans = int(i)
break
if(sum1 >= k):
print("1")
else:
print(ans) |
p03282 | s518763643 | Accepted | s = list(input())
k = int(input())
cur = 1
for c in s:
if c != "1":
print(c)
break
else:
if cur == k:
print(c)
break
cur += 1
|
p03282 | s906569952 | Accepted | S=input()
K=int(input())
for i in range(K):
if S[i]!='1':
print(S[i])
exit(0)
print(S[K-1]) |
p03282 | s853799170 | Accepted | S = input().rstrip()
K = int(input())
for s in S[:K]:
if s!="1":
print(s)
exit()
print(1) |
p03282 | s594332260 | Accepted | x=input()
m=int(input())
x=list(x)
if len(x)<m:
m=len(x)
t=1
for i in range(m):
if x[i]!='1' and t==1:
t=x[i]
t=int(t)
print(t) |
p03282 | s391217940 | Accepted | s=input()
k=int(input())
for i in s[:k]:
if i=='1':
continue
else:
print(i)
exit()
print(1)
|
p03282 | s837600868 | Accepted | s = input()
k = int(input())
if s[0] != "1":
print(s[0])
elif s[:k].replace("1","")=="":
print("1")
else:
print(s.replace("1","")[0]) |
p03282 | s632577389 | Accepted | S = input()
K = int(input())
ones = 0
nzero = ""
for i in S:
if i == "1":
ones += 1
else:
nzero = i
break
if K <= ones:
print(1)
else:
print(nzero) |
p03282 | s909693834 | Accepted | S=input()
K=int(input())
tmp=100
for i in range(len(S)):
if S[i]!='1':
tmp=i
break
if K<=tmp:
ans=S[0]
else:
ans=S[tmp]
print(ans) |
p03282 | s851291731 | Accepted | S=input()
K=int(input())
for i in range(min(len(S),K)):
if S[i]>="2":
print(S[i])
exit()
print("1")
|
p03282 | s979809248 | Accepted | s = input()
k = int(input())
if k > len(s):
for i in s:
if i != '1':
print(i)
exit()
else:
for i in range(k):
if s[i] != '1':
print(s[i])
exit()
print(1)
|
p03282 | s392072296 | Accepted | def main():
s = input()
k = int(input())
ans = solve(s, k)
print(ans)
def solve(s, k):
for i in range(k):
if s[i] != '1':
return s[i]
return '1'
if __name__ == '__main__':
main() |
p03282 | s274316621 | Accepted | s = input()
k = int(input())
for i in range(k):
if s[i] != '1':
print (s[i])
exit ()
else:
print ('1')
|
p03282 | s599370884 | Accepted | s = input()
k = int(input())
for i in range(len(s)):
if s[i] != '1':
print(s[i] if i+1 <= k else 1)
exit()
print(1) |
p03282 | s175418333 | Accepted | s = input()
k = int(input())
ok = True
for i in range(k):
if s[i] != "1":
print(s[i])
ok = False
exit()
if ok:
print(1)
|
p03282 | s330005521 | Accepted | s = input()
k = int(input())
k = k-1
def not1(t):
for i in range(len(t)):
if t[i] != '1':
return (i, t[i])
return (-1, '1')
(j, t) = not1(s)
if j == -1:
print('1')
exit()
if k < j:
print('1')
exit()
if k >= j:
print(t)
exit()
|
p03282 | s515029532 | Accepted | S = input()
K = int(input())
ans = 1
if K == 1:
print(S[0])
exit()
else:
for i in range(len(S)):
if S[i] != "1" and i < K:
ans = int(S[i])
break
print(ans) |
p03282 | s735610480 | Accepted | s = input()
k = int(input())
cnt = 0
for v in s:
if v == "1": cnt += 1
else: break
if cnt == k: break
print(v) |
p03282 | s328513195 | Accepted | s=input()
i=1
while 1:
if i==len(s)+1:
print(1);exit()
if s[i-1]!="1":
t=i
ans=int(s[i-1])
break
i+=1
# print(t)
if int(input())<t:
print(1);exit()
print(ans)
|
p03282 | s333026444 | Accepted | S = input()
K = int(input())
count = 0
for t in S:
if int(t) == 1:
count += 1
else:
break
if K <= count:
print(1)
else:
print(int(S[count]))
|
p03282 | s044858700 | Accepted | import sys
s=input()
k=int(input())
for i in range(min(len(s),k)):
if s[i]!="1":
print(s[i])
sys.exit()
print(1)
|
p03282 | s976791277 | Accepted | S = input()
K = int(input())
tmp_S = S[:K]
if tmp_S.count('1')==K:
print(1)
exit()
else:
for i in range(len(S)):
if S[i]!='1':
print(S[i])
exit() |
p03282 | s216408635 | Accepted | from collections import defaultdict,deque
import sys,heapq,bisect,math,itertools,string,queue,datetime
sys.setrecursionlimit(10**8)
INF = float('inf')
mod = 10**9+7
eps = 10**-7
def inpl(): return list(map(int, input().split()))
def inpl_s(): return list(input().split())
S = input()
K = int(input())
for i in range(K):
if S[i] == '1':
continue
else:
print(S[i])
sys.exit()
print(S[K-1])
|
p03282 | s194459795 | Accepted | S=input()
k=int(input())
cnt=0
for i in range(len(S)):
if S[i]=="1":
cnt+=1
else:
temp=S[i]
break
if k<=cnt:
print(1)
else:
print(temp)
|
p03282 | s733254152 | Accepted | s = input()
n = int(input())
k = 0
for i in s:
if i == "1":
k += 1
else:
break
for i in s:
if n <= k:
print(i)
exit()
else:
if i == "1":
continue
else:
print(i)
exit() |
p03282 | s879414081 | Accepted | s = input()
k = int(input())
for i in s[:k]:
if i!="1":
print(i)
break
else:print("1") |
p03282 | s944179212 | Accepted | 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]) |
p03282 | s287123789 | Accepted | s = input()
k = int(input())
notone = 1
notonei = 101
for i, n in enumerate(s):
if n != "1":
notone = int(n)
notonei = i
break
if k <= notonei:
print(1)
else:
print(notone) |
p03282 | s854058584 | Accepted | s=input()
k=int(input())
ans=-1
flag=True
for i in range(min(len(s),k)):
if s[i]!='1':
flag=False
ans=int(s[i])
break
if flag:
print(1)
else:
print(ans)
|
p03282 | s077334978 | Accepted | def main():
s = input()
k = int(input())
if s[0] != '1':
print(s[0])
exit()
for i in range(1,len(s)):
if s[i] != '1':
break
else:
print(1)
exit()
if i >= k:
print(1)
exit()
print(s[i])
if __name__ == '__main__':
main() |
p03282 | s462647183 | Accepted | #!/usr/bin/env python3
import sys
def input():
return sys.stdin.readline()[:-1]
def main():
S = input()
K = int(input())
if K >= 1e3:
K = 105
T = ''
for i in range(len(S)):
if S[i] == '1':
T += '1'
else:
T += S[i] * K
if S[i] != '1':
break
print(T[K - 1])
if __name__ == '__main__':
main()
|
p03282 | s797701593 | Accepted | S = list(input())
K = int(input())
cnt1 = 0
for i in range(K):
if S[i] == '1':
cnt1 += 1
else:
break
if K <= cnt1:
print(1)
else:
print(S[cnt1]) |
p03282 | s168154288 | Accepted | #!/usr/bin/env python3
s = input()
k = int(input())
idx = 1
for i in range(len(s)):
if idx <= k:
if int(s[i]) == 1: idx += 1
else:
print(s[i])
exit()
else: break
print(1) |
p03282 | s500733539 | Accepted | s = str(input())
k = int(input())
count = 0
for i in s:
if i == "1":
count += 1
if count == len(s):
print(1)
break
else:
pass
else:
if k <= count:
print(1)
break
else:
print(i)
break
|
p03282 | s350961224 | Accepted | s = list(input())
k = int(input())
p = -1
for i in range(len(s)):
if s[i]!='1':
p=i
break
if p==-1:
print(1)
else:
if k<p+1:
print(1)
else:
print(s[p])
|
p03282 | s391155947 | Accepted | s = int(input())
k = int(input())
for i in str(s):
if i == '1':
if k == 1:
print(1)
break
else:
k -= 1
else:
print(i)
break |
p03282 | s753159140 | 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 | s032337342 | Accepted | S = input()
K = int(input())
for i in range(len(S)):
if(S[i] == "1"):
if(i == K-1):
print(S[i])
break
continue
else:
print(S[i])
break |
p03282 | s883175022 | Accepted | # -*- coding: utf-8 -*-
"""
Created on Wed Sep 16 01:17:00 2020
@author: liang
"""
S = input()
K = int(input())
#count = 0
for i in range(len(S)):
if S[i] != '1':
break
#print("i",i)
if K < i + 1:
print(1)
#print("A")
else:
print(S[i])
#print("B") |
p03282 | s353990439 | Accepted | s = input()
k = int(input())
ans = "1"
for i in range(min(k, len(s))):
if s[i] != "1":
ans = s[i]
break
print(ans)
|
p03282 | s857138211 | Accepted | s = list(input())
k = int(input())
for i in range(len(s)):
if s[i] == "1":
if i == k - 1:
print(1)
exit()
else:
print(s[i])
exit() |
p03282 | s872990455 | Accepted | import sys
S = sys.stdin.readline().strip()
K = int(sys.stdin.readline())
for s_i in S:
if s_i == "1":
K -= 1
else:
break
if K <= 0:
break
print(s_i) |
p03282 | s750270087 | 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 | s359304201 | Accepted |
s=list(input())
k=int(input())
for i in range(k):
if s[i]!="1":
break
if s[i]!="1":
print(s[i])
else:
print(1)
|
p03282 | s973936407 | Accepted | S = input()
K = int(input())
total = 0
for n in S:
if n == "1":
total += 1
if total == K:
print(1)
break
else:
print(n)
break |
p03282 | s994741005 | Accepted | s = input()
k = int(input())
for i in range(k):
if s[i]!='1':
print(s[i])
exit()
print(s[k-1]) |
p03282 | s527432725 | Accepted | s = list(input())
k = int(input())
n = min(len(s), k)
for i in range(n):
if s[i] != "1":
print(s[i])
exit()
print(1) |
p03282 | s430900002 | Accepted | S = input()
k = int(input())
days = 5*10*15
for s in S:
si = int(s)
if si == 1:
k -= 1
else:
k -= si**days
if k <= 0:
print(si)
break
|
p03282 | s107187888 | Accepted | s=input()
k=int(input())
sl=list(s)
for i in range(k):
if s[i]!='1':
print(s[i])
exit()
print(1) |
p03282 | s089931510 | Accepted | import sys
S = str(input())
K = int(input())
if len(S) == 1:
print(S[0])
sys.exit()
count = 0
l = 0
for i in range(len(S)):
if S[i] == '1':
count += 1
else:
break
#print(count)
if count < K:
print(S[count])
else:
print(1) |
p03282 | s194186235 | 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 | s362501393 | Accepted | s=list(input())
k=int(input())
cnt=0
ans=0
flag=0
for i in s:
if i =="1":
cnt+=1
continue
else:
if cnt<k:
print(i)
else:
print("1")
flag+=1
break
if flag==0:
print("1") |
p03282 | s694796155 | Accepted | S = input()
K = int(input())
are_all_one = True
for i in range(len(S)):
if S[i] != '1':
are_all_one = False
break
nth = i + 1
if are_all_one or K < nth:
print(1)
exit()
answer = S[i]
print(answer)
|
p03282 | s470846476 | Accepted | S = list(input())
K = int(input())
out = 1
for i in range(K):
if S[i]!="1":
out = int(S[i])
break
print(out)
|
p03282 | s876403676 | Accepted | s=input()
k=int(input())
for i in range(len(s)):
if int(s[i])==1:
k-=1
if k==0:
print(s[i]);exit()
else:
print(s[i]);exit()
|
p03282 | s620093893 | Accepted | import sys
sys.setrecursionlimit(10 ** 6)
def input(): return sys.stdin.readline().rstrip()
S = input()
K = int(input())
if all(c == '1' for c in S[:K]):
print(1)
else:
print(list(c for c in S if c != '1')[0])
|
p03282 | s230273925 | Accepted | if __name__ == '__main__':
S = input()
n = int(input())
flg = False
for x in range(n):
if S[x] != "1":
print(S[x])
flg = True
break
if flg == False:
print("1") |
p03282 | s592057914 | Accepted | S=input()
K=int(input())
count=0
for s in S:
if int(s)==1:
count+=1
if count>=K:
print(s)
break
else:
print(s)
break |
p03282 | s413519699 | Accepted | import sys
INPUT = lambda: sys.stdin.readline().rstrip()
INT = lambda: int(INPUT())
sys.setrecursionlimit(10 ** 9)
def main():
S = INT()
K = INT()
for i, s in enumerate(str(S)):
if int(s) != 1:
if i >= K: print(1)
else: print(s)
break
else:
print(1)
if __name__ == '__main__':
main() |
p03282 | s999941601 | Accepted | import re
m = re.match(r'\A(1*)([1-9]*)\Z', input())
print('1' if len(m.group(1)) >= int(input()) else m.group(2)[0])
|
p03282 | s160374873 | Accepted | s = input()
k = int(input())
l = 0
ans = 0
for i in range(len(s)):
if s[i] == '1':
l += 1
if k == l:
ans = 1
break
else:
ans = int(s[i])
break
print(ans) |
p03282 | s013569112 | Accepted | s=input()
n=int(input())
l=[]
for x in s:
l.append(x)
if x!="1":break
print(l[min(len(l)-1,n-1)]) |
p03282 | s200766704 | Accepted | s=input()
n=int(input())
for i in range(n):
if s[i]!="1":
print(s[i])
exit()
print(1) |
p03282 | s796753385 | Accepted | s=input()
k=int(input())
if s[0]!="1":
print(s[0])
else:
cnt=0
for i in range(len(s)):
if s[i]=="1":
cnt+=1
else:
break
if cnt>=k:
print(1)
else:
print(s[cnt]) |
p03282 | s201825037 | Accepted | s = input()
n = len(s)
k = int(input())
ans = None
for i in range(k):
if i == n:
break
if s[i] != '1':
ans = int(s[i])
break
else:
continue
if ans:
print(ans)
else:
print(1) |
p03282 | s013540624 | Accepted | S = input()
K = int(input())
for i in range(K):
if S[i] != "1":
print(S[i])
break
else:
print(1) |
p03282 | s601424719 | Accepted | S=input()
K=int(input())
for i in range(K):
if S[i]!='1':
print(S[i])
exit()
print(1) |
p03282 | s595059028 | Accepted | s=list(input())
k=int(input())
num=1
for i in range(len(s)):
if s[i]!=str(1):
num=i+1
break
if k>=num:
print(s[num-1])
else:
print(1)
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.