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>
#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") {
	bool sit = false;
	for (int i = n-1; i > 0; --i) {
	  if (chair[i] == '#' && chair[i-1] != 'A') {
	    chair[i] = 'B';
	    sit = true;
	    break;
	  }
	}
	if (sit)
	  continue;

	for (int i = 0; i < n; ++i) {
	  if (chair[i] == '#') {
	    chair[i] = 'B';
	    break;
	  }
	}
      } else if (a  == "C") {
	bool sit = false;
	for (int i = 0; i < n-1; ++i) {
	  if (chair[i] != '#' && chair[i+1] == '#') {
	    chair[i+1] = 'C';
	    sit = true;
	    break;
	  }
	}
	if (sit)
	  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<bits/stdc++.h>
using namespace std;

int main()
{
  int n,m;
  char c,isu[200];
 
  while(1){
    cin>>n>>m;
    if(n+m==0)break;
    for(int i=0;i<200;i++)isu[i]='#';

    for(int k=0;k<m;k++){
      cin>>c;
      if(c=='A'){
	for(int i=0;i<n;i++){
	  if(isu[i]=='#'){
	    isu[i]='A';
	    break;
	  }
	}
      }

      if(c=='B'){
	bool flag=false;
	for(int i=n-1;i>=1;i--){
	  if(isu[i-1]!='A' && isu[i]=='#'){
	    isu[i]='B';
	    flag=true;
	    break;
	  }
	}
	if(flag)continue;
	for(int i=0;i<n;i++){
	  if(isu[i]=='#'){
	    isu[i]='B';
	    break;
	  }
	}
      }
      if(c=='C'){
	if(k==0){
	  if(n%2==0){
	    isu[n/2+1-1]='C';
	  }
	  else isu[(n+1)/2-1]='C';
	  continue;
	}
        for(int i = 0;i<n-1;i++){
	  if(isu[i]!='#'){
	    if(isu[i+1]=='#'){
	      isu[i+1]='C';
	      break;
	    }
            if(i!=0 && isu[i-1]=='#'){
	      isu[i-1]='C';
	      break;
	    }
	  }
	}
      }
      if(c=='D') {
	if(k==0){
	  isu[0]='D';
	  continue;
	}
	if(isu[n-1] == '#'){
	  isu[n-1]='D';
	  continue;
	}
	if(isu[0] == '#'){
	  isu[0]='D';
	  continue;
	}

	int ma=0,index;
	for(int i = 0;i < n;i++){
	  if(isu[i] == '#'){
	    for(int j=i+1;j<n;j++){
	      if(isu[j]!='#' ||  j==n-1){
		if(ma<j-i-1){
		  ma=j-i-1;
		  index=i;
		}
		i=j;
		break;
	      }
	    }
	  }
	}
	isu[index+ma/2]='D';
      }
    }
    for(int i=0;i<n;i++)cout<<isu[i];
    cout<<endl;
  }
  return 0;
}

C++: #include<bits/stdc++.h>
using namespace std;
int main(){
  int n,m;
  while(cin>>n>>m,n){
    string s;
    for(int i=0;i<n;i++)s+='#';
    while(m--){
      string p;
      cin>>p;
      if(p=="A"){
        for(int i=0;i<n;i++)
          if(s[i]=='#'){
            s[i]='A';
            break;
          }
      }
      if(p=="B"){
        int pp=0;
        for(int i=n-1;i>=0;i--){
          if(i==n-1){if(s[i-1]!='A'&&s[i]=='#'){pp++,s[i]='B';break;}}
          else if(!i){if(s[i+1]!='A'&&s[i]=='#'){pp++,s[i]='B';break;}}
          else {if(s[i-1]!='A'&&s[i]=='#'&&s[i+1]!='A'){pp++,s[i]='B';break;}}
        }
        if(!pp)for(int i=0;i<n;i++)
             if(s[i]=='#'){
               s[i]='B';
               break;
            }
      }
      if(p=="C"){
        int pp=0;
        for(int i=0;i<n;i++)
          if(s[i]!='#'){
            
            if(i!=n-1){if(s[i+1]=='#'){s[i+1]='C';pp++;break;}}
            if(i){if(s[i-1]=='#'){s[i-1]='C';pp++;break;}}
          }
        if(!pp){
          if(n%2)s[(n+1)/2-1]='C';
          else s[n/2]='C';
        }
      }
      else if(p=="D"){
        int d[n]={},p=0,sp=0;
        for(int i=0;i<n;i++){
          int p1=0,p2=0;
          for(int j=i;j<n;j++)
            if(s[j]=='#')p1++;
            else break;
          for(int j=i;j>=0;j--)
            if(s[j]=='#')p2++;
            else break;
            sp=max(max(p1,p2),sp);
          p1=min(p1,p2);
          p=max(p,p1);
          d[i]=p1;
        }
        if(sp==n)s[0]='D';
        else for(int i=0;i<n;i++)
          if(d[i]==p){
            s[i]='D';
            break;
          }
      }

    }
    cout<<s<<endl;
  }
}