Submission #20083662

---

Source Code Expand

#include <iostream>
#include <algorithm>
using namespace std;

int main(){
    int A[3],i,count=0;
    for(i=0;i<3;i++) cin >> A[i];
    sort(A,A+3);
    for(i=0;i<3;i++){
        if(!((A[(i+1)%3]-A[i])%2)){
             if(i==2){
                while(A[2]-A[0]>0){
                    A[0]+=2;
                    count++;
                }
                A[0]+=1;
                A[2]+=1;
                count++;
                while(A[2]-A[1]>0){
                    A[1]+=2;
                    count++;
                }
            }
            else if(i==1){
                while(A[i+1]-A[i]>0){
                    A[i]+=2;
                    count++;
                }
                A[1]+=1;
                A[2]+=1;
                count++;
                while(A[2]-A[0]>0){
                    A[0]+=2;
                    count++;
                }
            }
            else if(i==0){
                while(A[i+1]-A[i]>0){
                    A[i]+=2;
                    count++;
                }
                while(A[2]-A[1]>0){
                    A[0]+=1;
                    A[1]+=1;
                    count++;
                }
            }
        break;
        }
    }
    cout << count << endl;
    return 0;
}

Submission Info

Judge Result