QOJ.ac

QOJ

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#442341#7897. Largest DigitRong7AC ✓1ms3708kbC++141.0kb2024-06-15 11:15:052024-06-15 11:15:07

Judging History

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

  • [2024-06-15 11:15:07]
  • 评测
  • 测评结果:AC
  • 用时:1ms
  • 内存:3708kb
  • [2024-06-15 11:15:05]
  • 提交

answer

#include <bits/stdc++.h>
using namespace std;
#define rep(i, x, y) for (int i = (x); i <= (y); i++)
#define per(i, x, y) for (int i = (x); i >= (y); i--) 
// #define int long long
using ll = long long; using ull = unsigned long long;
inline int read() {
    char ch = getchar(); int s = 0, f = 1;
    while (!isdigit(ch)) {if (ch == '-') f = -1; ch = getchar();}
    while (isdigit(ch)) s = (s << 1) + (s << 3) + (ch ^ 48), ch = getchar();
    return s * f;
}
int la, ra, lb, rb;
inline void sol() {
    la = read(), ra = read(), lb = read(), rb = read();
    int a = 0, b = 0;
    if (ra - la >= 9 || rb - lb >= 9) {
        cout << 9 << '\n';
        return ;
    }
    rep (j, la, ra)
        rep (i, lb, rb) {
            int x = i + j;
            while (x) {
                b = max(b, x % 10);
                x /= 10;
            }
        }
    cout << b << '\n';
}
signed main() {
    ios::sync_with_stdio(false), cin.tie(0), cout.tie(0);
    int _ = read(); while (_--) sol();
    return 0;   
}

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

详细

Test #1:

score: 100
Accepted
time: 1ms
memory: 3704kb

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