QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#396436#7897. Largest Digitucup-team3294AC ✓0ms3600kbC++14716b2024-04-22 19:18:262024-04-22 19:18:26

Judging History

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

  • [2024-04-22 19:18:26]
  • 评测
  • 测评结果:AC
  • 用时:0ms
  • 内存:3600kb
  • [2024-04-22 19:18:26]
  • 提交

answer

#include <bits/stdc++.h>
using namespace std;
#define int long long
int check(int x,int y)
{
    int res=0;
    int cnt=x+y;
    while(cnt)
    {
        res=max(res,cnt%10);
        cnt/=10;
    }
    return res;
}
void solve()
{
    int l1,r1,l2,r2;
    cin>>l1>>r1>>l2>>r2;
    if(r1-l1>=10)
    {
        cout<<9<<endl;
        return ;
    }
    if(r2-l2>=10)
    {
        cout<<9<<endl;
        return ;
    }
    int ans=0;
    for(int i=l1;i<=r1;i++)
    {
        for(int j=l2;j<=r2;j++)
        {
            ans=max(ans,check(i,j));
        }
    }
    cout<<ans<<endl;

}
signed main()
{
    int T;
    cin>>T;
    while(T--)
    {
        solve();
    }
}

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

Details

Tip: Click on the bar to expand more detailed information

Test #1:

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

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

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