QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#227763 | #2944. Transporting Spaghetti | Thallium54# | WA | 0ms | 3624kb | C++20 | 880b | 2023-10-27 22:46:26 | 2023-10-27 22:46:26 |
Judging History
answer
#include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef long double ld;
#define f first
#define s second
#define pb push_back
#define pii pair<int, int>
const int N = 2e5 + 100;
const int inf = 1e9;
const ll mod = 998244353;
int main()
{
int a, b, c, d;
cin >> a >> b >> c >> d;
for (int i = 1; i <= 1000; i++) {
int tot = i * a;
if (tot >= c + d) {
int rem = tot - d;
if (rem % b == 0) {
cout << "We need " << i << " truck";
if (i > 1) cout << "s";
cout << " and " << rem / b << " boat";
if (rem / b > 1) cout << "s.";
else cout << ".";
cout << "\n";
return 0;
}
}
}
cout << "No solution.\n";
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 0ms
memory: 3624kb
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: 0ms
memory: 3532kb
input:
100 20 30 10
output:
No solution.
result:
ok single line: 'No solution.'
Test #3:
score: 0
Accepted
time: 0ms
memory: 3604kb
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: 3600kb
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: 0ms
memory: 3608kb
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: 0ms
memory: 3556kb
input:
1 1 0 0
output:
We need 1 truck and 1 boat.
result:
wrong answer 1st lines differ - expected: 'We need 0 trucks and 0 boats.', found: 'We need 1 truck and 1 boat.'