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<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 = 0;
    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=max(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 == 0?(n+1)/2:n/2+1;
  }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<bits/stdc++.h>
using namespace std;
typedef long long int lld;

int main(){
  int n,m;
  while(cin >> n >> m , n){
    string str = "";
    for(int i=0;i<n;i++) str += '#';
    for(int c=0;c<m;c++){
      char h; cin >> h;
      if(h == 'A'){
	for(int i=0;i<n;i++){
	  if(str[i] == '#'){
	    str[i] = h;
	    break;
	  }
	}
      } else if(h == 'B'){
	if(str[0] == '#' && str[1] != 'A') str[0] = h;
	else {
	  int first = -1;
	  if(str[n-1] == '#') first = n-1;
	  for(int i=n-1;i>=0;i--){
	    if(first == -1 && str[i] == '#') first = i;
	    if(i == n-1 && str[i] == '#' && str[i-1] != 'A'){
	      str[i] = h;
	      break;
	    } else if(i == 0 && str[i] == '#' && str[i+1] != 'A'){
	    } else if(str[i] == '#' && str[i-1] != 'A' && str[i+1] != 'A'){
	      str[i] = h;
	      break;
	    }
	    str[first] = h;
	  }
	}
      } else if(h == 'C'){
	if(c == 0) str[n/2] = h;
	else {
	  for(int i=0;i<n;i++){
	    if(str[i] != '#'){
	      if(str[i+1] == '#') {
		str[i+1] = h;
		break;
	      } else if(i-1 >= 0 && str[i-1] == '#') {
		str[i-1] = h;
		break;
	      }
	    }
	  }
	}
      } else {
	int first = -1;
	int idx = -1;
	int maxx = 0;
	for(int i=0;i<n;i++){
	  if(first == -1 && str[i] == '#') first = i;
	  if(str[i] != '#'){
	    int now = i;
	    int cnt = 0;
	    while(i+1 < n && str[i+1] == '#'){
	      if(first == -1 && str[i] == '#') first = i;
	      cnt++;
	      i++;
	    }
	    if(i+1 == n) {
	      if(cnt > maxx){
		maxx = cnt;
		idx = now + cnt;
	      }
	    }
	    else if(cnt > 2){
	      cnt = (cnt-1)/2;
	      if(cnt > maxx){
		maxx = cnt;
		idx = now + cnt + 1;
	      }
	    }
	  }
	}
	if(idx == -1) str[first] = h;
	else str[idx] = h;
      }
    }
    cout << str << endl;
  }
}

C++: #include <iostream>
#include <set>
#include <vector>
#include <string>
#include <utility>
#include <algorithm>
#include <stdio.h>
using namespace std;
typedef pair<int,int> P;
int chair[110];
int n,m;
void A(){
	int ans=0;
	while(chair[ans]!=0)ans++;
	chair[ans]=1;
	return;
}
void B(){
	for(int i=n-1;i>=0;i--){
		if(chair[i]==0){
			if(i==0&&chair[1]!=1){chair[0]=2;return;}
			else if(i==n-1&&chair[n-2]!=1){chair[n-1]=2;return;}
			else if(0<i&&i<n-1&&chair[i-1]!=1&&chair[i+1]!=1){chair[i]=2;return;}
		}
	}
	int ans=0;
	while(chair[ans]!=0)ans++;
	chair[ans]=2;
	return;
}
void C(){
	int ans=0;
	if(chair[0]!=0){
		while(chair[ans]!=0)ans++;
		chair[ans]=3;
		return;
	}
	for(int i=0;i<n;i++){
		if(chair[i]!=0){
			if(chair[i+1]==0)chair[i+1]=3;
			else chair[i-1]=3;
			return;
		}
	}
	if(n%2)chair[(n+1)/2-1]=3;
	else chair[n/2]=3;
	return;
}
void D(){
	int a=0,f=0;
	P bl[52];
	//printf("chair:");for(int i=0;i<n;i++)printf("%d ",chair[i]);
	bool in=false;
	for(int i=0;i<=n;i++){
		if(in&&chair[i]!=0){
			in=false;bl[a++]=P(f,i);
		}else if(!in&&chair[i]==0){
			in=true;f=i;
		}
	}
	//for(int i=0;i<a;i++)printf("bl[%d]:[%d,%d)\n",i,bl[i].first,bl[i].second);
	if(bl[0].first==0&&bl[0].second==n){
		chair[0]=4;return;
	}else{
		int mi,mlen=-1;
		for(int i=0;i<a;i++){
			int dis=(bl[i].second-bl[i].first-1)/2;
			if(bl[i].second==n)dis=bl[i].second-bl[i].first-1;
			if(dis>mlen){mlen=dis;mi=i;}
		}
		//printf("%d+%d[%d]\n",bl[mi].first,mlen,a);
		chair[bl[mi].first+mlen]=4;return;
	}
}
int main()
{
	while(cin>>n>>m&&(n||m)){
		fill(chair,chair+n,0);
		chair[n]=5;
		while(m--){
			char c;cin>>c;
			if(c=='A')A();
			if(c=='B')B();
			if(c=='C')C();
			if(c=='D')D();
		}
		for(int i=0;i<n;i++){
			if(chair[i]==0)cout<<'#';
			if(chair[i]==1)cout<<'A';
			if(chair[i]==2)cout<<'B';
			if(chair[i]==3)cout<<'C';
			if(chair[i]==4)cout<<'D';
		}
		cout<<endl;
	}
    return 0;
}