QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#588525 | #7897. Largest Digit | Alumin1um# | AC ✓ | 1ms | 3720kb | C++20 | 1.4kb | 2024-09-25 12:48:34 | 2024-09-25 12:48:34 |
Judging History
answer
#include <bits/stdc++.h>
#define pii pair<int, int>
#define pll pair<long long, long long>
#define pdd pair<double, double>
#define vi vector<int>
#define vll vector<long long>
#define vpii vector<pair<int, int>>
#define vpll vector<pair<long long, long long>>
#define vpdd vector<pair<double, double>>
#define mp make_pair
#define fi first
#define se second
#define all(v) v.begin(), v.end()
#define pb push_back
#define endl "\n"
#define vvi vector<vector<int>>
#define vvll vector<vector<long long>>
using namespace std;
using LL = long long;
using ULL = unsigned long long;
const int N = 2e5 + 10, INF = 0x3f3f3f3f, mod = 998244353;
const LL bigINF = ((ULL)(1) << 63) - 1;
const double eps = 1e-6;
void Sol()
{
int l1, r1, l2, r2;
cin >> l1 >> r1 >> l2 >> r2;
if(r1 - l1 >= 10 || r2 - l2 >= 10) {
cout << 9 << endl;
} else {
LL ans = -1;
for (int i = l1; i <= r1; i++)
{
for (int j = l2; j <= r2; j ++ ) {
LL num = i + j;
while(num) {
ans = max(ans, num % 10);
num /= 10;
}
}
}
cout << ans << endl;
}
}
int main()
{
ios::sync_with_stdio(false);
cin.tie(nullptr), cout.tie(nullptr);
int t = 1;
cin >> t;
while (t--)
{
Sol();
}
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: 1ms
memory: 3720kb
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