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 <cstdlib>
#include <string>
using namespace std;

char chair[128];
int n, m;
const int M = 2;

void A() {
	for(int i = 0; i < n; i++) {
		if(chair[i+M] == 'N') {
			chair[i+M] = 'A';
			break;
		}
	}
}

void B() {
	for(int i = n-1; i >= 0; i--) {
		if(chair[i+M] == 'N' && chair[i+1+M] != 'A' && chair[i-1+M] != 'A') {
			chair[i+M] = 'B';
			return;
		}
	}
	for(int i = 0; i < n; i++) {
		if(chair[i+M] == 'N') {
			chair[i+M] = 'B';
			return;
		}
	}
}

void C() {
	for(int i = 0; i < n; i++) {
		if(chair[i+M] != 'N') {
			if(chair[i+1+M] == 'N') {
				chair[i+1+M] = 'C';
				return;
			}
			else if(chair[i-1+M] == 'N') {
				chair[i-1+M] = 'C';
				return;
			}
		}
	}
	chair[n/2+M] = 'C';
}

void D() {
	int mx = 0;
	int indx = 0;
	for(int i = 0; i < n; i++) {
		if(chair[i+M] == 'N') {
			int mn = 1000;
			for(int j = 0; j < n; j++) {
				if(chair[j+M] != 'N') {
					if(mn > abs(j - i))
						mn = abs(j - i);
				}
			}
			if(mn > mx) {
				mx = mn;
				indx = i;
			}
		}
	}
	chair[indx+M] = 'D';
}

int main() {
	while(cin >> n >> m, n || m) {
		for(int i = 0; i < 128; i++)
			chair[i] = 'N';
		for(int i = 0; i < m; i++) {
			string s;
			cin >> s;
			if(s[0] == 'A')
				A();
			else if(s[0] == 'B')
				B();
			else if(s[0] == 'C')
				C();
			else
				D();
		}
		for(int i = 0; i < n; i++) {
			cout << (chair[i+M] == 'N' ? '#' : chair[i+M]);
		}
		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 (s[i] == '#' && (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;
			}
		}
	}
	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 <algorithm>

using namespace std;

int n, m;
char ch[102];

void funcA()
{
  for(int i = 1; i <= n; ++i)
    if(ch[i] == '#'){
      ch[i] = 'A';
      break;
    }

  return ;
}

void funcB()
{
  for(int i = n; i > 0; --i)
    if(ch[i] == '#' && ch[i-1] != 'A' && ch[i+1] != 'A'){
      ch[i] = 'B';
      return ;
    }

  for(int i = 1; i <= n; ++i)
    if(ch[i] == '#'){
      ch[i] = 'B';
      break;
    }

  return ;
}

void funcC()
{
  bool f = true;
  for(int i = 1; i <= n && f; ++i)
    if(ch[i] != '#') f = false;

  if(f){
    int t = (n%2 == 0)? (n/2+1): ((n+1)/2);
    ch[t] = 'C';
    return ;
  }

  for(int i = 1; i <= n; ++i)
    if(ch[i] != '#'){
      if(i+1 <= n && ch[i+1] == '#'){
	ch[i+1] = 'C';
	break;
      }
      if(i-1 > 0 && ch[i-1] == '#'){
	ch[i-1] = 'C';
	break;
      }
    }

  return ;
}

void funcD()
{
  int a[102], p;
  fill(a, a+102, 0);

  for(int i = 1; i <= n; ++i){
    if(ch[i] == '#'){
      p = i-1;
      while(0 < p && ch[p] == '#'){
	a[i]++;
	--p;
      }
      p = i+1;
      while(p <= n && ch[p] == '#'){
	a[i]++;
	++p;
      }
    } else {
      a[i] = -1;
    }
  }

  p = 1;
  for(int i = 2; i <= n; ++i)
    if(a[i] > a[p]) p = i;
  ch[p] = 'D';

  return ;
}

int main()
{
  char p;

  while(cin>>n>>m && (n+m)){
    fill(ch, ch+102, '#');
    while(m--){
      cin >> p;
      if(p == 'A') funcA();
      if(p == 'B') funcB();
      if(p == 'C') funcC();
      if(p == 'D') funcD();
    }

    for(int i = 1; i <= n; ++i) cout << ch[i];
    cout << endl;
  }

  return 0;
}

C++: #include<iostream>
using namespace std;
int main(){
long n,m,i,j,d[101],e[101],k,dd;
char c,a[101];
while(cin>>n){
cin>>m;
if(n==0)break;
for(i=0;i<n;i++)a[i]='#';
for(j=0;j<m;j++){
cin>>c;
if(c=='A'){
for(i=0;i<n;i++)if(a[i]=='#'){a[i]='A';break;}
}else if(c=='B'){
for(i=n-1;i>=0;i--)if(a[i]!='A'){a[i]='B';break;}
if(i<0){for(i=0;i<n;i++)if(a[i]=='#')a[i]='B';}
}else if(c=='C'){
for(i=0;i<n;i++){
if(a[i]!='#'){
if(i<n-1&&a[i+1]=='#'){a[i+1]='C';break;}
else if(i>0&&a[i-1]=='#'){a[i-1]='C';break;}
}
}
if(i==n)a[n/2+1]='C';
}else if(c=='D'){
for(i=0;i<n;i++)d[i]=-1;
for(i=0;i<n;i++)if(a[i]!='#')break;
if(i==n){a[0]='D';continue;}
for(;i<n;i++)if(a[i]=='#')d[i]=d[i-1]+1;else d[i]=0;
for(i=0;i<n;i++)e[i]=-1;
for(i=n-1;i>=0;i--)if(a[i]!='#')break;
for(;i>=0;i--)if(a[i]=='#')e[i]=e[i+1]+1;else e[i]=0;
for(i=0;i<n;i++)if(d[i]<e[i])d[i]=e[i];
dd=d[n-1];
for(i=n-1;i>=0;i--)if(dd<=d[i]){dd=d[i];k=i;}
a[k]='D';
}
}
a[n]=0;cout<<a<<endl;
}
return 0;
}