{"problem":{"name":"Three Integers","description":{"content":"Three non-negative integers $A$, $B$, and $C$ are written on a blackboard. You can perform the following two operations any number of times in any order. *   Subtract $1$ from two of the written inte","description_type":"Markdown"},"platform":"AtCoder","limit":{"time_limit":2000,"memory_limit":262144},"difficulty":"None","is_remote":true,"is_sync":true,"sync_url":null,"sign":"arc143_a"},"statements":[{"statement_type":"Markdown","content":"Three non-negative integers $A$, $B$, and $C$ are written on a blackboard. You can perform the following two operations any number of times in any order.\n\n*   Subtract $1$ from two of the written integers of your choice.\n*   Subtract $1$ from all of the written integers.\n\nYour objective is to make all the numbers on the blackboard $0$. Determine whether it is achievable. If it is, find the minimum number of times you need to perform an operation to achieve it.\n\n## Constraints\n\n*   $0 \\leq A, B, C \\leq 10^{18}$\n\n## Input\n\nInput is given from Standard Input in the following format:\n\n$A$ $B$ $C$\n\n[samples]","is_translate":false,"language":"English"}],"meta":{"iden":"arc143_a","tags":[],"sample_group":[["2 2 3","3\n\nHere is one way to make all the numbers $0$.\n\n*   Subtract $1$ from $A$ and $C$. Now the numbers are $1$, $2$, $2$.\n*   Subtract $1$ from $B$ and $C$. Now the numbers are $1$, $1$, $1$.\n*   Subtract $1$ from all the numbers. Now the numbers are $0$, $0$, $0$."],["0 0 1","\\-1"],["0 0 0","0"]],"created_at":"2026-03-03 11:01:14"}}