problem_id stringclasses 100
values | submission_id stringlengths 10 10 | status stringclasses 2
values | code stringlengths 6 806 |
|---|---|---|---|
p03282 | s141108494 | Accepted | s=input()
k=int(input())
ans="1"
for i in range(k):
if (int(s[i])!=1):
ans=s[i]
break
print(ans) |
p03282 | s765588935 | Accepted | S = [int(i) for i in input()]
K = int(input())
if sum(S)==len(S):
print(1)
else:
for i in range(len(S)):
if S[i]!=1:
print(S[i])
break
elif S[i]==1 and K-1<=i:
print(1)
break |
p03282 | s139494925 | Accepted | s=list(input())
k=int(input())
for i in range(k):
if s[i]!="1":
print(s[i])
break
else:
print(1) |
p03282 | s787038548 | Accepted | n_l=list(input())
now=0
N=int(input())
if n_l[:N].count("1") == len(n_l[:N]):
print(1)
else:
for i in range(len(n_l)):
if n_l[i] != "1":
print(n_l[i])
exit() |
p03282 | s157333145 | Accepted | S = input()
K = int(input())
last = "1"
ind = 100
for i,s in enumerate(S):
if s != "1":
last = s
ind = i
break
if K-1 < ind:
print("1")
else:
print(last) |
p03282 | s382345137 | Accepted | S = list(input())
K = int(input())
for i in range(K):
if S[i] != "1":
print(S[i])
exit()
if i + 1 == K:
print(S[i])
exit()
print("1")
|
p03282 | s408057575 | Accepted | S = input()
K = int(input())
t = -1
for k in range(len(S)):
t = k
if S[k] != "1":
break
if K <= t:
print(1)
else:
print(S[t])
|
p03282 | s895023707 | Accepted | import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
sys.setrecursionlimit(10 ** 7)
s = readline().rstrip().decode()
k = int(read())
for ss in s:
ss = int(ss)
if ss > 1:
print(ss)
break
else:
if k > 1:
k -= 1
else:
print(ss)
break
|
p03282 | s108565666 | Accepted | s=input()
k =int(input())
for i in range(k):
if s[i] != '1':
ans = s[i]
break
elif i < k-1:
ans = s[i+1]
else:
ans = s[i]
print(ans) |
p03282 | s517297950 | Accepted | s = str(input())
k = int(input())
for i in range(len(s)):
if s[i] != '1' or k - 1 == i:
print(s[i])
exit() |
p03282 | s350522105 | Accepted | s = list(str(input()))
s = list(map(int, s))
k = int(input())
flag = True
for i in range(min(len(s),k)):
if s[i] != 1:
flag = False
else:
pass
if flag:
print(1)
else:
for i in range(len(s)):
if s[i] != 1:
print(s[i])
break
|
p03282 | s109815474 | Accepted | n = list(input())
k = int(input())
if len(n) == 1:
print(int(n[0]))
exit()
x = 0
for i in range(len(n)):
if n[i] != "1":
x = i
break
if x+1 > k:
print(1)
exit()
else:
print(n[x])
|
p03282 | s016035650 | Accepted | import sys
S=input()
K=int(input())
for s in S[:min(len(S),K)]:
if s=="1":
pass
else:
print(s)
sys.exit()
print(1)
|
p03282 | s372167193 | Accepted | def main():
S = input()
K = int(input())
tmp = ''
count = 0
for s in S:
if s == '1':
count += 1
else:
tmp = s
break
if count >= K:
print('1')
else:
print(tmp)
if __name__ == "__main__":
main()
|
p03282 | s198991833 | Accepted | S = input()
K = int(input())
for s in S[:K]:
if s != '1':
print(s)
break
else:
print(1)
|
p03282 | s580936487 | Accepted | s = input()
k = int(input())
for i in range(k):
if s[i] != "1":
print(s[i])
break
else:
print(1) |
p03282 | s629389371 | Accepted | s = list(map(str, input().rstrip()))
k = int(input())
ans = 1
for x in s[:k]:
if int(x) != 1:
ans = int(x)
break
print(ans) |
p03282 | s596275091 | Accepted | s = input()
k = int(input())
if k == 1:
print(int(s[0]))
elif s[0] == "1":
cnt = 0
while cnt < len(s) and s[cnt] == "1" :
cnt += 1
if cnt >= k:
print(1)
elif cnt == len(s):
print("1")
else:
print(s[cnt])
else:
print(int(s[0])) |
p03282 | s626430867 | Accepted | S = input()
K = int(input())
for k in range(K):
if S[k] != '1':
print(S[k])
exit()
print(1) |
p03282 | s233312008 | Accepted | s=input()
n=len(s)
k=int(input())
index=-1
for i in range(n):
if s[i]!='1':
index=i
break
if index==-1:
print(1)
else:
if k<=index:
print(s[k-1])
else:
print(s[index]) |
p03282 | s104647865 | Accepted | import sys
S = input()
K = int(input())
k=0
for s in S:
s = int(s)
k += 1
if not s == 1:
print(s)
sys.exit()
elif k == K:
print(1)
sys.exit() |
p03282 | s906849269 | Accepted | a = input()[:int(input())]
j = set(sorted(set(a), key=a.index)[:2])
j.discard("1")
print(list(j)[0] if j else 1) |
p03282 | s305720441 | Accepted | S = input()
K = int(input())
ans = 0
for i in range(K):
if S[i]!="1":
ans = S[i]
break
print(1) if ans==0 else print(ans) |
p03282 | s232449474 | Accepted | n=str(input())
N = int(n)
m=int(input())
cnt = 0
for i in range(m):
if i >= N:
break
if n[i] == "1":
cnt +=1
else:
break
if cnt == m:
print(1)
elif cnt == 0:
print(n[0])
elif cnt < m:
print(n[cnt]) |
p03282 | s417604367 | Accepted | s = input()
k = int(input())
for i in range(k):
if s[i] != "1":
print(s[i])
exit()
print(1) |
p03282 | s390472579 | Accepted | S=input()
K=int(input())
for i in range(K):
if S[i]=="1":
continue
else:
print(S[i])
exit()
print("1") |
p03282 | s538842091 | Accepted | s = input()
k = int(input())
one_counter = 0
for i in range(len(s)):
if s[i] != "1":
break
else:
one_counter += 1
if s[0] == "1":
if k <= one_counter:
res = s[0]
else:
res = s[one_counter]
else:
res = s[0]
print(res) |
p03282 | s540375181 | Accepted | #106_C
S=input()
K=int(input())
ans=0
for i in range(len(S)):
if S[i]!='1':
ans=i
break
print('1' if K<=ans else S[ans]) |
p03282 | s505709772 | Accepted | s = list(input())
k = int(input())
ans = "1"
cnt = 0
for i in s:
if i == "1":
cnt += 1
elif cnt < k:
ans = str(i)
break
print(ans)
|
p03282 | s779635044 | Accepted | s = input()
k = int(input())
for i, x in enumerate(s):
if x == '1':
if k == i + 1:
print(1)
exit()
else:
print(x)
exit() |
p03282 | s019866199 | Accepted | s = input()
if set(s[:int(input())])=={'1'}:
print(1)
else:
for i in s:
if int(i) > 1:
print(int(i))
break |
p03282 | s667663743 | Accepted | S = input()
K = int(input())
ans = 1
for i in range(K):
if (S[i] != '1'):
ans = S[i]
break
print(ans)
|
p03282 | s420902637 | Accepted | s = input()
k = int(input())
for _s in s:
if _s == "1":
if k == 1:
print(1)
break
else:
k -= 1
else:
print(_s)
break
|
p03282 | s133115276 | Accepted | S=input()
K=int(input())
ans="1"
for i in range(K):
if S[i]!="1":
ans=S[i]
break
print(ans) |
p03282 | s620433306 | Accepted | import sys
def input():
return sys.stdin.readline().rstrip()
def main():
S = input()
K = int(input())
i = 0
for i in range(K):
if S[i]=="1":
continue
else:
print(S[i])
exit()
print(1)
if __name__ == "__main__":
main()
|
p03282 | s820058531 | Accepted | S = input()
K = int(input())
char_sum = 0
for letter in S:
n = int(letter)
let_power = 1 if (n == 1) else float('inf')
if (char_sum + let_power) >= K:
print(letter)
break
else:
char_sum += let_power
|
p03282 | s681371229 | Accepted | S = [int(i) for i in input()]
K = int(input())
ans = 1
if K<=len(S):
for i in S[:K]:
if i!=1:
ans=i
break
else:
for i in S:
if i!=1:
ans=i
break
print(i) |
p03282 | s374940966 | Accepted | s = str(input())
k = int(input())
for i in range(k):
if s[i] != "1" :
break
print(s[i])
|
p03282 | s144324925 | Accepted | s = input()
k = int(input())
ichi = 0
for i in s:
if int(i) == 1:
ichi = ichi +1
else:
break
if ichi >= k:
print(1)
else:
print(s[ichi])
|
p03282 | s990051393 | Accepted | # 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:
K += 1
break
if pos==s_len:
pos -= 1
break
# output
if K==0:
print(S[pos-1])
else:
print(S[pos])
|
p03282 | s652028182 | Accepted | S=input()
k=int(input())
for i in range(min(len(S),k)):
if S[i] != '1':
print(S[i])
break
else:
print(1) |
p03282 | s428096041 | Accepted | s=input()
k=int(input())
tmp=len(s)
for i in range(len(s)):
if s[i]!='1':
tmp=i
num=s[i]
break
if k>tmp:
print(num)
else:
print('1') |
p03282 | s405536382 | Accepted | # 2^5000000000000000 > 10^135
S = list(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 | s656823026 | Accepted | s = input()
k = int(input())
c1 = 0
num = ""
for c in s:
if c == "1":
c1 += 1
else:
num = c
break
if k <= c1:
print("1")
else:
print(num)
|
p03282 | s205290462 | Accepted | s = input()
k = int(input())
flag = False
for i in range(min(len(s), k)):
if s[i] != '1':
ans = int(s[i])
flag = True
break
if flag == True:
print(ans)
else:
print(1) |
p03282 | s685837669 | Accepted | S = input()
K = int(input())
ans = 1
for i, s in enumerate(S):
if i+1 == K:
ans = s
break
if s == '1':
continue
else:
ans = s
break
print(ans) |
p03282 | s193009891 | Accepted | def main():
s = input()
k = int(input())
ans = 0
tyou = 500000000000000
for v in s:
if v == '1':
ans += 1
else:
ans += tyou ** int(v)
if ans >= k:
print(v)
exit()
if __name__ == '__main__':
main() |
p03282 | s675978953 | Accepted |
if __name__ == '__main__':
S=list(input())
K=int(input())
S=[int(s) for s in S]
for i in range(K):
if S[i]!=1:
print(S[i])
break
else:
if i==K-1:
print(1) |
p03282 | s996600419 | Accepted | S = input()
K = int(input())
ones = 0
inf = None
for c in S:
if c=='1':
ones += 1
else:
inf = c
break
if K <= ones:
print('1')
else:
print(inf) |
p03282 | s236170821 | Accepted | s = input()
k = int(input())
for i in range(k):
if s[i] != "1":
print(s[i])
exit()
print(1)
|
p03282 | s933288931 | Accepted | s = input()
k = int(input())
ok = True
char = '1'
for i in range(k):
if s[i] != '1':
ok = False
char = s[i]
break
if ok:
print(1)
else:
print(char)
|
p03282 | s237918175 | Accepted |
def resolve():
s=input()
K=int(input())
for i in s:
if i!='1':
print(i)
break
else:
if K==1:
print(1)
break
K-=1
if __name__ == "__main__":
resolve() |
p03282 | s057800351 | Accepted | s = input()
k = int(input())
limit = min(100, k)
ans = 1
for i in range(limit):
if s[i] != '1':
ans = s[i]
break
print(ans) |
p03282 | s034071448 | Accepted | s = input()
k = int(input())
if k == 1 or len(s) == 1:
ans = list(s)[0]
else:
ans = None
for i, j in enumerate(list(s)):
if i < k-1:
if j != '1':
ans = j
break
elif i == k-1:
ans = j
break
else:
continue
print(ans) |
p03282 | s536925888 | 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 | s201315408 | Accepted | s = str(input())
k = int(input())
res = 1
idx = 0
for i in range(len(s)):
if s[i] != "1":
res = s[i]
idx = i + 1
break
if k < idx:
print(1)
else:
print(res)
|
p03282 | s842812232 | Accepted | S = input()
K = int(input())
for i, s in enumerate(S):
if s != '1':
print(s)
break
if i + 1 == K:
print('1')
break
|
p03282 | s458840022 | Accepted | s = input()
k = int(input())
ans = '1'
for i in range(k):
if s[i] != '1':
ans = s[i]
break
print(ans) |
p03282 | s326681182 | Accepted | s =input()
n = len(s)
k = int(input())
for i in range(k):
if s[i] == '1':
continue
else:
print(int(s[i]))
break
else:
print(1)
|
p03282 | s600967226 | Accepted | S = list(str(input()))
K = int(input())
ind = 0
for s in S:
i = int(s)
if i == 1:
num = pow(i, 5000000000000000)
if num + ind >= K:
print(i)
break
else:
ind += num
else:
print(i)
break |
p03282 | s564540891 | Accepted | s = input()
k = int(input())
cnt = 0
for c in s:
if c == '1':
cnt += 1
else:
print(c)
break
if cnt >= k:
print(c)
break
|
p03282 | s165810271 | Accepted | #from statistics import median
#import collections
#aa = collections.Counter(a) # list to list
#from itertools import combinations # (string,3) 3回
mod = 10**9 + 7
def readInts():
return list(map(int,input().split()))
def main():
s = input()
k = int(input())
ichi = 0
for i in range(len(s)):
if s[i] == '1':
ichi += 1
else:
break
if ichi >= k:
print(1)
else:
print(s[ichi])
if __name__ == '__main__':
main()
|
p03282 | s429218754 | Accepted | S = str(input())
K = int(input())
if len(S) == 1:
print(S[0])
exit(0)
i = 0
while S[i] == '1' and i <= len(S)-2:
if K <= i + 1:
print(S[i])
exit(0)
i += 1
print(S[i]) |
p03282 | s723496702 | Accepted | s = input()
k = int(input())
ans = '1'
if s.count('1') == len(s) or k == 1 and s[k-1] == '1':
print(1)
else:
for i in range(k):
if s[i] != '1':
ans = s[i]
break
print(ans)
|
p03282 | s800288063 | Accepted | S = input()
K = int(input())
one = 0
for char in S:
if char == "1":
one += 1
else:
break
if K <= one:
print(1)
elif one > 0:
print(S[one])
else:
print(S[0])
|
p03282 | s871878221 | Accepted | S = input()
K = int(input())
n = 0
if K <= len(S) and all([s == '1' for s in S[:K]]):
print('1')
else:
for s in S:
if s != '1':
print(s)
exit()
|
p03282 | s377360762 | Accepted | s=input()
k=int(input())
for i in range(len(s)):
if s[i]=="1":
k-=1
else:
k-=int(s[i])*(5*10**18)
if k<=0:
print(s[i])
exit() |
p03282 | s573771480 | Accepted | S = input()
K = int(input())
output = ''
if len(S) <= K:
for letter in S:
if letter != '1':
output = letter
break
else :
for i in range(K):
if S[i] != '1':
output = S[i]
break
if output:
print(output)
else :
print('1') |
p03282 | s890155609 | Accepted | S = input()
K = int(input())
idx = min(K, len(S))
for s in S[:idx]:
if s != "1":
print(s)
break
else:
print(1) |
p03282 | s078284393 | Accepted | s=input()
for i in range(int(input())):
if s[i]!='1': print(s[i]);break
else:
print(1) |
p03282 | s226292528 | Accepted | 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
if (not cnt):
print(1)
else:
print(ans)
|
p03282 | s859184550 | Accepted | import sys
def input(): return sys.stdin.readline().rstrip()
def main():
s=input()
k=int(input())
for i in range(min(100,k)):
if s[i]!='1':
print(s[i])
break
else:print(1)
if __name__=='__main__':
main() |
p03282 | s740601147 | Accepted | S = input()
K = int(input())
for i in range(min(len(S), K)):
if(S[i] != '1' and S[i] != '0'):
print(int(S[i]))
exit()
print(1) |
p03282 | s819475547 | Accepted | s = list(input())
k = int(input())
for i in range(len(s)):
if s[i] != "1":
break
if k-1 < i:
print("1")
else:
print(s[i]) |
p03282 | s227995451 | Accepted | def main(s: str, k: int):
for i in range(k):
if s[i] != "1":
print(s[i])
return
print(1)
if __name__ == "__main__":
s = input()
k = int(input())
main(s, k)
|
p03282 | s922011509 | Accepted | import sys
s = input()
k = int(input())
for n in s[:k]:
if int(n) > 1:
print(n)
sys.exit()
print(1) |
p03282 | s015287894 | Accepted | def main():
s = input()
k = int(input())
m = 0
ans = ""
for i in range(len(s)):
if s[i] != "1":
m = i+1
ans = s[i]
break
if k < m:
print(1)
elif m == 0:
print(1)
else:
print(int(ans))
if __name__ == "__main__":
main() |
p03282 | s527309512 | Accepted | s=input()
k=int(input())
for i in range(k):
if not s[i]=='1':
print(s[i])
break
else:
print(s[k-1]) |
p03282 | s043776112 | 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 | s633633704 | Accepted | s = input()
k = int(input())
for i in range(len(s)):
if s[i] == "1":
if i+1 == k:
print(1)
break
else:
print(s[i])
break |
p03282 | s515371359 | Accepted | import sys, math
lines = [s.rstrip("\n") for s in sys.stdin.readlines()]
s = lines.pop(0)
k, = [int(num) for num in lines.pop(0).split(" ")]
days = 5000 * (10 ** 12)
for n in s:
log_k = math.log10(k)
n = int(n)
log_n_days = math.log10(n) * days
if log_k > log_n_days:
k -= n ** days
else:
break
print(n)
|
p03282 | s564483352 | Accepted |
import collections
def solve():
S = list(input())
K = int(input())
for i in range(K):
if S[i] != "1":
print(S[i])
break
else:
print(1)
if __name__ == "__main__":
solve()
|
p03282 | s015898455 | Accepted | S = input()
K = int(input())
lc1 = -1
while lc1 + 1 < len(S) and S[lc1 + 1] == '1':
lc1 += 1
print("1" if lc1 + 1 >= K else S[lc1 + 1])
|
p03282 | s276731143 | Accepted | s=input()
k=int(input())
for i in range(k):
if s[i]!="1":
print(s[i])
break
else:
print("1") |
p03282 | s765591527 | Accepted | a = input()
k = int(input())
count = 1
for i in a:
if i != "1":
break
count += 1
if k >= count:
print(a[count-1])
else:
print("1") |
p03282 | s937492919 | Accepted | s = str(input())
k = int(input())
i, count = 0, 0
while (i < len(s)):
if int(s[i]) == 1:
if (count >= k - 1):
print('1')
break
count += 1
else:
print(s[i])
break
i += 1 |
p03282 | s575202858 | Accepted | s = input()
k = int(input())
for i, v in enumerate(s):
if i == k-1:
print(v)
exit()
elif v != "1":
print(v)
exit() |
p03282 | s959901892 | Accepted | S=input()
K=int(input())
for i in range(K):
if S[i]!='1':
break;
print(S[i]) |
p03282 | s576194700 | Accepted | S = input()
K = int(input())
for i in range(K):
c = S[i]
if c != '1':
print(c)
break
else:
print(1)
|
p03282 | s186145776 | Accepted | s = input()
k = int(input())
i = 0
while True:
if s[i] == '1':
if k <= i+1:
print('1')
break
else:
i += 1
else:
print(s[i])
break |
p03282 | s521194188 | Accepted | s = str(input())
k = int(input())
if k <= len(s) and s[:k] == '1' * k:
ans = 1
else:
ans = s.replace('1', '')[0]
print(ans) |
p03282 | s917805436 | Accepted | 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")
break
|
p03282 | s090010363 | Accepted | s = list(input())
k = int(input())
for i in range(min(k,len(s))):
if s[i] != '1':
print(s[i])
exit(0)
print(1) |
p03282 | s748996936 | Accepted | S=str(input())
K=int(input())
first_number=1
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 | s562650633 | Accepted | s = input()
k = int(input())
for i in range(len(s)):
if s[i] == "1":
k -= 1
else:
k-=10**19
if k <= 0:
print(s[i])
break |
p03282 | s804474408 | Accepted | S = input()
K = int(input())
ans = '1'
k = 0
for s in S:
if s == '1':
k += 1
if k >= K:
ans = '1'
break
else:
ans = s
break
print(ans)
|
p03282 | s823680626 | Accepted | s = list(str(input()))
s = list(map(int, s))
k = int(input())
flag = True
for i in range(min(len(s),k)):
if s[i] != 1:
flag = False
else:
pass
if flag:
print(1)
else:
for i in range(len(s)):
if s[i] != 1:
print(s[i])
break |
p03282 | s114496920 | Accepted | import sys
s = str(input())
n = int(input())
i = 0
while True:
if int(s[i]) == 1:
if (n-1) == i:
print("1")
sys.exit()
else:
i += 1
else:
print(s[i])
sys.exit()
|
p03282 | s216457408 | Accepted | s = input()
k = int(input())
f = True
for si in s[:k]:
if si != "1":
print(si)
f = False
break
if f: print("1")
|
p03282 | s435292963 | Accepted | s = input()
k = int(input())
if s[0] != "1":
print(s[0])
exit()
else:
cnt = 0
not_1 = 0
for i in range(len(s)):
if s[i] == "1":
cnt += 1
else:
not_1 = i
break
if cnt >= k:
print(1)
exit()
else:
print(s[not_1]) |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.