QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#199086 | #5117. Find Maximum | yyc4591 | WA | 1ms | 3676kb | C++14 | 805b | 2023-10-03 20:55:52 | 2023-10-03 20:55:53 |
Judging History
answer
#include <bits/stdc++.h>
using namespace std;
#define int long long
int f(int x)
{
if(x == 0)
return 1;
else if(x % 3 == 0)
return f(x / 3) + 1;
else
return f(x - 1) + 1;
}
signed main()
{
ios::sync_with_stdio(0);
cin.tie(0), cout.tie(0);
int T;
cin >> T;
while(T--)
{
int l, r;
cin >> l >> r;
int tr = log2(r) / log2(3);
bool ok = 0;
int ans = 1;
for(int i = tr; i >= 1; i--)
{
if(ok)
break;
int x = pow(3, i);
// cout << x << "&&&\n";
for(int j = r / x; j > 0 ; j--) {
if(j * x > r)
break;
else if(j * x >= l && j * x <= r) {
ans = j * x - 1;
ok = 1;
break;
}
}
}
// cout << ans << "***\n";
cout << max(f(ans), f(r)) << endl;
}
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 1ms
memory: 3676kb
input:
10 1 2 1 3 1 4 1 5 2 3 2 4 2 5 3 4 3 5 4 5
output:
3 3 4 5 3 4 5 4 5 5
result:
ok 10 numbers
Test #2:
score: -100
Wrong Answer
time: 0ms
memory: 3668kb
input:
5050 1 1 1 2 1 3 1 4 1 5 1 6 1 7 1 8 1 9 1 10 1 11 1 12 1 13 1 14 1 15 1 16 1 17 1 18 1 19 1 20 1 21 1 22 1 23 1 24 1 25 1 26 1 27 1 28 1 29 1 30 1 31 1 32 1 33 1 34 1 35 1 36 1 37 1 38 1 39 1 40 1 41 1 42 1 43 1 44 1 45 1 46 1 47 1 48 1 49 1 50 1 51 1 52 1 53 1 54 1 55 1 56 1 57 1 58 1 59 1 60 1 61...
output:
2 3 3 4 5 5 5 6 6 6 6 6 6 7 6 7 8 8 8 8 8 8 8 8 8 9 9 9 9 9 9 9 9 9 9 9 9 9 9 9 9 9 9 10 9 9 9 9 9 10 9 10 11 11 11 11 11 11 11 11 11 11 11 11 11 11 11 11 11 11 11 11 11 11 11 11 11 11 11 12 12 12 12 12 12 12 12 12 12 12 12 12 12 12 12 12 12 12 12 12 3 3 4 5 5 5 6 6 6 6 6 6 7 6 7 8 8 8 8 8 8 8 8 8 9...
result:
wrong answer 15th numbers differ - expected: '7', found: '6'