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<iostream>
#include<string.h>
#include<cstdio>
using namespace std;
int main() {
	int n, m, temp;
	char str, str2[10001], str3[10001] = { NULL };
	while (1) {
		cin >> n >> m;
		if (n == 0 && m == 0)return 0;
		for (int i = 0; i < m; i++) {
			cin >> str2[i];
		}
		for (int i = 0; i < n; i++) {
			str3[i] = '#';
		}
		for (int i = 0; i < m; i++) {
			if (str2[i] == 'A') {
				for (int j = 0; j < n; j++) {
					if (str3[j] == '#') {
						str3[j] = 'A';
						goto end;
					}
				}
			}
			else if (str2[i] == 'B') {
				for (int j = n - 1; j > 0; j--) {
					if (str3[j] == '#'&&str3[j - 1] != 'A'&&str3[j + 1] != 'A') {
						str3[j] = 'B';
						temp++;
						goto end;
					}
				}
				if (temp == 0) {
					for (int j = 0; j < n; j++) {
						if (str3[j] == '#') {
							str3[j] = 'B';
							temp++;
							goto end;
						}
					}
				}
				/*if (temp == 0) {
					for (int j = 0; j < n; j++) {
						if (str3[j] == '#') {
							str3[j] = 'B';
							goto end;
						}
					}
				}*/
				temp = 0;
			}
			else if (str2[i] == 'C') {
				for (int j = 0; j < n; j++) {
					if (str3[j] != '#') {
						if (str3[j + 1] == '#') {
							str3[j + 1] = 'C';
							temp++;
							goto end;
						}
					}
				}
				if (temp == 0) {
					if (n % 2 == 0)temp = n / 2 + 1;
					else temp = (n + 1) / 2;
					str3[temp] = 'C';
				}
				temp = 0;
			}
			else if (str2[i] == 'D') {
				int q,p,d;
				int D[100];
				d = n * 2;
				for (p = 0; p < n;p++) {
					d++;
					if (str3[p] != '#')
						d = 0;
					D[p] = d;
				}
				for (d = n; p > 0;p--) {
					d++;
					if (str3[p] != '#')
						d = 0;
					if (d < D[p])
						D[p] = d;
				}
				for ( p = q = 0; q < n; q++)
					if (D[q] > D[p])
						p = q;
				str3[p] = 'D';
				goto end;
			}
			/*for (int i = 0; i < n; i++) {
				cout << str3[i];
			}
			cout << endl;*/
		end:;
		}
		for (int i = 0; i < n; i++) {
			cout << str3[i];
		}
		cout << endl;
		memset(str3, NULL, sizeof(str3));
		memset(str2, NULL, sizeof(str2));
		temp = 0;
	}
}

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

char chair[128];
int n, m;
const int M = 2;

void A() {
	for(int i = 0; i < n; i++) {
		if(chair[i+M] == 'N') {
			chair[i+M] = 'A';
			break;
		}
	}
}

void B() {
	for(int i = n-1; i >= 0; i--) {
		if(chair[i+M] == 'N' && chair[i+1+M] != 'A' && chair[i-1+M] != 'A') {
			chair[i+M] = 'B';
			return;
		}
	}
	for(int i = 0; i < n; i++) {
		if(chair[i+M] == 'N') {
			chair[i+M] = 'B';
			return;
		}
	}
}

void C() {
	for(int i = 0; i < n; i++) {
		/*
		if(chair[i+M] == 'N' && (chair[i-1+M] != 'N' || chair[i+1+M] != 'N')) {
			chair[i+M] = 'C';
			return;
		}
		*/
		if(chair[i+M] != 'N') {
			if(chair[i+1+M] == 'N' && i+1 < n) {
				chair[i+1+M] = 'C';
				return;
			}
			else if(chair[i-1+M] == 'N' && i-1 >= 0) {
				chair[i-1+M] = 'C';
				return;
			}
		}
	}
	chair[n/2+M] = 'C';
}

void D() {
	int mx = 0;
	int indx = 0;
	for(int i = 0; i < n; i++) {
		if(chair[i+M] == 'N') {
			int mn = 1000;
			for(int j = 0; j < n; j++) {
				if(chair[j+M] != 'N') {
					if(mn > abs(j - i))
						mn = abs(j - i);
				}
			}
			if(mn > mx) {
				mx = mn;
				indx = i;
			}
		}
	}
	chair[indx+M] = 'D';
}

int main() {
	while(cin >> n >> m, n || m) {
		for(int i = 0; i < 128; i++)
			chair[i] = 'N';
		for(int i = 0; i < m; i++) {
			string s;
			cin >> s;
			if(s[0] == 'A')
				A();
			else if(s[0] == 'B')
				B();
			else if(s[0] == 'C')
				C();
			else
				D();
		}
		for(int i = 0; i < n; i++) {
			cout << (chair[i+M] == 'N' ? '#' : chair[i+M]);
		}
		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';
	  }*/
	if(n%2) c[(n+1)/2-1] = 'C';
	else c[n/2] = '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;
}