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[:len(chair)-1], ""))
	}
}

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 <cstdio>
#include <cmath>
#include <vector>
#include <map>
#include <stack>
#include <queue>
#include <algorithm>
#include <set>

#define FOR(i,a,b) for(int i=(a);i<(b);i++)
#define REP(i,j) FOR(i,0,j)
#define mp std::make_pair

typedef long long ll;
typedef unsigned long long ull;
typedef std::pair<int,int> P;
typedef std::pair<int,P> State;

const int INF = 1001001001;

// S N E W(南北東西)
const int dx[8] = {0, 0, 1, -1, 1, 1, -1, -1}, dy[8] = {1, -1, 0, 0, 1, -1, 1, -1};

int N, M;
char chairs[100];

int main(){
    std::cin >> N >> M;

    REP(i, N){chairs[i] = '#';}

    REP(i, M){
        char c;
        std::cin >> c;

        if(c == 'A'){
            REP(j, N){
                if(chairs[j] == '#'){chairs[j] = 'A'; break;}
            }
        }else if(c == 'B'){
            bool can = false;
            for(int j=N-1;j>=0;j--){
                if(j-1 >= 0 && chairs[j-1] == 'A'){continue;}
                if(j+1 < N && chairs[j+1] == 'A'){continue;}
                chairs[j] = 'B';
                can = true;
                break;
            }
            if(can){continue;}
            REP(j, N){
                if(chairs[j] == '#'){chairs[j] = 'B'; break;}
            }
        }else if(c == 'C'){
            if(i == 0){chairs[(N+2)/2] = 'C'; continue;}

            REP(j, N){
                if(chairs[j] == '#'){continue;}
                if(j+1 < N && chairs[j+1] == '#'){chairs[j+1] = 'C'; break;}
                if(j-1 >= 0 && chairs[j-1] == '#'){chairs[j-1] = 'C'; break;}
            }
        }else if(c == 'D'){
            int pos = -1, max_l = 0;
            REP(j, N){
                if(chairs[j] != '#'){continue;}

                int l1 = INF, l2 = INF;
                REP(k, j){
                    if(chairs[k] != '#'){l1 = j-k; break;}
                }
                for(int k=N-1;k>j;k--){
                    if(chairs[k] != '#'){l2 = k-j; break;}
                }

                if(std::min(l1, l2) > max_l){pos = j; max_l = std::min(l1, l2);}
            }

            chairs[pos] = 'D';
        }
    }

    REP(i, N){
        putchar(chairs[i]);
    }
    puts("");
}

C++: #include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <map>
#include <vector>
using namespace std;

char seat[110];
bool is_seat = false;
int n, m;

void A(){
  for(int i = 0 ; i < n ; i++){
    if(seat[i] == '#'){
      seat[i] = 'A';
      is_seat = true;
      return;
    }
  }
}

void B(){
  bool flag = false;
  for(int i = n-1 ; i >= 0 ; i--){
    if(seat[i-1] != 'A' && seat[i+1] != 'A' && seat[i] == '#'){
      seat[i] = 'B';
      flag = true;
      is_seat = true;
      return;
    }
  }
  if(!flag){
    for(int i = 0 ; i < n ; i++){
      if(seat[i] == '#'){
	seat[i] = 'B';
	is_seat = true;
	return;
      }
    }
  }
}

void C(){
  if(!is_seat){
    if(n % 2 == 1) seat[(n+1)/2-1] = 'C';
    else seat[n/2+1-1] = 'C';
    is_seat = true;
    return;
  }
  else{
    for(int i = 0 ; i < n ; i++){
      if(seat[i] != '#'){
	if(seat[i+1] == '#'){
	  seat[i+1] = 'C';
	  is_seat = true;
	  return;
	}
	else{
	  if(seat[i-1] == '#'){
	    seat[i-1] = 'C';
	    is_seat = true;
	    return;
	  }
	}
      }
    }
  }
}

void D(){
  bool Must_left = true;
  vector<pair<int, int> > check;
  if(!is_seat){
    is_seat = true;
    seat[0] = 'D';
    return;
  }
  
  for(int i = 0 ; i < n ; i++){
    if(seat[i-1] == '#' && seat[i+1] == '#') Must_left = false;
  }
  for(int i = 0 ; i < n ; i++){
    if(seat[i] == '#'){
      int cnt = 0;
      int len;
      for(int j = i-1 ; seat[j] == '#' || j >= 0; j--) cnt++;
      len = cnt; cnt = 0;
      for(int j = i+1 ; seat[j] == '#' || j < n ; j++) cnt++;
      len = max(len, cnt);
      check.push_back(make_pair(len, i));
    }
  }
  sort(check.begin(), check.end());
  for(int i = 0 ; i < check.size() ; i++){
    if(check[i].first == check[i+1].first) Must_left = true;
  }

  if(Must_left){
    for(int i = 0 ; i < n ; i++){
      if(seat[i] == '#'){
	seat[i] = 'D';
	is_seat = true;
	return;
      }
    }
  }
  else{
    seat[check[0].second] = 'D';
    is_seat = true;
    return;
  }
}

int main(){
  while(cin >> n >> m){
    if(n == 0 && m == 0) break;
    fill(seat, seat+n, '#');
    char p;
    is_seat = false;
    while(m--){
      cin >> p;
      if(p == 'A') A();
      else if(p == 'B') B();
      else if(p == 'C') C();
      else if(p == 'D') D();
      /*for(int i = 0 ; i < n ; i++)cout << seat[i];
      cout << endl;*/
    }
    for(int i = 0 ; i < n ; i++)cout << seat[i];
    cout << endl;
  }
  return 0;
}