Submission #31070161
Source Code Expand
a, b, x = map(int, input().split())
def cost(n):
n2 = n
d = 0
while n2 > 0:
n2 //= 10
d += 1
return a * n + b * d
ok = 0
ng = 10 ** 9 + 1
while ng - ok > 1:
m = (ok + ng) // 2
if cost(m) <= x:
ok = m
else:
ng = m
print(ok)
Submission Info
| Submission Time | |
|---|---|
| Task | C - Buy an Integer |
| User | Pro_ktmr |
| Language | PyPy3 (7.3.0) |
| Score | 300 |
| Code Size | 298 Byte |
| Status | AC |
| Exec Time | 61 ms |
| Memory | 61956 KiB |
Judge Result
| Set Name | sample | All | ||||
|---|---|---|---|---|---|---|
| Score / Max Score | 0 / 0 | 300 / 300 | ||||
| Status |
|
|
| Set Name | Test Cases |
|---|---|
| sample | sample01, sample02, sample03, sample04 |
| All | border01, border02, border03, corner01, max01, max02, max03, min01, min02, rnd01, rnd02, rnd03, sample01, sample02, sample03, sample04 |
| Case Name | Status | Exec Time | Memory |
|---|---|---|---|
| border01 | AC | 61 ms | 61920 KiB |
| border02 | AC | 49 ms | 61892 KiB |
| border03 | AC | 48 ms | 61940 KiB |
| corner01 | AC | 51 ms | 61772 KiB |
| max01 | AC | 48 ms | 61796 KiB |
| max02 | AC | 47 ms | 61808 KiB |
| max03 | AC | 43 ms | 61952 KiB |
| min01 | AC | 47 ms | 61708 KiB |
| min02 | AC | 50 ms | 61940 KiB |
| rnd01 | AC | 49 ms | 61880 KiB |
| rnd02 | AC | 48 ms | 61876 KiB |
| rnd03 | AC | 48 ms | 61956 KiB |
| sample01 | AC | 51 ms | 61916 KiB |
| sample02 | AC | 50 ms | 61640 KiB |
| sample03 | AC | 49 ms | 61908 KiB |
| sample04 | AC | 49 ms | 61636 KiB |