QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#630483 | #5117. Find Maximum | Diverbee# | WA | 4ms | 3604kb | C++14 | 1.3kb | 2024-10-11 18:47:22 | 2024-10-11 18:47:23 |
Judging History
answer
#include "bits/stdc++.h"
using namespace std;
#define int long long
int get(int i){
if(i==0){
return 1;
}
if(i%3==0)return get(i/3)+1;
return get(i-1)+1;
}
int f(int x){
return get(x);
}
int nt(int x){
int mi = 1;
// if(x<3)return 0;
while (x%3==2){
x/=3;
mi*=3;
}
x/=mi;
x*=mi;
x--;
return x;
}
void work(){
int l,r;
cin>>l>>r;
int ans =0;
while(r>=l){
ans = max(ans,f(r));
r = nt(r);
}
cout<<ans<<'\n';
}
signed main(){
int q;cin>>q;
while(q--)work();
// cout<<f(0);
//// cout<<nt(9+6);
//// for(int i = 1; i<=10;++i){
//// cout<<i<<':'<<f(i)<<' ';
//// }
return 0;
}
//#include "bits/stdc++.h"
//using namespace std;
//const int N = 1e4+10;
//
//int f[N];
//
//int get(int i){
// if(f[i])return f[i];
// if(i==0){
// f[i]=1;
// return f[i];
// }
//
// if(i%3==0)return f[i]=get(i/3)+1;
// return f[i]=get(i-1)+1;
//}
//
//int main(){
// int n = 100;
// for(int i = n;i>=0;i--){
// get(i);
// }
//
// for(int i = 0; i <= n;++i){
// cout<<i<<':'<<f[i]<<' ';
// if(i%10==0)cout<<'\n';
// }
//}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 0ms
memory: 3604kb
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: 4ms
memory: 3560kb
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 7 7 8 8 8 7 7 7 8 8 8 9 9 9 7 7 7 8 8 8 9 9 9 8 8 8 9 9 9 10 10 10 9 9 9 10 10 10 11 11 11 8 8 8 9 9 9 10 10 10 9 9 9 10 10 10 11 11 11 10 10 10 11 11 11 12 12 12 9 9 9 9 9 9 10 10 10 9 9 9 10 10 10 11 11 11 3 3 4 5 5 5 6 6 6 6 6 6 7 7 7 8 8 8 7 7 7 8 8 8 9 9 9 7 7 7 8 8 ...
result:
wrong answer 20th numbers differ - expected: '8', found: '7'