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>
using namespace std;

int main(){

  int n,m;
  int j;
  char chair[100];
  char p;
  int left,max,m_left;

  while(1){

    cin >> n >> m;
    if(n==0 && m==0)
      break;

    for(int i=0; i<n; i++)
      chair[i]='#';


    for(int i=0; i<m; i++){

    cin >> p;

    if(p=='A'){
      j=0;
      while(chair[j]!='#')
	j++;

      chair[j]='A';
    }///////////////////////A

    else if(p=='B'){
      j=n-1;
      while(1){
	if(chair[j]=='#'){
	  if(j==n-1 && chair[j-1]!='A')
	    break;

	  else if(j>0 && chair[j+1]!='A' && chair[j-1]!='A')
	    break;

	  else if(chair[j+1]!='A')
	    break;
	  
	  else{
	    j=-1;
	    break;
	  }
	}
      }

      if(j!=-1)
	chair[j]='B';

      else{
	j=0;
	while(chair[j]!='#')
	  j++;

	chair[j]='B';
      }

    }////////////////////////B


    else if(p=='C'){
      j=0;
      while(1){
	if(chair[j]!='#'){
	  if(chair[j+1]=='#'&&j!=n-1){
	    j++;
	    break;
	  }
	  else if(j!=0 && chair[j-1]=='#'){
	    j--;
	    break;
	  }
	}

	if(j==n-1){
	  j=-1;
	  break;
	}

	j++;
      }

      if(j==-1){
	if(n%2==1)
	  j=(n+1)/2;
	else
	  j=n/2+1;
      }

      chair[j] = 'C';
    }///////////////////////C


    else{
      left=0; max=1; m_left=0;
      j=1;
      while(j<=n-1){
	if(chair[j]!='#'){
	  left=j;

	  j++;
	}

	if(max < j-left){
	  max = j-left;
	  m_left = left;
	}

	j++;
      }

      if(max == 1)
	j = m_left+1;

      else if(max == n-1)
	j=0;

      else{
	if(max%2==1)
	  j=m_left+max/2 +1;
	else
	  j=m_left+max/2;
      }


      chair[j]='D';

    }///////////////////////D

    }


    for(int i=0; i<n; i++)
      cout << chair[i];


    cout << endl;

  }


  return 0;

}

C++: #include<iostream>
using namespace std;
#define rep(i,s,e) for ( int i = s; i <= e; i++ )
#define MAX 10000
char C[MAX+2];
int n, m;

void setLeft(char ch){
    for ( int i = 1; ; i++ ){
	if ( C[i] == '#' ) { C[i] = ch; return; }
    }
}

void setB(){
    for ( int i = n; i >= 1; i-- ){
	if ( C[i] == '#' && C[i-1] != 'A' && C[i+1] != 'A' ){
	    C[i] = 'B'; return;
	}
    }
    setLeft('B');
}

bool isEmpty(){
    rep(i,1,n) if ( C[i] != '#' ) return false;
    return true;
}

void setC(){
    if ( isEmpty() ){ C[n/2+1] = 'C'; return; }
    rep(i,1,n){
	if ( C[i] == '#' ) continue;
	if ( C[i+1] == '#' ) { C[i+1] = 'C'; return; }
	if ( C[i-1] == '#' ) { C[i-1] = 'C'; return; }
    }
}

int getDist( int p ){
    int l = 0, r = 0;
    while( C[p+l-1] == '#' ) l--;
    if ( C[p+l-1] == 'X' ) l = -1000000;
    while( C[p+r+1] == '#' ) r++;
    if ( C[p+r+1] == 'X' ) r = 1000000;
    return min( (-1)*l, r);
}
void setD(){
    if ( isEmpty() ){ C[1] = 'D'; return; }
    int d, mi, md = -1;
    rep(i,1,n){
	if ( C[i] != '#' ) continue;
	d = getDist(i);
	if ( d > md ) {
	    md = d; mi = i;
	}
    }
    C[mi] = 'D';
}

main(){
    char ch;
    while( cin >> n >> m && n && m ){
	rep(i,0,n+1) C[i] = '#';
	C[0] = C[n+1] = 'X';
	rep(i,1,m){ 
	    cin >> ch;
	    if ( ch == 'A' ) setLeft('A');
	    else if ( ch == 'B' ) setB();
	    else if ( ch == 'C' ) setC();
	    else if ( ch == 'D' ) setD();
	}
	rep(i,1,n) cout << C[i];
	cout << endl;
    }
}

C++: #include <bits/stdc++.h>
using namespace std;
int n,m;
char chair[200];

void A(char ch){
  int i=1;
  while(chair[i]!='#') i++;
  chair[i]=ch;
  //assert(i<=n);
}

void B(){
  int i=n;
  while(chair[i]!='#')i--;
  chair[i]='B';
  assert(i>=0);
}

void C(int kai){
  if(kai==0){
    if(n%2)chair[(n+1)/2]='C';
    else chair[n/2+1]='C';
    return;
  }
  int f=1;
  for(int i=1;i<=n;i++){
    if(chair[i]=='#')continue;
    if(chair[i-1]=='#') chair[i-1]='C',i=n,f=0;
    if(chair[i+1]=='#') chair[i+1]='C',i=n,f=0;
  }
  // assert(f);
}

void D(){
  int R=0,L=0;
  while(chair[n-R]=='#')R++;
  while(chair[L+1]=='#')L++;
  
  int M=0,idx=0,cnt=0;
  for(int i=1;i<=n;i++){
    if(chair[i]=='#')cnt++;
    else cnt=0;
    if(M+M%2<cnt) M=cnt,idx=i;
  }
  if(M<=2&&L<=1&&R<=1) A('D');
  else if(L-1>=(M-1)/2&&L-1>=R-1)chair[1]='D';
  else if(R-1>(M-1)/2)chair[n]='D';
  else chair[(idx-M+1)+(M-1)/2]='D';

}

int main(){
  while(1){
    cin>>n>>m;
    if(!n&&!m)break;
    memset(chair,'#',sizeof(chair));
    chair[0]=chair[n+1]=0;
    for(int i=0;i<m;i++){
      char a;
      cin>>a;
      if(a=='A') A(a);
      if(a=='B') B();
      if(a=='C') C(i);
      if(a=='D') D();
    }
    assert(strlen(chair+1)==n);
    printf("%s\n",chair+1);
  }
  return 0;
}