/ SeriousOJ /

Record Detail

Accepted


  
# Status Time Cost Memory Cost
#1 Accepted 2ms 540.0 KiB
#2 Accepted 58ms 940.0 KiB
#3 Accepted 71ms 1.438 MiB

Code

#include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
#define MOD 1000000007
#define test int t;cin>>t;while(t--)
#define pb push_back
#define vi vector<int>
#define vl vector<ll>
#define F first
#define S second
#define yes cout<<"Yes"<<'\n';
#define no cout<<"No"<<'\n';
#define endl "\n"
#define all(v) v.begin(),v.end()
#define print(v) for(auto it:v) cout<<it<<" "; cout<<endl;
#define print2(pr) for(int i=pr.size()-1;i>=0;i--)cout<<pr[i];cout<<endl;
#define srt(v) sort(v.begin(),v.end());
#define rsrt(v) sort(v.rbegin(),v.rend());
#define rvs(v) reverse(v.begin(),v.end());
#define cinv(v) for(auto &it:v)cin>>it;
#define rall(v) v.rbegin(),v.rend()
#define gcd(a,b) __gcd(a,b)
#define lcm(a,b) (a*b)/gcd(a,b)
#define PI 2*acos(0.0)
#define pr pair<int,int>
#define Tasrik ios_base::sync_with_stdio(0);  cin.tie(0); cout.tie(0);

void abrakadabra()
{
    ll n,m,k;
    cin>>n>>m>>k;

    ll a=n/2;
    ll ans=2*a;
    a=m/2;
    ans+=a*2;
    a=k/2;
    ans+=a*2;
    n%=2;
    m%=2;
    k%=2;

    if(n || m || k)
        ans++;


    cout<<ans<<endl;


}

int main ()
{
    Tasrik;
    int cs=1;
    test
    {
//        cout << "Case " <<cs << ": ";
//        cs++;
        abrakadabra();
    }

    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 15:43:23
Judged At
2025-06-13 15:43:23
Judged By
Score
100
Total Time
71ms
Peak Memory
1.438 MiB