PCK_pre2009_D.cpp

#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
using Graph = vector<vector<int>>;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define ALL(a) (a).begin(), (a).end()

template <typename T>
void output_2d_arr(vector<T> A)
{
    for (T vec_a : A)
    {
        for (auto a : vec_a)
        {
            cout << a << " ";
        }
        cout << endl;
    }
    cout << endl;
}

template <typename T>
void output_2d_set(set<T> A)
{
    for (T aa : A)
    {
        for (auto a : aa)
        {
            cout << a << " ";
        }
        cout << endl;
    }
    cout << endl;
}

int main()
{
    cout << "===========" << endl;
    int n;
    while (true)
    {
        cin >> n;
        if (n == 0)
            break;
        vector<vector<string>> colors(n, vector<string>(6));
        rep(i, n)
        {
            rep(j, 6)
            {
                cin >> colors[i][j];
            }
        }


        cout << "input:" << endl;
        output_2d_arr(colors);
        cout << "sorted" << endl;
         rep(i, n){
            sort(colors[i].begin(), colors[i].end());
        }
        output_2d_arr(colors);
        cout << "unique:" << endl;
        set<vector<string>> unique_colors(ALL(colors));
        output_2d_set(unique_colors);
        cout << "result:" << endl;
        cout << (n - unique_colors.size()) << endl;
        cout << "----------" << endl;
    }
}