import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int N = sc.nextInt();
int M = sc.nextInt();
int temp;
int[] basket = new int[N+1];
for(int a = 1; a <= N; a++)
basket[a] = a;
for(int b = 1; b <= M; b++) {
int i = sc.nextInt();
int j = sc.nextInt();
temp = basket[i];
basket[i] = basket[j];
basket[j] = temp;
}
for(int c = 1; c < basket.length; c++)
System.out.print(basket[c] + " ");
sc.close();
}
}
'Algorithm > Baekjoon' 카테고리의 다른 글
[백준_JAVA] 5086 배수와 약수 (0) | 2023.08.07 |
---|---|
[백준_JAVA] 5597 과제 안 내신 분..? (0) | 2023.08.05 |
[백준_JAVA] 10810 공 넣기 (0) | 2023.08.03 |
[백준_JAVA] 2562 최댓값 (0) | 2023.08.02 |
[백준_JAVA] 10818 최소, 최대 (0) | 2023.07.30 |