QOJ.ac

QOJ

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#795482#7897. Largest Digitimwinter#AC ✓1ms3748kbC++20844b2024-11-30 20:50:462024-11-30 20:50:47

Judging History

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

  • [2024-11-30 20:50:47]
  • 评测
  • 测评结果:AC
  • 用时:1ms
  • 内存:3748kb
  • [2024-11-30 20:50:46]
  • 提交

answer

#include <bits/stdc++.h>

using i64 = long long;

void sol() {
    int la, ra, lb, rb;
    std::cin >> la >> ra >> lb >> rb;

    if (ra - la + 1 >= 10 || rb - lb + 1 >= 10) {
        std::cout << 9 << "\n";
        return;
    }

    auto cal = [](i64 t) {
        int x = 0;
        while (t) {
            int temp = t % 10;
            t /= 10;
            x = std::max(temp, x);
        }
       return x;
    };

    int ans = 0;

    for (int i = la; i <= ra; i++) {
        for (int j = lb; j <= rb; j++) {
            i64 t = i + j;
            ans = std::max(ans, cal(t));
        }
    }

    std::cout << ans << "\n";
}

int main() {
    std::ios::sync_with_stdio(false);
    std::cin.tie(nullptr);

    int _;
    std::cin >>_;

    while (_--) {
        sol();
    }

    return 0;
}

这程序好像有点Bug,我给组数据试试?

详细

Test #1:

score: 100
Accepted
time: 0ms
memory: 3732kb

input:

2
178 182 83 85
2 5 3 6

output:

7
9

result:

ok 2 lines

Test #2:

score: 0
Accepted
time: 1ms
memory: 3748kb

input:

1000
158260522 877914575 24979445 602436426
1 5 1101111 1101112
2 5 33333 33335
1 5 10111 10111
138996221 797829355 353195922 501899080
212 215 10302 10302
101100 101101 1 2
111 114 1101000 1101001
265804420 569328197 234828607 807497925
1110110 1110112 11100 11103
323 327 23 27
1 1 1 5
316412581 80...

output:

9
7
9
6
9
7
3
5
9
5
9
6
9
9
9
9
9
9
9
9
9
5
9
6
9
9
7
8
9
9
9
9
9
9
3
8
9
7
7
9
9
6
7
9
9
8
9
6
9
9
9
5
9
4
9
5
9
7
8
8
9
9
9
6
9
8
9
5
9
7
9
7
9
9
6
5
9
2
3
6
9
9
8
6
9
9
6
4
9
9
9
9
9
9
8
2
9
4
5
9
9
9
8
6
9
5
7
9
9
9
9
5
9
7
8
5
9
9
9
7
9
9
3
3
9
9
5
7
9
9
6
6
9
7
7
9
9
8
9
9
9
5
9
6
9
7
9
4
9
5
...

result:

ok 1000 lines

Extra Test:

score: 0
Extra Test Passed