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>

using namespace std;

const int INF = (1<<20);
int n,m;
string ans;

bool isEmpty(){
  for(int i = 0; i < ans.length(); i++)
    if(ans[i] != '#') return false;

  return true;
}

bool isVacant(int pos){
  if(pos <0 || pos >= ans.length()) return false;

  return ans[pos] == '#';
}

bool isA(int pos){
  if(pos < 0 || pos >= ans.length()) return false;
  return ans[pos] == 'A';
}

int left(int pos){
  int out = 0;
  for(int i = pos; i >= 0; i--){
    out++;
    if(ans[i] != '#') return out;
  }
  return INF;
}

int right(int pos){
  int out = 0;
  for(int i = pos; i < ans.length(); i++){
    out++;
    if(ans[i] != '#') return out;
  }
  return INF;
}


void A(){

  for(int i = 0; i < ans.length(); i++)
    if(ans[i] == '#'){
      ans[i] = 'A';
      return;
    }
}

void B(){
  for(int i = ans.length()-1; i >= 0; i--){
    if(ans[i] == '#' && !isA(i+1) && !isA(i-1)){
      ans[i] = 'B';
      return;
    }
  }

  for(int i = 0; i < ans.length(); i++)
    if(ans[i] == '#'){
      ans[i] = 'B';
      return;
    }

}
void C(){

  if(isEmpty()){
    if(n%2) ans[(n+1)/2-1] = 'C';
    else ans[n/2] = 'C';
    return;
  }

  for(int i = 0; i < ans.length(); i++)
    if(ans[i] != '#'){
      if(isVacant(i+1)){
	ans[i+1] = 'C';
	return;
      }
      if(isVacant(i-1)){
	ans[i-1] = 'C';
	return;
      }
    }
}

void D(){

  int d = -1,p = -1;

  if(ans[0] == '#') ans[0] = 'D';
  else{
    for(int i = 0; i < ans.length(); i++){
      int nowdis;
      if(ans[i] == '#') nowdis = min(left(i),right(i));

      if(nowdis > d){
	d = nowdis;
	p = i;
      }
    }
    ans[p] = 'D';
  }
  
}

void init(){
  string tmp = "";  
  for(int i = 0; i < n; i++) tmp += "#";
  ans = tmp;

}
int main(){
  
  while(cin >> n >> m && n+m){
    init();

    for(int i = 0; i < m; i++){
      char c;
      cin >> c;
      if(c == 'A') A();
      if(c == 'B') B();
      if(c == 'C') C();
      if(c == 'D') D();
      //   cout << "test  " << ans << endl;
    }

    cout << ans << endl;
  }
  return 0;
}

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

int main()
{
  int n, m;
  while (cin >> n >> m) {
    string chair(n, '#');

    while (m--) {
      string a;
      cin >> a;
      if (a == "A") {
	for (int i = 0; i < n; ++i) {
	  if (chair[i] == '#') {
	    chair[i] = 'A';
	    break;
	  }
	}
      } else if (a == "B") {
	int sit = -1;
	for (int i = n-1; i > 0 && sit == -1; --i) {
	  if (chair[i] != '#')
	    continue;

	  if (i == 0) {
	    if (chair[i+1] != 'A')
	      sit = i;
	  } else if (i == n-1) {
	    if (chair[i-1] != 'A')
	      sit = i;
	  } else if (chair[i+1] != 'A' && chair[i-1] != 'A') {
	    sit = i;
	  }
	}
	if (sit != -1) {
	  chair[sit] = 'B';
	  continue;
	}

	for (int i = 0; i < n; ++i) {
	  if (chair[i] == '#') {
	    chair[i] = 'B';
	    break;
	  }
	}
      } else if (a  == "C") {
	int sit = -1;
	for (int i = 0; i < n && sit == -1; ++i) {
	  if (chair[i] == '#')
	    continue;

	  if (i == 0) {
	    if (chair[i+1] == '#')
	      sit = i+1;
	  } else if (i == n-1) {
	    if (chair[i-1] == '#')
	      sit = i-1;
	  } else if (chair[i+1] == '#') {
	    sit = i+1;
	  } else if (chair[i-1] == '#') {
	    sit = i-1;
	  }
	}
	if (sit != -1) {
	  chair[sit] = 'C';
	  continue;
	}

	if (n&1)
	  chair[(n+1)/2-1] = 'C';
	else
	  chair[n/2] = 'C';
      } else {
	int maxIndex = -1, dist = -1;
	for (int i = 0; i < n; ++i) {
	  if (chair[i] != '#')
	    continue;

	  int right = 0;
	  if (i == n-1)
	    right = n;
	  for (int j = i+1; j < n; ++j) {
	    if (chair[j] == '#')
	      ++right;
	    else
	      break;
	  }

	  int left = 0;
	  if (i == 0)
	    left = n;
	  for (int j = i-1; j >= 0; --j) {
	    if (chair[j] == '#')
	      ++left;
	    else
	      break;
	  }

	  if (dist < min(right, left)) {
	    maxIndex = i;
	    dist = min(right, left);
	  }
	}
	chair[maxIndex] = 'D';
      }
    }

    cout << chair << endl;
  }
  return 0;
}

C++: #include<iostream>

using namespace std;

int n,m;
char seat[100];

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

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

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

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

void sitD()
{
	int dmin=100,imin;
	for(int i=0;i<n;i++){
		if(seat[i]=='#'){
			int disL=0,disR=0;
			for(int j=i;j>=0&&seat[j]!='#';j--,disL++);
			for(int j=i;j<n &&seat[j]!='#';j++,disR++);
			int dis=min(disL,disR);
			if(dis<dmin)	dmin=dis,imin=i;
		}
	}
	seat[imin]='D';
}

int main()
{
	for(;cin>>n>>m,n||m;){
		for(int i=0;i<n;i++)seat[i]='#';
		for(int i=0;i<m;i++){
			char c;	cin>>c;
			switch(c){
				case 'A':	sitA();	break;
				case 'B':	sitB();	break;
				case 'C':	sitC();	break;
				case 'D':	sitD();	break;
			}
		}
		for(int i=0;i<n;i++)	cout<<seat[i];
		cout<<endl;
	}

	return 0;
}