Go: package main

import (
	"bufio"
	"os"
	"strings"
	"strconv"
		"fmt"
)

var scanner = bufio.NewScanner(os.Stdin)

const INF = 0x7FFFFFFF

func main() {
	for scanner.Scan() {
		buf := strings.Split(scanner.Text(), " ")
		n, _ := strconv.Atoi(buf[0])
		m, _ := strconv.Atoi(buf[1])
		if n == 0 && m == 0 {
			break
		}
		chair := make([]string, n+1)
		for i := range chair {
			chair[i] = "#"
		}
		chair[n] = "Sentinel"
		for i := 0; i < m; i++ {
			scanner.Scan()
			switch who := scanner.Text(); who {
			case "A": // 左から眺めて行って空いている席があったら即座に座る
				for j := 0; j < n; j++ {
					if chair[j] == "#" {
						chair[j] = "A"
						break
					}
				}
				// log.Println(chair)
				break // 次の人を読み込む
			case "B":
				flag := true
				// 右端からAの隣でない席を探していく
				for j := n-1; j > -1; j-- {
					if chair[j] == "#" && (j == 0 || chair[j-1] != "A") && chair[j+1] != "A" {
						flag = false
						chair[j] = "B"
						break
					}
				}
				// Aの隣しか空いていないので一番左端の空いている席に座る
				if flag {
					for j := 0; j < n; j++ {
						if chair[j] == "#" {
							chair[j] = "B"
							break
						}
					}
				}
				// log.Println(chair)
				break // 次の人を読み込む
			case "C":
				if i == 0 {
					chair[n/2] = "C" // 先客が誰もいないときは真ん中の椅子に座る
				} else {
					for j := 0; j < n; j++ { // 左から舐めて
						if chair[j] != "#" { // その席が空いていなくて
							if chair[j+1] == "#" { // 右隣が空いているなら座る
								chair[j+1] = "C"
								break
							} else if j != 0 && chair[j-1] == "#" { // 右隣が空いていないので左隣に座る
								chair[j-1] = "C"
								break
							}
						}
					}
				}
				// log.Println(chair)
				break // 次の人を読み込む
			case "D":
				distanceTable := make([]int ,n)
				for j := range distanceTable {
					distanceTable[j] = INF
				}
				for j:= 0; j < n; j++ {
					if chair[j] != "#" {
						for k := 0; k < n; k++ {
							distanceTable[k] = min(distanceTable[k], abs(j-k))
						}
					}
				}
				// log.Println("distanceTAble:", distanceTable)
				at := 0
				distance := 0
				for j := 0; j < n; j++ {
					if distance < distanceTable[j] {
						at = j
						distance = distanceTable[j]
					}
				}
				chair[at] = "D"
				// log.Println(chair)
				break // 次の人を読み込む
			}
		}
		for i := 0; i < n; i++ {
			if i == n-1 {
				fmt.Println(chair[i])
			} else {
				fmt.Printf("%s ", chair[i])
			}
		}
	}
}

func min(a, b int) int {
	if a > b {
		return b
	}
	return a
}

func abs(a int) int {
	if a < 0 {
		return -a
	}
	return a
}

C++: #include<stdio.h>
#include<string.h>
#include<math.h>
int main(void)
{
	int a,s,d[100],f,g,h,i,j,k,c,x[3],o;
	char z[2];
	while(1){
		scanf("%d %d",&a,&s);
		if(a==0&&s==0) break;
		f=a;
		for(i=0;i<a;i++) d[i]=0;
		for(i=0;i<s;i++){
			scanf("%s",z);
			if(z[0]=='A'){
				for(j=0;j<a;j++){
					if(d[j]==0){
						d[j]=1;
						f--;
						break;
					}
				}
			}
			else if(z[0]=='B'){
				g=0;
				for(j=a-1;j>=0;j--){
					if(d[j]==0&&d[j+1]!=1&&d[j-1]!=1){
						d[j]=2;
						f--;
						break;
					}
					if(d[j]==0) g++;
					if(f==g){
						d[j]=2;
						f--;
						break;
					}
				}
			}
			else if(z[0]=='C'){
				if(a==f){
					if(a%2==1){
						d[((a+1)/2)-1]=3;
						f--;
					}
					else if(a%2==0){
						d[a/2]=3;
						f--;
					}
				}
				else if(a>f){
					for(j=0;j<a;j++){
						if(d[j]>0){
							if(d[j-1]==0&&j-1>=0){
								d[j-1]=3;
								f--;
								break;
							}
							else if(d[j+1]==0&&j+1<a){
								d[j+1]=3;
								f--;
								break;
							}
						}
					}
				}
			}
			else if(z[0]=='D'){
				h=-1;
				c=-1;
				int v=0;
				x[0]=0;
				x[1]=0;
				for(j=a-1;j>=0;j--){
					if(d[j]>0&&v==0){
						h=j;
						if(d[0]==0){
							x[0]=h-1;
							x[1]=0;
						}
						v=1;
					}
					else if(d[j]>0&&v==1){
						c=j;
					}
					if(c>-1&&h>-1){
						if((h-c)%2==1){
							if(x[0]<=((h-c)/2-1)){
								x[0]=(h-c)/2-1;
								x[1]=h-(h-c)/2-1;
							}
						}
						else if((h-c)%2==0){
							if(x[0]<=(h-c)/2){
								x[0]=(h-c)/2;
								x[1]=h-(h-c)/2;
							}
						}
					}
					if(c>-1) h=c;
				}
				if(d[a-1]==0){
					if(x[0]<(a-1)-c){
						x[0]=(a-1)-c;
						x[1]=a-1;
					}
				}
				if(h==-1) x[1]=0;
				else if(c==-1){
					x[0]=(a-1)-h;
					x[1]=a-1;
					if(x[0]<h) x[1]=0;
				}
				d[x[1]]=4;
				f--;
			}
		}
		for(i=0;i<a;i++){
			if(d[i]==0) printf("#");
			else if(d[i]==1) printf("A");
			else if(d[i]==2) printf("B");
			else if(d[i]==3) printf("C");
			else if(d[i]==4) printf("D");
		}
		printf("\n");
	}
	return 0;
}

C++: #include<iostream>
#include<vector>
#include<algorithm>

using namespace std;
#define rep(i,n) for(int i = 0 ; i < n ; ++i)
using ll = long long;

vector<int> ans;
void solve(int n,int m){
    string ans(n,'#');
    rep(i,m){
        char c;
        cin>>c;
        if(c=='A'){
            int idx=0;
            while(ans[idx]!='#')++idx;
            ans[idx]='A';
        }
        else if(c=='B'){
            int idx = n-1;
            bool ok=false;
            while(1){
                if(ans[idx]!='#'){
                    --idx;
                    continue;
                }
                if(idx>0&&ans[idx-1]=='A'){
                    --idx;
                    continue;  
                }
                if(idx<n-1&&ans[idx+1]=='A'){
                    --idx;
                    continue;  
                }
                ans[idx]='B';
                ok=true;
                break;
            }
            if(!ok){
                int idx=0;
                while(ans[idx]!='#')++idx;
                ans[idx]='A';
            }
        }

        else if(c=='C'){
            if(i==0){
                ans[n/2]='C';
            }
            else {
                int idx=0;
                while(1){
                    if(ans[idx]=='#'){
                        ++idx;
                        continue;
                    }
                    if(idx<n-1&&ans[idx+1]=='#'){
                        ans[idx+1]='C';
                        break;
                    }
                    if(idx>0&&ans[idx-1]=='#'){
                        ans[idx-1]='C';
                        break;
                    }
                    ++idx;
                }
            }
        }
        else {
            if(i==0){
                ans[0]='D';
                continue;
            }
            vector<int> dist(n,1000);
            rep(k,n){
                if(ans[k]!='#'){
                    rep(j,n)dist[j]=min(dist[j],abs(k-j));
                }
            }
            int ma = -1, idx = -1;
            rep(j,n){
                if(dist[j]>ma){
                    ma=dist[j];
                    idx = j;
                }
            }
            ans[idx]='D';
        }
    }
    cout<<ans<<endl;
}

int main(){
    int n,m;
    while(cin>>n>>m,n!=0)solve(n,m);
}

C++: //08
#include<iostream>
#include<string>
#include<algorithm>

using namespace std;

int main(){
  for(int n,m;cin>>n>>m,n|m;){
    string c(n,'#');
    for(int i=0;i<m;i++){
      char p;
      cin>>p;
      switch(p){
      case 'B':
	int j;
	for(j=c.size()-1;j>=0;j--){
	  if(c[j]=='#'&&(j==0||c[j-1]!='A')&&(j==c.size()-1||c[j+1]!='A')){
	    c[j]=p;
	    break;
	  }
	}
	if(j)break;
      case 'A':
	for(int j=0;j<c.size();j++){
	  if(c[j]=='#'){
	    c[j]=p;
	    break;
	  }
	}
	break;
      case 'C':
	if(i==0){
	  c[n/2]=p;
	}else{
	  for(int j=0;j<c.size();j++){
	    if(c[j]!='#'){
	      if(j!=c.size()-1&&c[j+1]=='#'){
		c[j+1]=p;
		break;
	      }else if(j!=0&&c[j-1]=='#'){
		c[j-1]=p;
		break;
	      }
	    }
	  }
	}
	break;
      case 'D':
	if(i==0){
	  c[0]=p;
	}else{
	  int b;
	  int d=-1;
	  for(int j=0;j<c.size();j++){
	    if(c[j]=='#'){
	      int cd;
	      int l;
	      for(l=j;l>=0&&c[l]!='#';l--);
	      cd=(l<0)?1000:j-l;
	      int r;
	      for(r=j;r<n&&c[r]!='#';r++);
	      cd=min(cd,(r==n)?1000:r-j);
	      if(d<cd){
		d=cd;
		b=j;
	      }
	    }
	  }
	  c[b]=p;
	}
	break;
      }
    }
    cout<<c<<endl;
  }
  return 0;
}