Accepted
Code
#include <bits/stdc++.h>
using namespace std;
#define int long long
void iusearchbtw () {
int n, m, k; cin >> n >> m >> k;
int ans = 0;
ans = max(ans, n - n % 2 + m - m % 2 + k);
ans = max(ans, n - n % 2 + m + k - k % 2);
ans = max(ans, n + m - m % 2 + k - k % 2);
cout << ans << endl;
}
signed main () {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int tt = 1;
cin >> tt;
while (tt --> 0) iusearchbtw();
}
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:37:22
- Judged At
- 2025-06-13 15:37:22
- Judged By
- Score
- 100
- Total Time
- 191ms
- Peak Memory
- 1.359 MiB