QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#692883#7897. Largest Digittest_algth#AC ✓1ms3640kbC++14674b2024-10-31 15:09:552024-10-31 15:10:17

Judging History

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

  • [2024-10-31 15:10:17]
  • 评测
  • 测评结果:AC
  • 用时:1ms
  • 内存:3640kb
  • [2024-10-31 15:09:55]
  • 提交

answer

#include <bits/stdc++.h>

inline int calc(long long x) {
  int res = 0;
  while (x) {
    res = std::max(res, int(x % 10));
    x /= 10;
  }
  return res;
}

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

  int testCase = 1;
  std::cin >> testCase;
  while (testCase--) {
    int l, r, x, y;
    std::cin >> l >> r >> x >> y;
    long long min = l + x, max = r + y;
    if (max - min + 1 >= 10) { std::cout << "9\n"; }
    else {
      int ans = 0;
      for (long long i = min; i <= max; ++i)
        ans = std::max(ans, calc(i));
      std::cout << ans << '\n';
    }
  }

  return 0;
}

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

Details

Tip: Click on the bar to expand more detailed information

Test #1:

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

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

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