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 // 次の人を読み込む
			}
		}
		fmt.Println(strings.Join(chair, ""))
	}
}

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 <bits/stdc++.h>
using namespace std;

typedef long long ll;
typedef pair<int, int> P;

#define pb push_back
#define rep(i, a, n) for(int i = (a); i < (n); i++)
#define dep(i, a, n) for(int i = (a); i >= (n); i--)
#define mod 1e9+7

__attribute__((constructor))
void initial() {
  cin.tie(0);
  ios::sync_with_stdio(false);
}

int main() {
  int n, m;
  while(cin >> n >> m) {
    if(!n) return 0;
    char a[100] = {};
    rep(j, 0, m) {
      char b;
      cin >> b;
      if(b == 'A') {
        rep(i, 0, n) {
          if(!a[i]) {
            a[i] = b;
            break;
          }
        }
      }else if(b == 'B') {
        dep(i, n - 1, 0) {
          if(a[i]) continue;
          int f = 0;
          if(i + 1 > n) f = 1;
          if(!f && a[i + 1] != 'A') f = 1;
          if(i - 1 < 0 && f) f = 2;
          if(f && a[i - 1] != 'A') f = 2;
          if(f == 2) {
            a[i] = b;
            break;
          }
        }
        rep(i, 0, n) {
          if(!a[i]) a[i] = b;
          break;
        }
      }else if(b == 'C') {
        int f = 0;
        rep(i, 0, n - 1) {
          if(!a[i]) continue;
          if(i + 1 < n && !a[i + 1]) {
            a[i + 1] = b;
            f = 1;
            break;
          }else if(i - 1 >= 0 && !a[i - 1]) {
            a[i - 1] = b;
            f = 1;
            break;
          }
        }
        if(!f) {
          if(n % 2) a[(n + 1) / 2 - 1] = b;
          else a[n / 2] = b;
        }
      }else {
        int mm = 0, re = 0, an;
        rep(i, 0, n) {
          if(!a[i]) re++;
          else break;
        }
        if(re > 0) {
          an = 0;
          mm = re - 1;
        }
        re = 0;
        dep(i, n - 1, 0) {
          if(!a[i]) re++;
          else break;
        }
        if(mm < re - 1) {
          an = n - 1;
          mm = re - 1;
        }
        re = 0;
        rep(i, 1, n - 1) {
          if(a[i]) continue;
          int l = 0, r = 0;
          dep(k, i - 1, 0) {
            if(!a[k]) l++;
            else break;
          }
          rep(k, i + 1, n) {
            if(!a[k]) r++;
            else break;
          }
          if(mm < min(l, r)) {
            an = i;
            mm = min(l, r);
          }
        }
        if(mm) a[an] = b;
        else {
          rep(i, 0, n) {
            if(!a[i]) {
              a[i] = b;
              break;
            }
          }
        }
      }
    }
    rep(i, 0, n) {
      if(a[i] == 'A' || a[i] == 'B' || a[i] == 'C' || a[i] == 'D') {
        cout << a[i];
      }else cout << '#';
    }
    cout << endl;
  }

}

C++: #include<iostream>
using namespace std;
int main(){
long n,m,i,j,d[101],e[101],k,dd;
char c,a[101];
while(cin>>n){
cin>>m;
if(n==0)break;
for(i=0;i<n;i++)a[i]='#';
for(j=0;j<m;j++){
cin>>c;
if(c=='A'){
for(i=0;i<n;i++)if(a[i]=='#'){a[i]='A';break;}
}else if(c=='B'){
for(i=n-1;i>=0;i--){
if(0<i&&a[i-1]!='A'&&i<n-1&&a[i+1]!='A'){a[i]='B';break;}
else if(0<i&&a[i-1]!='A'){a[i]='B';break;}
else if(i<n-1&&a[i+1]!='A'){a[i]='B';break;}
}
if(i<0){for(i=0;i<n;i++)if(a[i]=='#')a[i]='B';}
}else if(c=='C'){
for(i=0;i<n;i++){
if(a[i]!='#'){
if(i<n-1&&a[i+1]=='#'){a[i+1]='C';break;}
else if(i>0&&a[i-1]=='#'){a[i-1]='C';break;}
}
}
if(i==n)a[n/2]='C';
}else if(c=='D'){
for(i=0;i<n;i++)d[i]=-1;
for(i=0;i<n;i++)if(a[i]!='#')break;
if(i==n){a[0]='D';continue;}
for(;i<n;i++)if(a[i]=='#')d[i]=d[i-1]+1;else d[i]=0;
for(i=0;i<n;i++)e[i]=-1;
for(i=n-1;i>=0;i--)if(a[i]!='#')break;
for(;i>=0;i--)if(a[i]=='#')e[i]=e[i+1]+1;else e[i]=0;
for(i=0;i<n;i++)if(d[i]<e[i])d[i]=e[i];
for(k=0;k<n;k++)cout<<" "<<d[k];cout<<endl;
dd=d[n-1];
for(i=n-1;i>=0;i--)if(dd<=d[i]){dd=d[i];k=i;}
a[k]='D';
}
}
a[n]=0;cout<<a<<endl;
}
return 0;
}