QOJ.ac

QOJ

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#659868#7897. Largest DigitfosovAC ✓1ms3712kbC++14704b2024-10-19 22:48:192024-10-19 22:48:19

Judging History

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

  • [2024-10-19 22:48:19]
  • 评测
  • 测评结果:AC
  • 用时:1ms
  • 内存:3712kb
  • [2024-10-19 22:48:19]
  • 提交

answer

#include "bits/stdc++.h"
using namespace std;

#define ll long long
#define MOD 998244353
#define pii pair<int, int>

int cnt(int x) {
    return x ? max(x % 10, cnt(x / 10)) : 0;
}

int main() {
#ifdef TEST
    freopen("zz.in", "r+", stdin);
#endif
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);

    int t; cin >> t;
    while (t --) {
        int a, b, c, d; cin >> a >> b >> c >> d;
        a += c, b += d;
        
        if (b - a + 1 >= 10) {
            cout << 9 << '\n';
        } else {
            int res = 0;
            for (int i = a; i <= b; ++ i) res = max(res, cnt(i));
            cout << res << '\n';
        }
    }

    return 0;
}

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

詳細信息

Test #1:

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

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

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