Accepted
Code
#include <iostream>
#define ll long long
using namespace std;
int main()
{
int t;
cin >> t;
while (t--) {
int n, m, k;
cin >> n >> m >> k;
int maxio = 0;
ll count = 0;
count+=(n/2)*2;
count+=(m/2)*2;
count+=(k/2)*2;
if(n%2!=0 || m%2!=0 || k%2!=0) count++;
cout << count << endl;
}
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:12:03
- Judged At
- 2025-06-13 16:12:03
- Judged By
- Score
- 100
- Total Time
- 207ms
- Peak Memory
- 1.52 MiB