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 <bits/stdc++.h>
using namespace std;
// 12:46

string chair;


int goA(char c){
	for(int i = 0 ; i < chair.size() ; i++)
		if( chair[i] == '#'){
			chair[i] = c;
			return 1;
		}
	return 0;
}
int goB(char c){
	for(int i = chair.size() -1  ; i >= 0 ; i--)
		if( chair[i] == '#' && (!i||chair[i-1]!='A') && (i+1==chair.size()||chair[i+1]!='A') ){
			chair[i] = c;
			return 1;
		}
	return goA(c);
}
int goC(char c){
	for(int i = 0 ; i < chair.size() ; i++)
		if( chair[i] != '#'){
			for(int j = 1 ; j >= -1 ; j--){
				if( i+j >= 0 && i+j < chair.size() && chair[i+j] == '#' ){
					chair[i+j] = c;
					return 1;
				}
			}
		}
	return 0;
}
int goD(char c){
	int pos;
	int dst = 2e9;
	for(int i = 0 ; i < chair.size() ; i++){
		if( chair[i] == '#' ){
			int dist = 1e9;
			for(int j = 0 ; j < chair.size() ; j++)
				if( chair[j] != '#') dist = min(dist,abs(i-j));

			if( dst > dist){
				dst = dist;
				pos = i;
			}
		}
	}
	chair[pos] = c;
	return 1;
}


int main(){
	int n,m;
	while( cin >> n >> m && n ){
		chair = string(n,'#');
		for(int i = 0 ; i < m ; i++){
			char c; cin >> c;
			if( c == 'A' ) goA(c);
			if( c == 'B' ) goB(c);
			if( c == 'C' ) goC(c);
			if( c == 'D' ) goD(c);
		}
		cout << chair << endl;
	}
}

C++: #include <bits/stdc++.h>
using namespace std;

const int INF = (1 << 30) - 1;

int N, M;
char seat[105];

int left_insert()
{
    int k = 1;
    while ( k <= N && seat[k] != '#') {
        k++;
    }
    return ( k );
}

int main()
{

    while ( cin >> N >> M, N || M ) {

        fill_n(seat, 105, '#');
        for ( int i = 0; i < M; i++ ) {
            char c;
            bool flag = false;
            int d[105];
            int k;

            cin >> c;
            fill_n(d, 105, INF);
            switch ( c ) {
                case 'A' :
                    seat[ left_insert() ] = 'A';
                    break;
                case 'B' :
                    k = N;
                    while ( k > 0 && seat[k] != '#' && (seat[k - 1] == 'A' || seat[k + 1] == 'A') ) {
                        k--;
                    }
                    if ( k > 0 ) {
                        seat[k] = 'B';
                    } else {
                        seat[ left_insert() ] = 'B';
                    }
                    break;
                case 'C' :
                    for ( int i = 1; i <= N; i++ ) {
                        if ( seat[i] != '#' ) {
                            if ( i < N && seat[i + 1] == '#' ) {
                                seat[i + 1] = 'C';
                                flag = true;
                                break;
                            }
                            if ( i > 1 && seat[i - 1] == '#' ) {
                                seat[i - 1] = 'C';
                                flag = true;
                                break;
                            }
                        }
                    }
                    if ( !flag ) {
                        seat[N / 2 + 1] = 'C';
                    }
                    break;
                case 'D' :
                    for ( int i = 1; i <= N; i++ ) {
                        if ( seat[i] != '#' ) {
                            d[i] = 0;
                        }
                        d[i] = min(d[i - 1] + 1, d[i]);
                    }
                    for ( int i = N; i > 0; i-- ) {
                        d[i] = min(d[i], d[i + 1] + 1);
                    }
                    int maxp = 1;
                    for ( int i = 2; i <= N; i++ ) {
                        if ( d[i] > d[maxp] ) {
                            maxp = i;
                        }
                    }
                    seat[maxp] = 'D';
                    break;
            }
        }
        for ( int i = 1; i <= N; i++ ) {
            cout << seat[i];
        }
        cout << endl;
    }
}

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;
	}
	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;
}