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

int main(){
    while(1){
        int n, m; cin>>n>>m;
        if(n == 0) return 0;

        string s = "";
        for(int i=0; i<n; i++){
            s += "#";
        }

        while(m--){
            char a; cin>>a;
            if(a == 'A'){
                for(int i=0; i<n; i++){
                    if(s[i] == '#'){
                        s[i] = 'A';
                        break;
                    }
                }
            }
            else if(a == 'B'){
                bool valid = false;
                for(int i=n-1; i>=0; i--){
                    if(s[i] != '#') continue;

                    if((i + 1 < n && s[i+1] == 'A') || (0 <= i - 1 && s[i-1] == 'A')) continue;
                
                    s[i] = 'B';
                    valid = true;
                    break;
                }

                if(valid) continue;

                for(int i=0; i<n; i++){
                    if(s[i] == '#'){
                        s[i] = 'B';
                        break;
                    }
                }
            }
            else if(a == 'C'){
                bool valid = false;
                for(int i=0; i<n; i++){
                    if(s[i] != '#'){
                        if(i + 1 < n && s[i+1] == '#'){
                            s[i+1] = 'C';
                            valid = true;
                            break;
                        }
                        
                        if(0 <= i - 1 && s[i-1] == '#'){
                            s[i-1] = 'C';
                            valid = true;
                            break;
                        }
                    }
                }

                if(valid) continue;

                s[n/2] = 'C';
            }
            else{
                int dist = 0;
                int id = -1;
                for(int i=0; i<n; i++){
                    if(s[i] != '#') continue;
                    int near = 1e9;
                    for(int j=0; j<n; j++){
                        if(i == j || s[j] == '#') continue;
                        
                        near = min(near, abs(i - j));
                    }

                    if(near == 1e9) continue;

                    if(dist < near){
                        dist = near;
                        id = i;
                    }
                }

                if(id != -1){
                    s[id] = 'D';
                }
                else{
                    s[0] = 'D';
                }
            }
        }

        cout << s << endl;
    }
}

C++: #include <cstdio>
#include <cstdlib>
#include <cmath>
#include <climits>
#include <cfloat>
#include <map>
#include <utility>
#include <set>
#include <iostream>
#include <memory>
#include <string>
#include <vector>
#include <algorithm>
#include <functional>
#include <sstream>
#include <complex>
#include <stack>
#include <queue>
#include <cstring>
#include <sstream>
#include <cassert>
#include <list>
using namespace std;
static const double EPS = 1e-10;
typedef long long ll;
typedef pair<int,int> PI;
typedef vector<int> vi;
#ifndef M_PI
#define M_PI 3.14159265358979323846
#endif
#define rep(i,n) for(int i=0;i<(int)n;++i)
#define FOR(i,c) for(__typeof((c).begin())i=(c).begin();i!=(c).end();++i)
#define ALL(c) (c).begin(), (c).end()
#define mp(a,b) make_pair(a,b)
#define pb(a) push_back(a)
#define F first
#define S second

int dx[]={0,1,0,-1},dy[]={1,0,-1,0};

int seki[101];

main(){
  int m,n;
  while(cin>>n>>m,n|m){
    string seat;
    rep(i,n)seat+='#';

    rep(i,m){
      //cout<<seat<<endl;
      char c;
      int pos=0;
      cin>>c;
      switch(c){
      case 'A':
	pos=0;
	while(seat[pos]!='#')++pos;
	seat[pos]='A';
	break;
      case 'B':
	pos=n-1;
	while(true){
	  if(pos<0)break;
	  if(seat[pos]!='#'){
	    --pos;
	    continue;
	  }
	  if(pos && seat[pos-1]=='A'){
	    --pos;
	    continue;
	  }
	  if(pos+1<n && seat[pos+1]=='A'){
	    --pos;
	    continue;
	  }
	  seat[pos]='B';
	  break;
	}
	if(pos==n){
	  pos=0;
	  while(seat[pos]!='#')++pos;
	  seat[pos]='B';
	}
	break;
      case 'C':
	if(i==0){
	  if(n%2)seat[(n+1)/2]='C';
	  else seat[n/2+1]='C';
	}else{
	  pos=0;
	  while(seat[pos]!='#')++pos;
	  seat[pos]='C';
	}
	break;
      case 'D':
	if(i==0){
	  seat[0]='D';
	  continue;
	}
	memset(seki,0,sizeof(0));
	int maxt=0,maxpos=0;

	if(seat[0]=='#'){
	  seki[0]=1;
	  maxt=1;
	  maxpos=1;
	}
	pos=1;
	while(pos<n){
	  if(seat[pos]=='#')seki[pos]=seki[pos-1]+1;
	  else seki[pos]=0;
	  if(seki[pos]>maxt){
	    maxt=seki[pos];
	    maxpos=pos;
	  }
	  ++pos;
	}
	//rep(j,n)cout<<seki[j]<<" ";
	//cout<<endl;
	//cout<<maxpos<<" "<<maxt<<endl;
	if(maxpos==n-1)seat[n-1]='D';
	else if(maxt%2)seat[maxpos-maxt/2]='D';
	else seat[maxpos-maxt/2]='D';
	break;
      }
    }
    cout<<seat<<endl;
  }
}