QOJ.ac

QOJ

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#315409#7897. Largest Digitucup-team1055#AC ✓0ms3612kbC++201.1kb2024-01-27 13:08:042024-01-27 13:08:04

Judging History

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

  • [2024-01-27 13:08:04]
  • 评测
  • 测评结果:AC
  • 用时:0ms
  • 内存:3612kb
  • [2024-01-27 13:08:04]
  • 提交

answer

#include<bits/stdc++.h>

#define rep(i,s,n) for(int i = int(s); i < int(n); i++)
#define rrep(i,s,n) for(int i = int(n) - 1; i >= int(s); i--)
#define all(v) (v).begin(), (v).end()

using ll = long long;
using ull = unsigned long long;
using ld = long double;

template<class T>
bool chmin(T &a, T b) {
    if(a <= b) return false;
    a = b;
    return true;
}

template<class T>
bool chmax(T &a, T b) {
    if(a >= b) return false;
    a = b;
    return true;
}

using namespace std;

int f(ll x){
    int v = 0;
    while(x > 0){
        chmax(v, (int)(x % 10));
        x /= 10;
    }
    return v;
}

void solve(){
    int l1, r1, l2, r2; cin >> l1 >> r1 >> l2 >>  r2;
    int l = l1 + l2;
    int r = r1 + r2;
    if (r - l >= 20){
        cout << '9' << '\n';
    }else{
        int ans = 0;
        rep(i,l,r+1){
            chmax(ans, f(i));
        }
        cout << ans << '\n';
    }
}

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

    int t; cin >> t;
    while(t--) solve();
}

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

詳細信息

Test #1:

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

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

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