QOJ.ac
QOJ
| ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
|---|---|---|---|---|---|---|---|---|---|
| #39693 | #2944. Transporting Spaghetti | 2873531385 | WA | 3ms | 3588kb | C++ | 570b | 2022-07-12 20:04:52 | 2022-07-12 20:04:54 |
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
*/
详细
Test #1:
score: 0
Wrong Answer
time: 3ms
memory: 3588kb
input:
31 13 50 28
output:
We need 3 truck and 5 boat.
result:
wrong answer 1st lines differ - expected: 'We need 3 trucks and 5 boats.', found: 'We need 3 truck and 5 boat.'