QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #39771 | #2944. Transporting Spaghetti | juwkim | AC ✓ | 28ms | 8368kb | Python3 | 563b | 2022-07-13 15:00:39 | 2022-07-13 15:00:42 |
Judging History
answer
g = lambda: [*map(int, input().split())]
A, B, C, D = g()
ans = None
X = (C + B - 1) // B
for b in range(X, X+A):
a, q = divmod(D + b * B, A)
if q == 0:
ans = a, b
break
if ans:
a, b = ans
if a * A < D + C:
print('No solution.')
else:
msg = f'We need {ans[0]} truck'
if a != 1:
msg += 's'
msg += f' and {ans[1]} boat'
if b != 1:
msg += 's.'
else:
msg += '.'
print(msg)
else:
print('No solution.')
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 22ms
memory: 8212kb
input:
31 13 50 28
output:
We need 3 trucks and 5 boats.
result:
ok single line: 'We need 3 trucks and 5 boats.'
Test #2:
score: 0
Accepted
time: 6ms
memory: 8192kb
input:
100 20 30 10
output:
No solution.
result:
ok single line: 'No solution.'
Test #3:
score: 0
Accepted
time: 18ms
memory: 8188kb
input:
1 1 1 100
output:
We need 101 trucks and 1 boat.
result:
ok single line: 'We need 101 trucks and 1 boat.'
Test #4:
score: 0
Accepted
time: 28ms
memory: 8368kb
input:
20 5 5 15
output:
We need 1 truck and 1 boat.
result:
ok single line: 'We need 1 truck and 1 boat.'
Test #5:
score: 0
Accepted
time: 12ms
memory: 8280kb
input:
100 20 100 100
output:
We need 2 trucks and 5 boats.
result:
ok single line: 'We need 2 trucks and 5 boats.'
Test #6:
score: 0
Accepted
time: 16ms
memory: 8212kb
input:
1 1 0 0
output:
We need 0 trucks and 0 boats.
result:
ok single line: 'We need 0 trucks and 0 boats.'
Test #7:
score: 0
Accepted
time: 19ms
memory: 8232kb
input:
1 5 10 50
output:
We need 60 trucks and 2 boats.
result:
ok single line: 'We need 60 trucks and 2 boats.'
Test #8:
score: 0
Accepted
time: 9ms
memory: 8232kb
input:
100 1 100 100
output:
We need 2 trucks and 100 boats.
result:
ok single line: 'We need 2 trucks and 100 boats.'
Test #9:
score: 0
Accepted
time: 16ms
memory: 8284kb
input:
1 1 100 100
output:
We need 200 trucks and 100 boats.
result:
ok single line: 'We need 200 trucks and 100 boats.'
Test #10:
score: 0
Accepted
time: 18ms
memory: 8192kb
input:
1 1 97 100
output:
We need 197 trucks and 97 boats.
result:
ok single line: 'We need 197 trucks and 97 boats.'