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 <cstdio>
#include <cstring>
#include <algorithm>
#include <string>
#include <cmath>
#include <stack>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <list>
#include <iostream>
#include <sstream>
#include <climits>
#include <cfloat>
#include <complex>

using namespace std;

int main()
{
	int n, m;
	while (scanf("%d %d", &n, &m), n | m)
	{
		char t[102];	// 1~n
		memset(t, '#', sizeof(t));
		for (int w = 0; w < m; ++w)
		{
			char c;
			scanf(" %c", &c);
			if (c == 'A')
			{
				int i;
				for (i = 1; t[i] != '#'; ++i)
					;
				t[i] = 'A';
			}
			else if (c == 'B')
			{
				int i;
				for (i = n; i >= 1; --i)
					if (t[i-1] != 'A' && t[i] == '#' && t[i+1] != 'A')
						break;
				if (i == 0)
					for (i = 1; t[i] != '#'; ++i)
						;
				t[i] = 'B';
			}
			else if (c == 'C')
			{
				int i;
				if (w == 0)
					i = n / 2 + 1;
				else
				{
					for (i = 2; ; ++i)
						if (t[i-1] != '#' && t[i] == '#')
							break;
					if (i == n+1)
						for (--i; t[i] != '#'; --i)
							;
				}
				t[i] = 'C';
			}
			else
			{
				int i;
				if (w == 0)
					i = 1;
				else
				{
					int dis[102];
					for (int j = 0; j < 102; ++j)
						dis[j] = 100000000;
					for (int j = 1; j <= n; ++j)
					{
						if (t[j] != '#')
							for (int k = 1; k <= n; ++k)
								dis[k] = min(dis[k], abs(j-k));
					}
					int d = 0;
					for (int j = 1; j <= n; ++j)
					{
						if (dis[j] > d)
						{
							i = j;
							d = dis[j];
						}
					}
				}
				t[i] = 'D';
			}
			printf("%2d: ", w);
					for (int i = 1; i <= n; ++i)
			putchar(t[i]);
					printf("\n");
		}
		for (int i = 1; i <= n; ++i)
			putchar(t[i]);
		printf("\n");
	}

	return 0;
}

C++: #include<iostream>

char *chr, *peo;
int n,m;

void sitA(int i){
	for(int k=0; k<n; k++){
		if(chr[k] == '#'){
			chr[k] = 'A';
				break;
		}
	}
	return;
}

void sitB(int i){
	if(chr[n-1] == '#' && chr[n-2] != 'A'){
		chr[n-1] = 'B';
		return;
	}
	for(int k=n-2; k>0; k--){
		if(chr[k] == '#' && chr[k-1] != 'A' && chr[k+1] != 'A'){
			chr[k] = 'B';
			return;
		}
	}
	for(int k=0; k<n; k++){
		if(chr[k] == '#'){
			chr[k] = 'B';
			return;
		}
	}
}

void sitC(int i){
	if(i==0){
		if(n%2 == 0)
			chr[n/2] = 'C';
		else
			chr[(n-1)/2] = 'C';
		return;
	}
	for(int k=0; k<n; k++){
		if(chr[k] == '#')
			continue;
		if(k<n-1){
			if(chr[k+1] == '#'){
				chr[k+1] = 'C';
				return;
			}
		}
		if(k>0){
			if(chr[k-1] == '#'){
				chr[k-1] = 'C';
				return;
			}
		}
	}
}

void sitD(int i){
	if(i==0){
		chr[0] = 'D';
		return;
	}
	int ans,tmp=0,tmp1,tmp2;
	for(int k=0; k<n; k++){
		if(chr[k] != '#')
			continue;
		tmp1=0;
		tmp2=0;
		for(int t=k; t<n; t++){
			if(chr[t] != '#')
				break;
			tmp1++;
			if(t == n-1)
				tmp1 = n+1;
		}
		if(k == n-1)
			tmp1 = n+1;
		for(int t=k; t>=0; t--){
			if(chr[t] != '#')
				break;
			tmp2++;
			if(t == 0)
				tmp2 = n+1;
		}
		if(k == 0)
			tmp2 = n+1;
		if(tmp1 > tmp2)
			tmp1 = tmp2;
		if(tmp1 > tmp){
			tmp = tmp1;
			ans = k;
		}
	}
	chr[ans] = 'D';
}

void solve(){
	char tmp;
	for(int i=0; i<m; i++){
		tmp = peo[i];
		switch(tmp){
		case 'a':
		case 'A':
			sitA(i);
			break;
		case 'b':
		case 'B':
			sitB(i);
			break;
		case 'c':
		case 'C':
			sitC(i);
			break;
		case 'd':
		case 'D':
			sitD(i);
			break;
		}
	}
	std::cout << chr << std::endl;
}

int main(){
	while(true){
		std::cin >> n >> m;
		if(!n && !m)
			return 0;
		chr = new char[n];
		peo = new char[m];
		for(int i=0; i<n; i++){
			chr[i] = '#';
			if(i<m)
				std::cin >> peo[i];
		}
		solve();
		delete[] chr;
		delete[] peo;
	}
}

C++: #include<iostream>
#include<algorithm>
#include<cstdio>
using namespace std;
#define INF (1 << 29)
int main(){
  char chair[105];
  int n, m;
  char c;
  while(cin >> n >> m, n){
    fill(chair, chair + n, '#');
    chair[n] = 0;
    for(int i = 0;i < m;i++){
      cin >> c;
      switch(c){
      case 'A':
      left :
	for(int j = 0;j < n;j++){
	  if(chair[j] == '#'){
	    chair[j] = c;
	    break;
	  }
	}
	break;
      case 'B':
	for(int j = n - 1;j >= 0;j--){
	  if((j == 0 || chair[j - 1] != 'A') && chair[j + 1] != 'A' && chair[j] == '#'){
	    chair[j] = c;
	    break;
	  }
	  if(j == 0)goto left;
	}
	break;
      case 'C':
	for(int j = 0;j < n;j++){
	  if(chair[j] != '#'){
	    if(chair[j + 1] == '#'){
	      chair[j + 1] = c;
	      break;
	    }
	    if(j != 0 && chair[j - 1] == '#'){
	      chair[j - 1] = c;
	      break;
	    }
	  }
	  if(j == n - 1){
	    chair[n / 2] = c;
	  }
	}
	break;
      case 'D':
	int p = 0, s = -1;
	for(int j = 0;j < n;j++){
	  if(chair[j] != '#')continue;
	  int t = INF;
	  for(int k = j;k < n;k++){
	    if(chair[k] != '#'){
	      t = k - j;
	      break;
	    }
	  }
	  for(int k = j;k >= 0;k--){
	    if(chair[k] != '#'){
	      t = min(t, j - k);
	      break;
	    }
	  }
	  if(t > s){
	    p = j;
	    s = t;
	  }
	}
	if(p == INF){
	  chair[n - 1] = c;
	}
	else{
	  chair[p] = c;
	}
	break;
      }
    }
    printf("%s\n", chair);
  }
  return 0;
}