Submission #2382010
Source Code Expand
#include <iostream> #include <algorithm> int main() { int X[3], ans; std::cin >> X[0] >> X[1] >> X[2]; std::sort(X, X + 3); int n0 = (X[2] - X[0]) / 2; int n1 = (X[2] - X[1]) / 2; int diff0 = X[2] - n0 * 2 - X[0]; int diff1 = X[2] - n1 * 2 - X[1]; if (diff0 == diff1) { ans = n0 + n1 + diff0; } else { ans = n0 + n1 + 2; } std::cout << ans << std::endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | C - Same Integers |
User | tomomo |
Language | C++14 (GCC 5.4.1) |
Score | 300 |
Code Size | 416 Byte |
Status | AC |
Exec Time | 1 ms |
Memory | 256 KB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 300 / 300 | ||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | s1.txt, s2.txt, s3.txt |
All | 01.txt, 02.txt, 03.txt, 04.txt, 05.txt, 06.txt, 07.txt, 08.txt, 09.txt, 10.txt, 11.txt, 12.txt, 13.txt, s1.txt, s2.txt, s3.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
01.txt | AC | 1 ms | 256 KB |
02.txt | AC | 1 ms | 256 KB |
03.txt | AC | 1 ms | 256 KB |
04.txt | AC | 1 ms | 256 KB |
05.txt | AC | 1 ms | 256 KB |
06.txt | AC | 1 ms | 256 KB |
07.txt | AC | 1 ms | 256 KB |
08.txt | AC | 1 ms | 256 KB |
09.txt | AC | 1 ms | 256 KB |
10.txt | AC | 1 ms | 256 KB |
11.txt | AC | 1 ms | 256 KB |
12.txt | AC | 1 ms | 256 KB |
13.txt | AC | 1 ms | 256 KB |
s1.txt | AC | 1 ms | 256 KB |
s2.txt | AC | 1 ms | 256 KB |
s3.txt | AC | 1 ms | 256 KB |