1 条题解

  • 1
    @ 2025-4-23 22:59:46
    #include <bits/stdc++.h>
    using namespace std;
    #define ls u << 1
    #define rs u << 1 | 1
    #define LL long long
    #define int long long
    #define PII pair <int, int>
    #define fi first
    #define se second
    #define pub push_back
    #define pob pop_back
    #define puf push_front
    #define pof pop_front
    #define lb lower_bound
    #define ub upper_bound
    #define i128 __int128
    #define pcnt(x) __builtin_popcount(x)
    #define mem(a,goal) memset(a, (goal), sizeof(a))
    #define rep(x,start,end) for(int x = (start) - ((start) > (end)); x != (end) - ((start) > (end)); ((start) < (end) ? x ++ : x --))
    #define aLL(x) (x).begin(), (x).end()
    #define sz(x) (int)(x).size()
    const int INF = 998244353;
    const int mod = 1e9 + 7;
    const int N = 100010;
    int a, b, c, k;
    void solve()
    {
        int A, B, C;
        A = a, B = b, C = c;
        while(k --)
        {
            a = (C + B) / 2;
            b = (A + C) / 2;
            c = (A + B) / 2;
            A = a, B = b, C = c;
            if(a == b && b == c) break;
        }
        cout << a << ' ' << b << ' ' << c << '\n';
    }
    signed main()
    {
        int t = 1;
        cin >> t;
        while (t --)
        {
            cin >> a >> b >> c >> k;
            solve();
        }
        return 0;
    }
    
    • 1

    信息

    ID
    5561
    时间
    3000ms
    内存
    256MiB
    难度
    10
    标签
    递交数
    1
    已通过
    1
    上传者