CODEFORCES-Problem/B_Floor_or_Ceil.cpp at main · 10Maruf/CODEFORCES-Problem · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
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
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
/*maruf_bro*/

#include <bits/stdc++.h>
using namespace std;
#define IO                            \
    ios_base::sync_with_stdio(false); \
    cin.tie(NULL);                    \
    cout.tie(NULL)
#define ld long double
#define ll long long
#define vec vector<ll>
#define pb push_back
#define fcin(n)       \
    for (auto &x : n) \
    cin >> x
#define fcout(n)     \
    for (auto x : n) \
    cout << x << " "
#define YES puts("YES")
#define NO puts("NO")
#define endl '\n'
/*
 "The harder the problem, the sweeter the victory. Keep coding!"
*/

int Case = 1;

void solve()
{
    ll x, n, m;
    cin >> x >> n >> m;
    if (x < log2(n))
    {
        cout << 0 << " " << 0 << endl;
    }
    else
    {
        // min
        ll min = 0, max = 0;
        ;
        int t = x;
        for (int i = 1; i <= n; i++)
        {
            t = t / 2;
            if (t == 0)
            {
                break;
            }
        }
        if (t == 0)
        {
            min = 0;
        }
        else
        {
            for (int i = 1; i <= m; i++)
            {
                if (t % 2 == 1)
                {
                    t = t / 2 + 1;
                }
                else
                {
                    t = t / 2;
                }
                if (t == 1)
                {
                    break;
                }
            }
            min = t;
        }

        // max
        t = x;
        for (int i = 1; i <= m; i++)
        {
            if (t % 2 == 1)
            {
                t = t / 2 + 1;
            }
            else
            {
                t = t / 2;
            }
            if (t == 1)
            {
                break;
            }
        }

        for (int i = 1; i <= n; i++)
        {

            t = t / 2;
            if (t == 0)
            {
                break;
            }
        }
        max = t;
        cout << max << " " << min << endl;
    }
}

signed main()
{
    IO;
    int t;
    cin >> t;
    while (t--)
    {
        solve();
    }

    return 0;
}