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 <algorithm>
#define MAX 200

using namespace std;

int n,m;
char chair[MAX+1];

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

void B(){
  int found = -1;

  for(int i = 0 ; i < n ; i++){
    if(chair[i] == 'A'){
      found = i;
    }
  }

  if(found == -1){
    for(int i = n-1 ; i >= 0 ; i--){
      if(chair[i] == '#'){
	chair[i] = 'B';
	return;
      }
    }
  }
  else{
    for(int i = n-1 ; i >= 0 ; i--){
      if(chair[i] == '#'){	
	if(i && chair[i-1] == 'A') continue;
	if(i != n-1 && chair[i+1] == 'A') continue;
	chair[i] = 'B';
	return;
      }
    }

    for(int i = 0 ; i < n ; i++){
      if(chair[i] == '#'){
	chair[i] = 'B';
	return;
      }
    }
  }
}

void C(){
  int cnt = count(chair,chair+n,'#');

  if(cnt == n){
    if(n % 2){
      chair[(n+1)/2] = 'C';
    }
    else{
      chair[n/2+1] = 'C';
    }
    return;
  }
  else{
    for(int i = 0 ; i < n ; i++){
      if(chair[i] != '#'){
	if(i != n-1 && chair[i+1] == '#'){
	  chair[i+1] = 'C';
	  return;
	}
	else{
	  if(i && chair[i-1] == '#'){
	    chair[i-1] = 'C';
	    return;
	  }
	}
      }
    }
  }
}

void D(){
  int Breadth = 0,pos;

  for(int i = 0 ; i < n ; i++){
    int dist = (1<<29);
    for(int j = 0 ; j < n ; j++){
      if(chair[j] != '#'){
	dist = min(dist,abs(i-j));
      }
    }
    if(Breadth < dist){
      Breadth = dist;
      pos = i;
    } 
  }
  if(chair[pos] == '#'){
    chair[pos] = 'D';
  }
}

int main(){
  while(cin >> n >> m , n | m){
    char person;
    
    for(int i = 0 ; i < n ; i++)
      chair[i] = '#';

    for(int i = 0 ; i < m ; i++){
      cin >> person;
      
      switch(person){
      case 'A':	
	A(); 
	break;
      case 'B': 
	B(); 
	break;
      case 'C': 
	C(); 
	break;
      case 'D': 
	D(); 
	break;
      }
    }

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

  return 0;
}

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

#define MAX 110
typedef pair<int, int> P;
int n, m;
char chair[MAX];
bool isZero;

bool isCanSit(int x){
  if(chair[x] == '#') return true;
  return false;
}

void A(){
  for(int i = 0 ; i < n ; i++){
    if(isCanSit(i)){
      chair[i] = 'A';
      isZero = false;
      return;
    }
  }
}

bool isNext(int x){
  if(chair[x-1] == 'A' || chair[x+1] == 'A') return true;
  return false;
}

void B(){
  for(int i = n-1 ; i >= 0 ; i--){
    if(isCanSit(i) && !isNext(i)){
      chair[i] = 'B';
      isZero = false;
      return;
    }
  }
  
  for(int i = 0 ; i < n ; i++){
    if(isCanSit(i)){
      chair[i] = 'B';
      isZero = false;
      return;
    }
  }
}

void C(){
  if(isZero){
    chair[n/2] = 'C';
    isZero = false;
    return;
  }
  
  for(int i = 0 ; i < n ; i++){
    if(!isCanSit(i)){
      if(isCanSit(i+1)){
	if(i+1 != n){
	  chair[i+1] = 'C';
	  isZero = false;
	  return;
	}
	else{
	  chair[i-1] = 'C';
	  isZero = false;
	  return;
	}
      }
      else if(isCanSit(i-1)){
	chair[i-1] = 'C';
	isZero = false;
	return;
      }
    }
  }
}

void D(){
  if(isZero){
    chair[0] = 'D';
    isZero = false;
    return;
  }
  
  int sit;
  int dis[MAX];
  fill(dis, dis+MAX, MAX);
  for(int i = 0 ; i < n ; i++){
    if(chair[i] != '#'){
      for(int j = 0 ; j < n ; j++){
	dis[j] = min(dis[j], abs(i-j));
      }
    }
  }  
  int d = 0;
  for(int i = 0 ; i < n ; i++){
    if(dis[i] > d){
      sit = i;
      d = dis[i];
    }
  }
  chair[sit] = 'D';
  return;
}
  
void init(){
  fill(chair, chair+MAX, '#');
  isZero = true;
}

void display(){
  for(int i = 0 ; i < n ; i++){
    cout << chair[i];
  }
  cout << endl;
}

int main(){
  char p;
  while(cin >> n >> m){
    if(n == 0 && m == 0) break;
    init();
    for(int i = 0 ; i < m ; i++){
      cin >> p;
      if(p == 'A') A();
      if(p == 'B') B();
      if(p == 'C') C();
      if(p == 'D') D();
      //      display();
    }
    display();
  }
  return 0;
}

C++: #include<bits/stdc++.h>
#define for1(i, n) for(int i = 1; i <= (n);i++)
using namespace std;
int n, m;
signed main() {
	while (cin >> n >> m, n) {
		string ans; for1(i, n + 2)ans += '#';
		for1(v1lah, m) {
			char ch; cin >> ch;
			if (ch == 'A') {
				for1(i, n)if (ans[i] == '#') { ans[i] = ch; break; }
			}
			else if (ch == 'B') {
				for (int i = n; i > 0; i--)if (ans[i] == '#' && ans[i - 1] != 'A' && ans[i + 1] != 'A') { ans[i] = ch; goto heavenb; }
				for1(i, n)if (ans[i] == '#') { ans[i] = ch; break; }
			heavenb:;
			}
			else if (ch == 'C') {
				if (v1lah == 1)ans[n / 2 + 1] = ch;
				else for1(i, n)if (ans[i] != '#') { if (i != n && ans[i + 1] == '#') { ans[i + 1] = ch; break; }if (i != 1 && ans[i - 1] == '#') { ans[i - 1] = ch; break; } }
			}
			else {
				if (v1lah == 1)ans[1] = ch;
				else {
					int a[110]; a[0] = n + 1;
					for1(i, n) {
						if (ans[i] == '#')a[i] = a[i - 1] + 1;
						else {
							a[i] = 0; int p = i - 1;
							while (p >= 1) { if (a[p] > a[p + 1] + 1)a[p] = a[p + 1] + 1; else break; p--; }
						}
					}
					int p = 1;
					for1(i, n)if (a[p] < a[i])p = i;
					ans[p] = ch;
				}
			}
		}
		cout << ans.substr(1, n) << endl;
	}
}