QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#741388#7897. Largest DigitUfowoqqqoAC ✓5ms3760kbC++14763b2024-11-13 14:15:302024-11-13 14:15:31

Judging History

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

  • [2024-11-13 14:15:31]
  • 评测
  • 测评结果:AC
  • 用时:5ms
  • 内存:3760kb
  • [2024-11-13 14:15:30]
  • 提交

answer

#include<bits/stdc++.h>
using namespace std;
int f(int x)
{
    int res=0;
    while(x)
    {
        res=max(res,x%10);
        x/=10;
    }
    return res;
}
int main()
{
    int t;
    cin>>t;
    while(t--)
    {
        int la,ra,lb,rb;
        cin>>la>>ra>>lb>>rb;
        int res=0;
        vector<int>p,q;
        for(int i=la;i<=la+10&&i<=ra;i++)
            p.push_back(i);
        for(int i=ra;i>=ra-10&&i>=la;i--)
            p.push_back(i);
        for(int i=lb;i<=lb+10&&i<=rb;i++)
            q.push_back(i);
        for(int i=rb;i>=rb-10&&i>=lb;i--)
            q.push_back(i);
        for(auto &x:p)
            for(auto &y:q)
                res=max(res,f(x+y));
        cout<<res<<endl;
    }
    return 0;
}

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

Details

Tip: Click on the bar to expand more detailed information

Test #1:

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

input:

2
178 182 83 85
2 5 3 6

output:

7
9

result:

ok 2 lines

Test #2:

score: 0
Accepted
time: 5ms
memory: 3588kb

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