[SWEA] 순열1

 

 

[문제]

https://swexpertacademy.com/main/code/problem/problemDetail.do?contestProbId=AXHx23oq0REDFAXR

SW Expert Academy

 

 

 

[소스 코드]

import java.io.*;
import java.util.*;
public class Solution {
	public static void main(String[] args) throws IOException {
		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
		StringTokenizer st;
		int T = Integer.parseInt(br.readLine());
		for(int tc=1;tc<=T;tc++) {
			int n = Integer.parseInt(br.readLine());
			HashSet<Integer> hs = new HashSet<>();
			st = new StringTokenizer(br.readLine());
			for(int i=0;i<n;i++) {
				hs.add(Integer.parseInt(st.nextToken()));
			}
			boolean check = true;
			for(int i=1;i<=n;i++) {
				if(!hs.contains(i)) {
					check = false;
					break;
				}
			}
			if(check) System.out.println("#"+tc+" Yes");
			else System.out.println("#"+tc+" No");
		}
	}
}