[알고리즘] 백준 5533 - 유니크 (C++)

[문제 링크] : https://www.acmicpc.net/problem/5533

#include <iostream>
using namespace std;

int Arr[201][5];
int Check[4][101];

int main(){
    int N, idx, cnt = 1;
    cin >> N;
    for(int i=1; i<=N; i++){
        for(int j=1; j<=3; j++){
            cin >> idx;
            Check[j][idx] += 1;
            Arr[i][j] = idx;
        }
    }

    while(cnt < 4){
        for(int i=1; i<=N; i++){
            if(Check[cnt][Arr[i][cnt]] == 1){
                Arr[i][4] += Arr[i][cnt];
            }
        }
        cnt++;
    }

    for(int i=1; i<=N; i++){
        cout << Arr[i][4] << "\n";
    }

    return 0;
}