QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#227765#2944. Transporting SpaghettiThallium54#AC ✓0ms3672kbC++20884b2023-10-27 22:48:372023-10-27 22:48:37

Judging History

你现在查看的是最新测评结果

  • [2023-10-27 22:48:37]
  • 评测
  • 测评结果:AC
  • 用时:0ms
  • 内存:3672kb
  • [2023-10-27 22:48:37]
  • 提交

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 = 0; 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: 3568kb

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: 3628kb

input:

100 20 30 10

output:

No solution.

result:

ok single line: 'No solution.'

Test #3:

score: 0
Accepted
time: 0ms
memory: 3608kb

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: 3596kb

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: 3612kb

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: 0ms
memory: 3644kb

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: 0ms
memory: 3612kb

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: 0ms
memory: 3672kb

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: 0ms
memory: 3604kb

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: 0ms
memory: 3536kb

input:

1 1 97 100

output:

We need 197 trucks and 97 boats.

result:

ok single line: 'We need 197 trucks and 97 boats.'