QOJ.ac

QOJ

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#760854#7897. Largest DigitLoxilanteAC ✓2ms3652kbC++201.0kb2024-11-18 19:47:092024-11-18 19:47:15

Judging History

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

  • [2024-11-18 19:47:15]
  • 评测
  • 测评结果:AC
  • 用时:2ms
  • 内存:3652kb
  • [2024-11-18 19:47:09]
  • 提交

answer

#define F_C
#include <bits/stdc++.h>
#define rep(i, l, r) for(int i = l; i < r; i++)
#define hrp(i, l, r) for(int i = l; i <= r; i++)
#define rev(i, r, l) for(int i = r; i >= l; i--)
#define int ll
using namespace std;
typedef long long ll;
template<typename tn = int> tn next(void) { tn k; cin>>k; return k; }
#ifndef LOCAL
#define D(...) 0
#endif
int func(int e)
{
    int maxx = 0;
    while(e) maxx = max(maxx, e%10), e /= 10;
    return maxx;
}
signed main(void)
{
    #ifdef LOCAL
//	freopen("C:\\Users\\Loxil\\Desktop\\IN.txt", "r", stdin);
//	freopen("C:\\Users\\Loxil\\Desktop\\OUT.txt", "w", stdout);
    #endif
    
    ios::sync_with_stdio(false);
    cin.tie(0);
    
    int T = next();
    while(T--)
    {
        int l1, r1, l2, r2;
        cin>>l1>>r1>>l2>>r2;
        
        int l0 = l1+l2, r0 = r1+r2;
        if ((r0-l0+1) >= 10) { cout<<9<<endl; continue; }

        int maxx = 0;
        hrp(i, l0, r0) maxx = max(maxx, func(i));
        cout<<maxx<<endl;
    }
    
    return 0;
}
/*

 */

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

詳細信息

Test #1:

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

input:

2
178 182 83 85
2 5 3 6

output:

7
9

result:

ok 2 lines

Test #2:

score: 0
Accepted
time: 2ms
memory: 3580kb

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