2480번 주사위 세개

단계별로 풀어보기 - 조건문 - 7단계

https://www.acmicpc.net/problem/2480

#include <iostream>

using namespace std;
int main()
{  
    int Arr[3];
    for(int i=0;i<3;i++)
    {        
        cin>>Arr[i];
    }
    
    if((Arr[0]==Arr[1])&&(Arr[1]==Arr[2]))
    {
        cout<<10000+Arr[0]*1000;
    }
    
    else if((Arr[0]==Arr[1])||(Arr[0]==Arr[2]))
    {
        cout<<1000+Arr[0]*100;
    }
    
    else if((Arr[1]==Arr[2]))
    {
        cout<<1000+Arr[1]*100;
    }
    
    else
    {       
        cout<<max(max(Arr[0],Arr[1]),Arr[2])*100;
    }
    

    return 0;

}