QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #39692 | #2944. Transporting Spaghetti | 2873531385 | WA | 87ms | 3648kb | C++ | 568b | 2022-07-12 20:03:55 | 2022-07-12 20:03:58 |
Judging History
answer
#include <iostream>
#include <set>
#include <queue>
#include <vector>
#include <cstring>
#include <algorithm>
using ll = long long;
std::string s1[2] = {"truck", "trucks"}, s2[2] = {"boat", "boats"};
int main() {
int A, B, C, D;
std::cin>> A >> B >> C >> D;
for (ll i = 0; i<=1e7; ++i) {
if (i*A<C+D) continue;
if ((i*A-D)%B!=0) continue;
std::cout << "We need " << i <<" "<< s1[i>1] << " and "<<(i*A-D)/B <<" "<< s2[(i*A-D)/B>1]<< ".";
return 0;
}
std::cout << "No solution.";
return 0;
}
/*
5 5 5 0 0 5 0 0
2 2 2 1 1 2 1 1
*/
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 3ms
memory: 3572kb
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: 87ms
memory: 3572kb
input:
100 20 30 10
output:
No solution.
result:
ok single line: 'No solution.'
Test #3:
score: 0
Accepted
time: 0ms
memory: 3648kb
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: 0ms
memory: 3628kb
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: 2ms
memory: 3500kb
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: -100
Wrong Answer
time: 2ms
memory: 3436kb
input:
1 1 0 0
output:
We need 0 truck and 0 boat.
result:
wrong answer 1st lines differ - expected: 'We need 0 trucks and 0 boats.', found: 'We need 0 truck and 0 boat.'