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<iostream>
using namespace std;

int N;
int table[128];

void doA() {
  for(int i = 0; i < N; i++) if( table[i] == '#' ) {
      table[i] = 'A';
      return;
    }
}

void doB() {
  for(int i = N - 1; i >= 0; i--) {

    if( table[i] == '#' ) {
      
      bool a = false;
      if( i - 1 >= 0 && table[i - 1] == 'A' ) a = true;
      if( i + 1 < N && table[i + 1] == 'A' ) a = true;
      
      if( ! a ) {
        table[i] = 'B';
        return;
      }
    }    
  }

  for(int i = 0; i < N; i++) if( table[i] == '#' ) {
      table[i] = 'B';
      return;
    }

}

void doC() {
  for(int i = 0; i < N; i++) {
    if( table[i] != '#' ) {
      if( i + 1 < N && table[i + 1] == '#' ) {
        table[i + 1] = 'C'; return;
      }

      if( i - 1 < N && table[i - 1] == '#' ) {
        table[i - 1] = 'C'; return;
      }

    }
  }

  if( N & 1 ) table[(N + 1) / 2 - 1] = 'C';
  else table[N / 2] = 'C';
}

void doD() {
  static int temp[128];
  for(int i = 0; i < 128; i++) temp[i] = 987654321;
  
  for(int i = 0; i < N; i++) {
    if( table[i] != '#' ) 
      temp[i] = -1;
    else 
      for(int j = 0; j < N; j++) 
        if( table[j] != '#' ) {
          temp[i] = min( temp[i], abs(i - j));
        }
  }
  
  int best = 0;
  for(int i = 0; i < N; i++) 
    if( temp[best] < temp[i] )
      best = i;
  
  table[best] = 'D';
}

int main() {
  for(int M; cin >> N >> M, (N || M); ) {

    for(int i = 0; i < N; i++) table[i] = '#';

    for(int m = 0; m < M; m++) {
      char ch; cin >> ch;
      if( ch == 'A' ) doA();
      if( ch == 'B' ) doB();
      if( ch == 'C' ) doC();
      if( ch == 'D' ) doD();
    }
    for(int i = 0; i < N; i++) cout << (char)(table[i]); cout << endl;
  }
}

C++: #include <string>
#include <vector>
#include <iostream>
#include <algorithm>
using namespace std;
void solve1(string& s, char c) {
	s[s.find('#')] = c;
}
void solve2(string& s) {
	for (int i = s.size() - 1; i >= 0; i--) {
		if ((i < s.size() - 1 && s[i + 1] != 'A') && (i > 0 && s[i - 1] != 'A')) {
			s[i] = 'B'; return;
		}
	}
	solve1(s, 'B');
}
vector<int> dist(string& s) {
	vector<int> ret(s.size(), 999999999);
	for (int i = 0; i < s.size(); i++) {
		if (s[i] != '#') {
			for (int j = 0; j < s.size(); j++) {
				ret[j] = min(ret[j], abs(i - j));
			}
		}
	}
	return ret;
}
void solve3(string &s) {
	for (int i = 0; i < s.size(); i++) {
		if (s[i] != '#') {
			if (i < s.size() - 1 && s[i + 1] == '#') {
				s[i + 1] = 'C'; return;
			}
			if (i > 0 && s[i - 1] == '#') {
				s[i - 1] = 'C'; return;
			}
		}
	}
	if (s.size() % 2 == 1) s[(s.size() - 1) / 2] = 'C';
	else s[s.size() / 2] = 'C';
}
void solve4(string &s) {
	vector<int> ret = dist(s);
	s[max_element(ret.begin(), ret.end()) - ret.begin()] = 'D';
}
int N, Q;
int main() {
	while (cin >> N >> Q, N) {
		string s(N, '#'), t;
		while (Q--) {
			cin >> t;
			if (t == "A") solve1(s, 'A');
			if (t == "B") solve2(s);
			if (t == "C") solve3(s);
			if (t == "D") solve4(s);
		}
		cout << s << endl;
	}
	return 0;
}

C++: #include <iostream>
#include <vector>
#include <algorithm>
using namespace std;

void seatA(string& seats)
{
  for (string::iterator it(seats.begin()); it != seats.end(); ++it) {
    if (*it == '#') {
      *it = 'A';
      return;
    }
  }
}

void seatB(string& seats)
{
  string::reverse_iterator fallback = seats.rend();
  for (string::reverse_iterator it(seats.rbegin()); it != seats.rend(); ++it) {
    if (*it == '#') {
      // right
      if ((it == seats.rbegin() || *(it-1) != 'A')
          && (it+1 != seats.rend() || *(it+1) != 'A')) {
        *it = 'B';
        return;
      }
      fallback = it;
    }
  }
  *fallback = 'B';
}

void seatC(string& seats)
{
  for (string::iterator it(seats.begin()); it != seats.end(); ++it) {
    if (*it != '#') {
      if (it != seats.end() && *(it+1) == '#') {
        *(it+1) = 'C';
        return;
      }
      if (it != seats.begin() && *(it-1) == '#') {
        *(it-1) = 'C';
      }
    }
  }
  seats[seats.size()/2] = 'C';
}

void seatD(string& seats)
{
  vector<int> tbl(seats.size(), 1000);
  for (string::size_type i = 0; i < seats.size(); i++) {
    if (seats[i] != '#') {
      for (vector<int>::size_type j = 0; j < tbl.size(); j++) {
        tbl[j] = min(tbl[j], abs(static_cast<int>(i - j)));
      }
    }
  }
  if (tbl.front() == 1000) {
    seats[0] = 'D';
  } else {
    string::size_type pos = 0;
    int m = -1;
    for (string::size_type i = 0; i < seats.size(); i++) {
      if (tbl[i] > m) {
        m = tbl[i];
        pos = i;
      }
    }
    seats[pos] = 'D';
  }
}

int main()
{
  int n, m;
  while (cin >> n >> m && n != 0) {
    string seats(n, '#');
    for (int i = 0; i < m; i++) {
      string s;
      cin >> s;
      if (s == "A") {
        seatA(seats);
      } else if (s == "B") {
        seatB(seats);
      } else if (s == "C") {
        seatC(seats);
      } else {
        seatD(seats);
      }
    }
    cout << seats << endl;
  }
  return 0;
}