Go: package main

import "fmt"

func main() {
	var w, n int
	fmt.Scan(&w)
	numbers := make([]int, w)

	fmt.Scan(&n)

	intersect := make([][2]int, n)

	for i := 0; i < n; i++ {
		var x, y int
		fmt.Scanf("%d,%d", &x, &y)
		intersect[i] = [2]int{x, y}
	}

	for i := 0; i < w; i++ {
		numbers[i] = i + 1
	}

	for _, v := range intersect {
		swap(numbers, v[0], v[1])
	}

	for _, v := range numbers {
		fmt.Println(v)
	}
}

func swap(arr []int, x, y int) {
	tmp := arr[x-1]
	arr[x-1] = arr[y-1]
	arr[y-1] = tmp
}

C++: #include<stdio.h>

int main()
{
	int StrLen, LinkNum;
	int EndNum[50] = {0};
	int link[50][2];
	scanf("%d %d", &StrLen, &LinkNum);
	for (int i = 0; i < LinkNum; i++)
		scanf("%d,%d", &link[i][0], &link[i][1]);
	for (int i = 1; i <= StrLen; i++)
	{
		int posi = i;
		for (int j = 0; j < LinkNum; j++)
		{			
			if (link[j][0] == posi)
				posi = link[j][1];
			else if (link[j][1] == posi)
				posi = link[j][0];				
		}
		EndNum[posi-1] = i;
	}
	for (int i = 0; i < StrLen; i++)
		printf("%d\n", EndNum[i]);
	return 0;
}

C++: #include <bits/stdc++.h>

using namespace std;

using ll = long long;

int main(void) {
    int n, q; 
    scanf("%d\n%d", &n, &q);
    vector<int> arr(n);
    iota(arr.begin(), arr.end(), 1);
    while (q--) {
        int l, r;
        scanf("%d,%d", &l, &r);
        --l, --r;
        swap(arr[l], arr[r]);
    }
    for (int i = 0; i < n; i++) 
        printf("%d\n", arr[i]);
    return 0;
}

C++: #include<iostream>
using namespace std;

int main()
{
  int map[30][32];
  int x,y;
  int w,n;
  int tmp;

  cin >> w;
  cin >> n;
  for(int i=0;i<w;i++){
    for(int j=0;j<=n;j++)map[i][j] = i;
  }

  for(int i=1;i<=n;i++){
    scanf("%d,%d ",&x,&y);
    map[x-1][i] = y-1;
    map[y-1][i] = x-1;
  }

  for(int i=0;i<w;i++){
    tmp=i;
    for(int j=1;j<=n;j++)tmp = map[tmp][j];
    map[tmp][n+1] = i;
  }

  for(int i=0;i<w;i++)cout << map[i][n+1]+1 << endl;

  return 0;
}

C++: #include <bits/stdc++.h>
using namespace std;

int main() {
  int w, n;
  vector<int> l;
  cin >> w; cin >> n;
  for (int i = 0; i < w; i++) l.push_back(i + 1);
  for (int i = 0; i < n; i++) {
    int a, b; char comma;
    cin >> a >> comma >> b; a--; b--;
    int buf = l[a]; l[a] = l[b]; l[b] = buf;
  }
  for (int i = 0; i < w; i++) cout << l[i] << endl;
  return 0;
}

C++: #include<iostream>
#include<stdio.h>
using namespace std;

int main(){
	int ary[31];
	int w, n, a, b;
	for(int i=0; i < 31; i++){
		ary[i] = i;
	}
	cin >> w;
	cin >> n;
	for(int i=0; i < n; i++){
		scanf("%d,%d", &a, &b);

		swap(ary[a], ary[b]);
	}
	for(int i=1; i <= w; i++){
		cout << ary[i] << endl;
	}

}

C++: #include <iostream>
#include <set>
#include <cmath>
#include <cstdio>

using namespace std;
void lots(int len,int a,int b,int array[]){
    int buffer[5];
    for(int i = 0;i < len; i++){
        if(i == a-1){
            buffer[i] = array[b-1];
        }
        else if(i == b-1){
            buffer[i] = array[a-1];
        }
        else{
            buffer[i] = array[i];
        }
    }
    for(int i = 0; i < len; i++){
        array[i] = buffer[i];
    }

}

int main(){
    int len,duration,a,b;
    cin >> len;
    cin >> duration;
    int array[len];
    for(int i = 0; i < len; i++){
        array[i] = i+1;
    }
    for(int i = 0; i < duration; i++){
        scanf("%d,%d",&a,&b);
        lots(len,a,b,array);
    }
    for(int i = 0; i < len; i++){
        cout << array[i] << endl;
    }
}

C++: #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
const int INF = 1000000000;
#define REP(i,s,n) for(int i=(int)(s);i<(int)(n);i++)
#define rep(i,n) REP(i, 0, n)

int main(){
    int w, n;
    cin >> w >> n;
    vector<int> num(w, 0);
    int it = 1;
    for(int& k : num) k = it++;
    rep(i, n){
        int a, b;
        char c;
        cin >> a >> c >> b;
        a--; b--;
        swap(num[a], num[b]);
    }
    for(int k : num)
      cout << k << endl;
    return 0;
}

C++: #include <bits/stdc++.h>

using namespace std;

typedef long long ll;

#define _abs(x)((x) < 0 ? (x) * -1 : (x))

int main()
{
    //freopen("in.txt", "r", stdin);
    //freopen("out.txt", "w", stdout);
    //freopen("debug.txt", "w", stderr);

    //cin.tie(0);
    //ios::sync_with_stdio(false);

    int w, n;
    int a, b;
    char ch;

    scanf("%d", &w);
    scanf("%d", &n);

    vector<int> v(w);

    int i;

    for (i = 1; i <= w; i++) v[i - 1] = i;

    while (n--) {
        scanf("%d%c%d", &a, &ch, &b);

        a--;
        b--;

        swap(v[a], v[b]);
    }

    for (i = 0; i < w; i++) printf("%d\n", v[i]);

    return 0;
}

C++: #include<stdio.h>

int main()
{
	int w,n,a,b,x,y;
	scanf("%d",&w);
	scanf("%d",&n);
	int m[30]={1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,26,27,28,29,30};

	for(x=0;x<n;x++)
	{
		scanf("%d,%d",&a,&b);
		if(m[a-1]<=m[b-1])
		{
			y=m[b-1]-m[a-1];
			m[a-1]+=y;
			m[b-1]-=y;
		}
		else if(m[a-1]>m[b-1])
		{
			y=m[a-1]-m[b-1];
			m[b-1]+=y;
			m[a-1]-=y;
		}
	}

	for(x=0;x<w;x++)
	{
		printf("%d\n",m[x]);
	}
	return 0;
}

C++: #include <iostream>
#include <vector>
using namespace std;
int main() {
  int w, n;
  cin >> w >> n;
  vector<int> vec;
  vec.resize(w);
  for (int i = 0; i < vec.size(); ++i) {
    vec[i] = i + 1;
  }
  int a, b;
  for (int i = 0; i < n; ++i) {
    scanf("%d,%d", a, b);
    a -= 1;
    b -= 1;
    int tmp = vec[a];
    vec[a] = vec[b];
    vec[b] = tmp;
  }
  for (int i = 0; i < vec.size(); ++i) {
    cout << vec[i] << endl;
  }
  return 0;
}

C++: #include <iostream>

using namespace std;

int main(){
	int w, n;
	cin >> w >> n;
	int s[w];

	for(int i=0; i<w; i++){
		s[i] = i+1;
		while(n--){
		int a, b, c;
		cin >> a >> b;

		int tmp = s[a-1];
		s[a-1] = s[b-1];
		s[b-1] = tmp;
	}
	}

	for(int i=0; i<w; i++){
		cout << s[i];
	}
	cout << endl;
}

C++: #include <iostream>
#include <stdlib.h>
#include <stdio.h>
using namespace std;

int main(void){
        int w,n,a,b;
        int tmp;
        cin>>w;
        int amida[30];
        for(int i=0; i<30; i++) {
                amida[i]=i+1;
        }
        cin>>n;
        for(int i=0; i<n; i++) {
                scanf("%d,%d",&a,&b,stdin);
                tmp=amida[a-1];
                amida[a-1]=amida[b-1];
                amida[b-1]=tmp;
        }
        for(int i=0; i<w; i++) {
                cout<<amida[i]<<endl;
        }

}