QOJ.ac

QOJ

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#276384#7897. Largest DigityimonAC ✓0ms3576kbC++11595b2023-12-05 20:39:382023-12-05 20:39:38

Judging History

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

  • [2023-12-05 20:39:38]
  • 评测
  • 测评结果:AC
  • 用时:0ms
  • 内存:3576kb
  • [2023-12-05 20:39:38]
  • 提交

answer

#include<iostream>
#include<string>
#include<cstring>
#include<algorithm>
#include<cmath>
using namespace std;
const int N = 1e4 + 10;
int a[N], b[N], c[N];

int main()
{
ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
int t;
cin >> t;
while (t--)
{
long long a, b, c, d;
cin >> a >> b >> c >> d;
long long x = a + c;
long long y = b + d;
if (y - x >= 10)
{
cout << 9 << endl;
}
else
{
int e = 0;
while (x <= y)
{
long long z = x;
while (z > 0)
{
int f = z % 10;
e = max(e, f);
z /= 10;
}
if (z >= 9)break;
x++;
}
cout << e << endl;
}
}

return 0;
}

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

详细

Test #1:

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

input:

2
178 182 83 85
2 5 3 6

output:

7
9

result:

ok 2 lines

Test #2:

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

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