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<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{
						ok=false;
						for(int j=0;j<a;j++){
							if(str[j]!='#')ok=true;
							if(ok&&str[j]=='#'){
								str[j]='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];}
					}
			//		printf("%d %d\n",at,cost);
					str[at]='D';
					break;
			}
			//	printf("%s\n",str);
		}
		printf("%s\n",str);
	}
}

C++: #include <iostream>
#include <algorithm>

#define MAX 100

using namespace std;

int n,m;
char chair[MAX+1];
 
void A(){
  for(int i = 0 ; i < n ; i++){
    if(chair[i] == '#'){
      chair[i] = 'A';
      return;
    }
  }
}

void B(){
  int pos = -1;
  
  for(int i = 0 ; i < n ; i++){
    if(chair[i] == 'A'){
      pos = i;
      break;
    }
  }
  
  if(pos == -1){
    for(int i = n-1 ; i >= 0 ; i--){
      if(chair[i] == '#'){
        chair[i] = 'B';
        return;
      } 
    }
  }
  else{
    for(int i = n-1 ; i > 0 ; i--){
      if(i == n-1){
	if(chair[i-1] != 'A'){
	  chair[i] = 'B';
	  return;
	}
      }else{
	if(chair[i] == '#' && chair[i-1] != 'A' && chair[i+1] != 'A'){
	  chair[i] = 'B';
	  return;
	}
      }
    }
 
    for(int i = 0 ; i < n ; i++){
      if(chair[i] == '#'){
        chair[i] = 'B';
        return;
      }
    }
  }
}
 
void C(){
  int cnt = count(chair,chair+n,'#');
 
  if(cnt == n){
    if(n % 2){
      chair[(n+1)/2] = 'C';
    }
    else{
      chair[n/2+1] = 'C';
    }
  }
  else{
    for(int i = 0 ; i < n ; i++){
      if(chair[i] != '#' && i != n-1 && chair[i+1] == '#'){
        chair[i+1] = 'C';
        return;
      }else if(chair[i] != '#' && i > 0 && chair[i-1] == '#'){
        chair[i-1] = 'C';
        return;
      }
    }
  }
}
 
void D(){
  int Breadth = 0, pos;
  int cnt = count(chair,chair+n,'#');

  if(cnt == n){
    chair[0] = 'D';
    return;
  } 

  for(int i = 0 ; i < n ; i++){
    int dist = (1<<29);
    if(chair[i] != '#') continue;
    for(int j = 0 ; j < n ; j++){
      if(chair[j] != '#'){
        dist = min(dist,abs(j-i));
      }
    }
    if(Breadth < dist){
      Breadth = dist;
      pos = i;
    } 
  }
 
  chair[pos] = 'D';
}
 
int main(){
  while(cin >> n >> m , n | m){
    char person;
 
    for(int i = 0 ; i < n ; i++)
      chair[i] = '#';
 
    for(int i = 0 ; i < m ; i++){
      cin >> person;
      
      switch(person){
      case 'A': 
        A(); 
        break;
      case 'B': 
        B(); 
        break;
      case 'C': 
        C(); 
        break;
      case 'D': 
        D(); 
        break;
      }
 
    }
 
    for(int i = 0 ; i < n ; i++){
      cout << chair[i];
    }
    cout << endl;
  }
 
  return 0;
}