C :

#include<stdio.h>
int main() {
 
  int t;
  scanf("%d", &t);
  while(t--) {
    int i, d, a[105] = {0};
    for(i = 0; i < 6; ++i) scanf("%d", &d), a[d]++;
    int f = 0;
    for(i = 0; i < 101; ++i ) if( a[i] ) if( f == 0 ) printf("%d", i), f = 1; else printf(" %d", i);
      printf("\n");
  }
  return 0;
}

C++ :

#include <cstdio>
#include <cstring>
using namespace std ;
int main() {
    int T ; scanf("%d" ,&T ) ;
    while( T -- ) {
        bool num[101] ;
        memset( num, false, sizeof(num)) ;
        for( int i = 0; i < 6; i ++ ) {
            int a ; scanf("%d", &a) ;
            num[a] = true ;
        }
        bool first = true ;
        for( int i = 0 ; i < 101; i ++ ) {
            if( num[i] ) {
                if( first ) {
                    printf("%d" , i ) ;
                    first = false ;
                }
                else {
                    printf(" %d" , i ) ;
                }
            }
        }
        printf("\n") ;
    }
    return 0 ;
}

Java :

import java.util.Arrays;
import java.util.Scanner;

public class Main {

	public static void main(String[] args) {
		// TODO Auto-generated method stub
		Scanner sc = new Scanner(System.in);
		while (sc.hasNext()) {
			int n = sc.nextInt();
			while (n-- != 0) {
				int[] visit = new int[101];
				int[] arr = new int[6];
				int cur = 0;
				int count = 0;
				for (int i = 0; i < 6; i++) {
					int num = sc.nextInt();
					if (visit[num] == 0) {
						arr[cur++] = num;
						visit[num] = 1;
						count++;
					}
				}
				Arrays.sort(arr);
				for (int i = 0; i < arr.length; i++) {
					if (arr[i] != 0) {
						if (i != arr.length - 1)
							System.out.print(arr[i] + " ");
						else
							System.out.println(arr[i]);
					}
				}
			}
		}
	}

}