[BOJ] 1339번 단어수학

#include 
#include 
#include 
#include 

using namespace std;

int main()
{
    int caseNum;
    cin>>caseNum;

    vector s;
    vector c;

    for(int i=0;i<caseNum;i++){
        string temp;
        cin>>temp;
        for(int j=0;j<temp.length();j++){
            c.push_back(temp[j]);
        }
        s.push_back(temp);
    }

    sort(c.begin(),c.end());
    c.erase(unique(c.begin(),c.end()),c.end());

    vector ind;

    for(int i=0;i<c.size();i++){
        ind.push_back(9-i);
    }

    int maxNum = -1;


    do{
        int total = 0;

        for(int i=0;i<s.size();i++){
            string temp = s[i];
            int ja = 1;
            for(int j=temp.length()-1;j>=0;j--){
                //같은 수면
                for(int k=0;k<c.size();k++){
                    if(temp[j] == c[k]){
                        total += ja*ind[k];
                        break;
                    }
                }
                ja = ja*10;
            }
        }
        maxNum = max(maxNum,total);

    }while(prev_permutation(ind.begin(),ind.end()));

    cout<<maxNum<<endl;

    return 0;
}

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

1339번: 단어 수학