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<iostream>
#include<algorithm>
using namespace std;
int main() {
	int n, m;
	while (cin >> m >> n&&n != 0 && m != 0) {
		char a[100];
		fill(a, a + m, '#');
		for (int z = 0; z < n; z++) {
			char b;
			cin >> b;
			switch (b) {
				case 'A':
					for (int i = 0; i < m; i++) {
						if (a[i] == '#') {
							a[i] = 'A';
							break;
						}
					}
					break;
				case 'B': 
					for (int i = m - 1; i >= 0; i--) {
						if ((i == (m - 1) && a[m - 2] != 'A'&&a[i] == '#') || (i == 0 && a[1] != 'A'&&a[i] == '#') || (a[i - 1] != 'A'&&a[i] == '#'&&a[i + 1] != 'A')) {
							a[i] = 'B';
							goto stop;
						}
					}
					for (int i = 0; i < m; i++) {
						if (a[i] == '#') {
							a[i] = 'B';
							break;
						}
					}
				stop:;
					break;
				case 'C':
					if (z == 0) {
						if (m % 2 == 1)
							a[(m + 1) / 2] = 'C';
						else
							a[m / 2 + 1] = 'C';
						goto st;
					}
					for (int i = 1; i < m; i++) {
						if (a[i - 1] != '#'&&a[i] == '#') {
							a[i] = 'C';
							goto st;
						}
					}
				st:;
					break;
				case 'D':
					int f = 0, g = 0;
					if (z == 0) {
						a[0] = 'D'; goto stp;
					}
					for (int i = m - 1; i >= 0; i--) {
						int h = 0, k = 0;
						for (int j = i; j >= 0; j--) {
							if (a[j] != '#')
								break;
							else
								h++;
						}
						for (int j = i; j < m; j++) {
							if (a[j] != '#')
								break;
							else
								k++;
						}
						if (g <= min(h, k)) {
							f = i;
							g = min(h, k);
						}
					}
					a[f] = 'D';
				stp:;
					break;
			}
		}
		for (int i = 0; i < m; i++) {
			cout << a[i];
		}
		cout << endl;
	}
}

C++: #include <iostream>
#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <cmath>
#include <vector>
#include <string>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <algorithm>

using namespace std;

#define rep(i,j) REP((i), 0, (j))
#define REP(i,j,k) for(int i=(j);(i)<(k);++i)
#define BW(a,x,b) ((a)<=(x)&&(x)<=(b))
#define F first
#define S second
#define INF 1 << 30

typedef pair<int, int> pi;
typedef pair<int, pi> pii;
typedef vector<int> vi;
typedef queue<int> qi;
typedef long long ll;

int n, m, f, dis, pos;
char c[100];

int main(){
  while(scanf("%d%d", &n, &m) && n){
    rep(i, n) c[i] = '#';
    char p[2];
    rep(k, m){
      scanf("%s", p);
      switch(p[0]){
      case 'A':
	rep(i, n) if(c[i] == '#'){ c[i] = 'A'; break;;}
	break;
      case 'B':
	if(c[n-2] != 'A' && c[n-1] == '#'){ c[n-1] = 'B'; break;}
	for(int i = n-2; i > 0; i--) if(c[i+1] != 'A' && c[i-1] != 'A' && c[i] == '#'){ c[i] = 'B'; goto e1;}
	if(c[1] != 'A' && c[0] == '#'){ c[0] = 'B'; break;}
	rep(i, n) if(c[i] == '#'){ c[i] = 'B'; break;}
      e1:
	break;
      case 'C':
	rep(i, n-1) if(c[i] != '#' && c[i+1] == '#'){ c[i+1] = 'C'; goto e2;}
	f = 0;
	rep(i, n) if(c[i] != '#') f = 1;
	if(f){
	  c[0] = 'C';
	}else{
	  if(n%2) c[(n+1)/2] = 'C';
	  else c[n/2+1] = 'C';
	}
      e2:
	break;
      case 'D':
	dis = 0, pos = 0;
	rep(i, n){
	  if(c[i] != '#') continue;
	  int j;
	  f = 0;
	  for(j = 1; j < n; j++){
	    if(i-j >= 0 && c[i-j] != '#') f = 1;
	    //	    printf("%d ", f);
	    if(i+j < n && c[i+j] != '#') f = 1;
	    //	    printf("%d ", f);
	    if(f){
	      if(dis < j){
		dis = j;
		pos = i;
	      }
	      break;
	    }
	  }
	  //	  printf("%d %d %d\n",i, dis, pos);
	}

	c[pos] = 'D';
	break;
      }
    }
  
    rep(i, n) putchar(c[i]); puts("");
  }
  return 0;
}

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

string chair;


int goA(char c){
	for(int i = 0 ; i < chair.size() ; i++)
		if( chair[i] == '#'){
			chair[i] = c;
			return 1;
		}
	return 0;
}
int goB(char c){
	for(int i = chair.size() -1  ; i >= 0 ; i--)
		if( chair[i] == '#' && (!i||chair[i-1]!='A') && (i+1==chair.size()||chair[i+1]!='A') ){
			chair[i] = c;
			return 1;
		}
	return goA(c);
}
int goC(char c){
	if( count(chair.begin(),chair.end(),'#') == chair.size() ){
		if( chair.size() % 2 ) chair[(1+chair.size())/2-1] = c;
		else chair[chair.size()/2] = c;
		return 1;
	}
	for(int i = 0 ; i < chair.size() ; i++)
		if( chair[i] != '#'){
			for(int j = 1 ; j >= -1 ; j--){
				if( i+j >= 0 && i+j < chair.size() && chair[i+j] == '#' ){
					chair[i+j] = c;
					return 1;
				}
			}
		}

	return 0;
}
int goD(char c){
	int pos;
	int dst = -2e9;
	for(int i = 0 ; i < chair.size() ; i++){
		if( chair[i] == '#' ){
			int dist = 1e9;
			for(int j = 0 ; j < chair.size() ; j++)
				if( chair[j] != '#') dist = min(dist,abs(i-j));

			if( dst < dist){
				dst = dist;
				pos = i;
			}
		}
	}
	chair[pos] = c;
	return 1;
}


int main(){
	int n,m;
	while( cin >> n >> m && n ){
		chair = string(n,'#');
		for(int i = 0 ; i < m ; i++){
			char c; cin >> c;
			if( c == 'A' ) goA(c);
			if( c == 'B' ) goB(c);
			if( c == 'C' ) goC(c);
			if( c == 'D' ) goD(c);
		}
		cout << chair << endl;
	}
}