Submission #20343612
Source Code Expand
S=input()
M=int(input())
d = 0
for l in list(str(S)):
d = max(int(l),d)
def Base_n_to_10(X,n):
out = 0
for i in range(1,len(str(X))+1):
out += int(X[-i])*(n**(i-1))
return out#int out
def is_ok(arg):
# 整数を買えればTrueを返す
return int(Base_n_to_10(S,arg)) <= M
def meguru_bisect(ng, ok):
while (abs(ok - ng) > 1):
mid = (ok + ng) // 2
if is_ok(mid):
ok = mid
else:
ng = mid
return ok
if len(S)==1:
if int(S)<=M:
print(1)
else:
print(0)
exit()
print(max(meguru_bisect(10**30, d)-d,0))
Submission Info
| Submission Time | |
|---|---|
| Task | D - Base n |
| User | H20 |
| Language | PyPy3 (7.3.0) |
| Score | 400 |
| Code Size | 655 Byte |
| Status | AC |
| Exec Time | 92 ms |
| Memory | 67992 KiB |
Judge Result
| Set Name | Sample | All | ||||
|---|---|---|---|---|---|---|
| Score / Max Score | 0 / 0 | 400 / 400 | ||||
| Status |
|
|
| Set Name | Test Cases |
|---|---|
| Sample | sample_01.txt, sample_02.txt, sample_03.txt |
| All | hand_01.txt, hand_02.txt, hand_03.txt, hand_04.txt, one_digit_01.txt, one_digit_02.txt, one_digit_03.txt, one_digit_04.txt, one_digit_05.txt, one_digit_06.txt, one_digit_07.txt, one_digit_08.txt, one_digit_09.txt, one_digit_10.txt, one_digit_11.txt, one_digit_12.txt, one_digit_13.txt, one_digit_14.txt, one_digit_15.txt, one_digit_16.txt, random_01.txt, random_02.txt, random_03.txt, random_04.txt, random_05.txt, random_06.txt, random_07.txt, random_08.txt, random_09.txt, random_10.txt, random_11.txt, random_12.txt, random_13.txt, random_14.txt, random_15.txt, random_16.txt, random_17.txt, random_18.txt, random_19.txt, random_20.txt, random_21.txt, random_22.txt, random_23.txt, random_24.txt, sample_01.txt, sample_02.txt, sample_03.txt |
| Case Name | Status | Exec Time | Memory |
|---|---|---|---|
| hand_01.txt | AC | 92 ms | 67752 KiB |
| hand_02.txt | AC | 56 ms | 62244 KiB |
| hand_03.txt | AC | 63 ms | 67632 KiB |
| hand_04.txt | AC | 52 ms | 61792 KiB |
| one_digit_01.txt | AC | 54 ms | 61668 KiB |
| one_digit_02.txt | AC | 54 ms | 61832 KiB |
| one_digit_03.txt | AC | 52 ms | 61788 KiB |
| one_digit_04.txt | AC | 57 ms | 61736 KiB |
| one_digit_05.txt | AC | 54 ms | 61912 KiB |
| one_digit_06.txt | AC | 56 ms | 61648 KiB |
| one_digit_07.txt | AC | 55 ms | 61932 KiB |
| one_digit_08.txt | AC | 56 ms | 61928 KiB |
| one_digit_09.txt | AC | 49 ms | 61952 KiB |
| one_digit_10.txt | AC | 54 ms | 61892 KiB |
| one_digit_11.txt | AC | 54 ms | 61712 KiB |
| one_digit_12.txt | AC | 53 ms | 61892 KiB |
| one_digit_13.txt | AC | 56 ms | 61648 KiB |
| one_digit_14.txt | AC | 54 ms | 61944 KiB |
| one_digit_15.txt | AC | 48 ms | 61732 KiB |
| one_digit_16.txt | AC | 54 ms | 61916 KiB |
| random_01.txt | AC | 53 ms | 62616 KiB |
| random_02.txt | AC | 55 ms | 62540 KiB |
| random_03.txt | AC | 54 ms | 62500 KiB |
| random_04.txt | AC | 61 ms | 66600 KiB |
| random_05.txt | AC | 62 ms | 66552 KiB |
| random_06.txt | AC | 60 ms | 66540 KiB |
| random_07.txt | AC | 60 ms | 67480 KiB |
| random_08.txt | AC | 62 ms | 67592 KiB |
| random_09.txt | AC | 63 ms | 67624 KiB |
| random_10.txt | AC | 75 ms | 67984 KiB |
| random_11.txt | AC | 70 ms | 67752 KiB |
| random_12.txt | AC | 70 ms | 67620 KiB |
| random_13.txt | AC | 53 ms | 62692 KiB |
| random_14.txt | AC | 58 ms | 62568 KiB |
| random_15.txt | AC | 55 ms | 62492 KiB |
| random_16.txt | AC | 57 ms | 66544 KiB |
| random_17.txt | AC | 59 ms | 66632 KiB |
| random_18.txt | AC | 62 ms | 66508 KiB |
| random_19.txt | AC | 61 ms | 67992 KiB |
| random_20.txt | AC | 57 ms | 67664 KiB |
| random_21.txt | AC | 63 ms | 67648 KiB |
| random_22.txt | AC | 69 ms | 67780 KiB |
| random_23.txt | AC | 70 ms | 67616 KiB |
| random_24.txt | AC | 70 ms | 67588 KiB |
| sample_01.txt | AC | 58 ms | 62040 KiB |
| sample_02.txt | AC | 55 ms | 62648 KiB |
| sample_03.txt | AC | 71 ms | 67784 KiB |