/ SeriousOJ /

Record Detail

Accepted


  
# Status Time Cost Memory Cost
#1 Accepted 1ms 556.0 KiB
#2 Accepted 33ms 1.105 MiB
#3 Accepted 40ms 1.531 MiB

Code

#include<bits/stdc++.h>
using namespace std;

#define int long long
#define yes cout<<"YES"<<'\n'
#define no cout<<"NO"<<'\n'
#define nl cout<<"\n"

void solve() {
    int n, m, k; cin>>n>>m>>k;

    int mx = max({n,m,k});
    int mn = min({n,m,k});
    int md = (n+m+k) -(mn+mx);

    int ans = mx;
    if(md%2 == 0) ans += md;
    else if(ans%2 == 0) ans += md;
    else ans += md - 1;

    if(mn%2 == 0) ans += mn;
    else if(ans%2 == 0) ans += mn;
    else ans += mn - 1;

    cout<<ans;
    nl;
}

int32_t main()
{
    ios::sync_with_stdio(false);
    cin.tie(NULL);

    int t=1;
    cin>>t;
    while(t--)
    {
        solve();
    }
    return 0;
}

Information

Submit By
Type
Submission
Problem
P1195 B. Palindrome
Contest
Brain Booster #10
Language
C++17 (G++ 13.2.0)
Submit At
2025-06-13 16:26:36
Judged At
2025-06-13 16:26:36
Judged By
Score
100
Total Time
40ms
Peak Memory
1.531 MiB