QOJ.ac

QOJ

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#623898#5117. Find Maximumm107239#WA 0ms3668kbC++20749b2024-10-09 14:20:272024-10-09 14:20:31

Judging History

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

  • [2024-10-09 14:20:31]
  • 评测
  • 测评结果:WA
  • 用时:0ms
  • 内存:3668kb
  • [2024-10-09 14:20:27]
  • 提交

answer

#include <iostream>

using namespace std;
using ll = long long;

static ll floor_log_3(ll x) {
    ll z = 1, r = 0;
    while (z * 3 <= x) {
        z *= 3;
        r++;
    }
    return r;
}

static ll pow_3(ll x) {
    ll r = 1;
    for (ll i = 0; i < x; i++) {
        r *= 3;
    }
    return r;
}

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

    int t;
    cin >> t;
    while (t--) {
        ll l, r;
        cin >> l >> r;
        ll r_log = floor_log_3(r);
        ll m = pow_3(r_log);
        ll ans = r_log + r - m + 2;
        if (m > l && r_log > 0) {
            ans = max(ans, r_log + m - pow_3(r_log - 1));
        }
        cout << ans << endl;
    }

    return 0;
}

详细

Test #1:

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

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
6
7
8
8
8
8
8
8
9
10
11
12
13
14
15
16
17
18
19
20
21
21
21
21
21
21
21
21
21
21
21
21
21
21
21
21
21
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
58
58
58
58
58
58
58
58
58
58
58
58
58
58
58
58
58
58
58
58
3
3
4
5
6
7
8
...

result:

wrong answer 6th numbers differ - expected: '5', found: '6'