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<iostream>
#include<vector>
#include<string>
#include<algorithm>
#include<map>
#include<set>
#include<utility>
#include<cmath>
#include<cstring>
#include<queue>
#include<cstdio>
#include<sstream>
#define loop(i,a,b) for(int i=a;i<b;i++) 
#define rep(i,a) loop(i,0,a)
#define pb push_back
#define mp make_pair
#define all(in) in.begin(),in.end()
const double PI=acos(-1);
const double EPS=1e-10;
const int inf=1e8;
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<int,int> pii;
int main(){
	int n,m;
	while(cin>>n>>m,n){
		vector<string>in(n,"");
//		rep(i,n)cin>>in[i];//
//		rep(i,n)if(in[i]=="0")in[i]="";
		rep(q,m){
			string s;cin>>s;
			if(s=="A"){
				rep(i,n)if(in[i]==""){
					in[i]="A";
					break;
				}
			}else if(s=="B"){
				vector<string>tmp=in;
				rep(i,n)if(in[i]=="A"){
					if(i)tmp[i-1]="!";
					if(i!=n-1)tmp[i+1]="!";
				}
				int I=inf;
				for(int i=n-1;i>=0;i--)if(tmp[i]==""){I=i;break;}
				if(I==inf){
					rep(i,n)if(in[i]==""){
						I=i;
						break;
					}
				}
				in[I]="B";
			}else if(s=="C"){
				if(!q){
					in[n/2]="C";
					continue;
				}
				rep(i,n)if(in[i]!=""){
					if(i!=n-1&&in[i+1]==""){
						in[i+1]="C";
						break;
					}else if(i&&in[i-1]==""){
						in[i-1]="C";
						break;
					}
				}
			}else{
				if(!q){
					in[0]="D";
					continue;
				}
				vi t;
				rep(i,n)if(in[i]!="")t.pb(i);
				int ma=t[0],mai=0;
				rep(i,t.size()-1){
					if(ma<(t[i+1]-t[i])/2){
						ma=(t[i+1]-t[i])/2;
						mai=t[i]+(t[i+1]-t[i])/2;
					}
				}
				if(ma<n-t[t.size()-1]-1){
					mai=n-1;
				}
				in[mai]="D";
			}
		}
		rep(i,n)cout<<(in[i]==""?"#":in[i]);
		cout<<endl;
	}
}

C++: #include<iostream>
using namespace std;
#define REP(i,b,n) for(int i=b;i<n;i++)
#define rep(i,n)   REP(i,0,n)

int findlm(int n,char *in){
  rep(i,n)if(in[i] == 0)return i;
}

int findNotA(int n,char *in){
  for(int i=n-1;i>=0;i--){
    if (in[i] == 0 && (i==0||in[i-1]!= 'A') && (i == n-1 || in[i+1] != 'A'))return i;
  }
  return -1;
}

int nextP(int n,char *in){
  rep(i,n){
    if (in[i] != 0){
      if (i < n-1 && in[i+1] == 0)return i+1;
      if (i >0 && in[i-1] == 0)return i-1;
    }
  }
  return -1;
}

int notNextP(int n,char *in){
  int ret = -1,maxdist=0;
  rep(i,n){
    if( in[i] != 0)continue;
    int tmpdist = 100000;
    for(int j=i-1;j>=0;j--){
      if (in[j] != 0){tmpdist=i-j;break;}
    }
    for(int j=i+1;j<n;j++){
      if (in[j] != 0){tmpdist=min(tmpdist,j-i);break;}
    }
    if (tmpdist > maxdist)ret=i,maxdist = tmpdist;
  }
  return ret;
}

void put(int n,char *in,char inp){
  int index = -1;
  if (inp == 'A'){
    index = findlm(n,in);
  }else if (inp == 'B'){
    index = findNotA(n,in);
    if (index == -1)index = findlm(n,in);
  }else if (inp == 'C'){
    index = nextP(n,in);
    if (index == -1)index =n/2;
  }else if (inp == 'D'){
    index = notNextP(n,in);
    if (index == -1)index = 0;
  }
  in[index] = inp;
}


main(){
  char op[255];
  op['A']='A';  op['B']='B';  op['C']='C';  op['D']='D';
  op[0]='#';

  int n,m;
  char in[100];
  while(cin>>n>>m && n){
    rep(i,n)in[i] = 0;
    rep(i,m){
      char inp;
      cin>>inp;
      put(n,in,inp);
    }
    rep(i,n)cout << op[in[i]] ;
    cout << endl;
  }


}

C++: #include<stdio.h>
#include<algorithm>
using namespace std;
char str[101];
char c[2];
int p[100];
int ABS(int a){return a<0?-a:a;}
int main(){
	int a,b;
	while(scanf("%d%d",&a,&b),a+b){
		for(int i=0;i<a;i++)str[i]='#';
		str[a]=0;
		bool ok;
		for(int i=0;i<b;i++){
			scanf("%s",c);
			switch(c[0]){
				case 'A':
					for(int j=0;j<a;j++)
						if(str[j]=='#'){
							str[j]='A';
							break;
						}
					break;
				case 'B':
					ok=false;
					for(int j=a-1;j>=0;j--){
						if(str[j]=='#'&&(j==0||str[j-1]!='A')&&str[j+1]!='A'){
							ok=true;
							str[j]='B';
							break;
						}
					}
					if(!ok){
						for(int j=0;j<a;j++)
							if(str[j]=='#'){
								str[j]='B';
								break;
							}
					}
					break;
				case 'C':
					if(i==0){
						str[a/2]='C';
					}else{
						for(int j=0;j<a;j++){
							if(str[j]!='#'){
								if(str[j+1]=='#'){
									str[j+1]='C';
									break;
								}else if(j&&str[j-1]=='#'){
									str[j-1]='C';
									break;
								}
							}
						}
					}
					break;
				case 'D':
					for(int j=0;j<a;j++)p[j]=9999;
					for(int j=0;j<a;j++){
						if(str[j]!='#'){
							for(int k=0;k<a;k++)p[k]=min(p[k],ABS(j-k));
						}
					}
					int at=0;
					int cost=0;
					for(int j=0;j<a;j++){
						if(cost<p[j]){at=j;cost=p[j];}
					}
					str[at]='D';
					break;
			}
			//	printf("%s\n",str);
		}
		printf("%s\n",str);
	}
}