Go: package main

import "fmt"

func main() {
	var w, n, a, b, i, te int
	var amida [31]int
	fmt.Scanf("%d", &w)
	fmt.Scanf("%d", &n)
	for i := 1; i <= w; i++ {
		amida[i] = i
	}
	for i := 1; i <= n; i++ {
		fmt.Scanf("%d,%d", &a, &b)
		te = amida[a]
		amida[a] = amida[b]
		amida[b] = te
	}
	for i := i; i <= w; i++ {
		fmt.Printf("%d\n", amida[i])
	}
}

C++: #include <iostream>
#include <fstream>
#include <cstdio>
#include <cmath>
#include <vector>
#include <string>
#include <map>
#include <queue>
#include <algorithm>
#include <functional>

#define REP(i,n) for(int i=0; i<n; i++)
#define FOR(i,a,b) for(int i=a; i<=b; i++)
#define ll long long

using namespace std;


int main(void) {
    int n,w;
    string str;
    cin >> n >> w;
    vector<int> v(n);
    REP(i,n){
        v[i]=i+1;
    }
    REP(i,w){
        cin >> str;
        int a,b;
        a=str[0]-'0';
        b=str[2]-'0';
        REP(k,n){
            REP(l,n){
                if (v[k]==a && v[l]==b){
                    v[k] = b;
                    v[l] = a;
                    goto hoge;
                }
            }
        }
    hoge:;
    }
    vector<pair<int,int> > vp(n);
    REP(i,n){
        vp[i].first=v[i];
        vp[i].second=i+1;
    }
    sort(vp.begin(),vp.end());
    
    REP(i,n) cout << vp[i].second << endl;
    return 0;
}

C++: #include <iostream>

using namespace std;

int main()
{
    int w,n;
    scanf("%d", &w);
    scanf("%d", &n);
    int amida[w + 1];
    for(int i = 1; i <= w; i++) amida[i] = i;
    for(int i = 0; i < n; i++) {
        int a, b;
        scanf("%d,%d", &a, &b);
        swap(amida[a], amida[b]);
    }
    for(int i = 1; i <= w; i++) cout << amida[i] << endl;
    return 0;
}

C++: 
//http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=0011&lang=jp

#include <algorithm>
#include <iostream>
#include <vector>

#include <stdio.h>
#include <stdlib.h>
#include <string.h>

#include <math.h>
#include <iomanip>
#include <sstream>

using namespace std;

//テ」ツδ榲」ツつッテ」ツδュテ・ツョツ堙ァツセツゥ
#define ALL(v) (v).begin(),(v).end()
#define ARRAY_LENGTH(array) (sizeof(array) / sizeof(array[0]))
#define REP(i,a,b) for(int i=(int)(a); i<(int)(b); ++i)
#define rep(i,n) for(int i=0;i<(int)(n);++i)
#define SORT(x) sort(begin(x),end(x))
#define SELECT_SORT(x, n) sort(begin(x),begin(x)+n)
#define SWAP(type, a, b) do {type tmp = a; a = b; b = tmp;} while (0)
#define rep_split(tok,a_str,re) for(char *tok = strtok((char *)a_str.c_str(),re); tok != NULL; tok = strtok(NULL,re))

//テ・ツョツ堙ヲツ閉ー
#define INF 2000000000000
#define MAX 10

//DEBUGテァツ板ィ
#define BAR() cout << "----------------------------" << endl;
#define DUMP(v) (cerr << #v << ": " << v << endl)
#define PRINT(list) cout << "{ "; for(auto nth : list){ cout << nth << " "; } cout << "}" << endl;

vector<int> amida;


int main()
{
	int w=0;
	cin >> w;
	amida.push_back(0);
	REP(i,1,w+1){
		amida.push_back(i);
	}
	
	int n=0;
	cin >> n;
	int a,b=0;
	while(n){
		scanf("%d,%d",&a,&b);
		SWAP(int, amida[a], amida[b]);
		n--;
	}
	
	REP(i,1,w+1){
		cout << amida[i] << endl;
	}
	
}

C++: #include <stdio.h>

int main(void){
  int w=0, n=0;
  int a[30], b[30], c[30];
  int i, j, tmp;

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

  for (i=0; i<n; i++){
    scanf("%d,%d", &a[i], &b[i]);    
  } 

  for (i=0; i<w; i++) {
  	c[i] = i+1;
  }

 /*
  printf("test----------\n");

  for (i=0; i<n; i++){
  	tmp = c[a[i]-1];
    c[a[i]-1] = c[b[i]-1];
    c[b[i]-1] = tmp;
    for (j=0; j<w; j++) {
  	  printf("%d ", c[j]);
    }
    printf("\n");
  } */

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

  return 0;
}

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

using namespace std;
using ll = long long;
using pii = pair<int, int>;

int main() {
  cin.tie(0);
  ios_base::sync_with_stdio(false);
  cout << fixed << setprecision(10);
  
  int w, n;
  cin >> w >> n;

  int p[30];
  iota(p, p + w, 0);
  for (int i = 0; i < n; i++) {
    int a, b;
    char c;
    cin >> a >> c >> b;
    swap(p[a - 1], p[b - 1]);
  }
  for (int i = 0; i < w; i++) {
    cout << p[i] + 1 << endl;
  }

  return 0;
}

C++: #include<iostream>
#include<string.h>
#include<stdlib.h>
using namespace std;
int main()
{
    int A[50];
   string s;
   int w,n;
    A[0]=0;
   while(cin>>w>>n)
   {
        for(int i=1;i<=w;i++)
       {
           A[i]=i;
       }
       while(n--)
       {

       cin>>s;
       int len=s.length();
       int d=s.find(',',0);
       string a=s.substr(0,d);
       string b=s.substr(d+1,len-1);
       int c=atoi(a.c_str());
       int e=atoi(b.c_str());
      // cout<<a<<endl<<b<<endl<<c<<endl<<e<<endl;
         int h= A[c];
         A[c]=A[e];
         A[e]=h;

       }
for(int i=1;i<=w;i++)
      cout<<A[i]<<endl;
   }
}

C++: #include<stdio.h>
int main()
{
  int n,m,i;
  int line[101];
  int a,b;
  scanf("%d",&n);

  for(i = 1;i <= n;i++)line[i] = i;

  scanf("%d",&m);

  for(i = 0;i < m;i++){
    scanf(" %d %d",&a,&b);
    int temp = line[a];
    line[a] = line[b];
    line[b] = temp;
  }
  
  for(i = 1;i <= n;i++)printf("%d ",line[i]);
  printf("\n");
}

C++: #include<iostream>

using namespace std;

typedef struct B{
	int a;
	int b;
}Link;

int main()
{
	int StrLen, LinkNum;
	int EndNum[50] = {0};
	Link link[50];
	cin >> StrLen >> LinkNum;
	for (int i = 0; i < LinkNum; i++)
		scanf("%d,%d", &link[i].a, &link[i].b);
	for (int i = 1; i <= StrLen; i++)
	{
		int posi = i;
		for (int j = 0; j < LinkNum; j++)
		{			
			if (link[j].a == posi)
				posi = link[j].b;
			else if (link[j].b == posi)
				posi = link[j].a;				
		}
		EndNum[posi-1] = i;
	}
	for (int i = 0; i < StrLen; i++)
		cout << EndNum[i] << endl;

	return 0;
}

C++: #include<iostream>

using namespace std;
 
int main(){
    int W,N;
    int w[30];
 
    cin >> W >> N;

    for(int i=0;i<W;i++)
    w[i] = i+1;
 
    int a, b, dm;
    for(int i=0;i<N;i++) {
    	
        cin >> a >> b; 
        
        dm = w[a-1];
        w[a-1] = w[b-1];
        w[b-1] = dm;
        
        }
 
        for(int i=0;i<W;i++)
            cout << w[i] << "\n"; 
 
        return 0;
}

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

int main()
{
	int w,n;
	scanf("%d",&w);
	scanf("%d",&n);
	int *lot = new int[w+1];
	for(int i=0;i<=w;i++){
		lot[i] = i;
	}
	for(int i=0;i<n;i++){

		string str1,str2;
		int a,b;
		getline(cin,str1,',');
		getline(cin,str2);
		sscanf(str1.c_str(),"%d",&a);
		sscanf(str2.c_str(),"%d",&b);
		swap(lot[a],lot[b]);
	}

	for(int i=1;i<=w;i++){
		printf("%d\n",lot[i]);
	}
}

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

int main() {
	int w,n;
	scanf("%d %d",&w,&n);
	int a[n];
	int b[n];
	for(int i=0;i<n;i++){
		scanf("%d,%d",&a[i],&b[i]);
	}
	int ans[w+1];
	for(int i=1;i<=w;i++)ans[i]=i;
	int temp;
	for(int i=0;i<n;i++){
		temp=ans[a[i]];
		ans[a[i]]=ans[b[i]];
		ans[b[i]]=temp;
	}
	for(int i=1;i<=w;i++){
		cout<<ans[i]<<endl;
	}
	return 0;
}

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

int main(){
  int W,n;
  cin>>W;
  int num[W+1];
  for(int i=1;i<=W;i++){
    num[i]=i;
  }
  cin>>n;
  int change1=0,change2=0;
  int alt=0;
  for(int i=0;i<n;i++){
    scanf("%d,%d",&change1,&change2);
    alt=num[change1];
    num[change1]=num[change2];
    num[change2]=alt;
  }
  for(int i=1;i<W+1;i++){
    cout<<num[i]<<endl;
  }
  return 0;
}

C++: /*Filename: aoj0011.cpp
 *Author: Mushiyo
 */

#include <iostream>
#include <stdio.h>

using namespace std;

int main(){
	int w = 0;

    while(cin >> w){
    	int num[w + 1];
    	for(int i = 1; i <= w; ++i){
    		num[i] = i;
    	}

        int n = 0;
        cin >> n;

        while(n > 0){
        	int a = 0, b = 0;
        	scanf("%d, %d", &a, &b);

        	int tmp = num[a];
        	num[a] = num[b];
        	num[b] = tmp;

        	--n;
        }
        
        for(int i = 1; i <= w; ++i){
        	cout << num[i] << endl;
        }
    }

	return 0;
}