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<string.h>
#include<math.h>
int main(void)
{
	int a,s,d[100],f,g,h,i,j,k,c,x[3],o;
	char z[2];
	while(1){
		scanf("%d %d",&a,&s);
		if(a==0&&s==0) break;
		f=a;
		for(i=0;i<a;i++) d[i]=0;
		for(i=0;i<s;i++){
			scanf("%s",z);
			if(z[0]=='A'){
				for(j=0;j<a;j++){
					if(d[j]==0){
						d[j]=1;
						f--;
						break;
					}
				}
			}
			else if(z[0]=='B'){
				g=0;
				for(j=a-1;j>=0;j--){
					if(d[j]==0&&d[j+1]!=1&&d[j-1]!=1){
						d[j]=2;
						f--;
						break;
					}
					if(d[j]==0) g++;
					if(f==g){
						d[j]=2;
						f--;
						break;
					}
				}
			}
			else if(z[0]=='C'){
				if(a==f){
					if(a%2==1){
						d[((a+1)/2)-1]=3;
						f--;
					}
					else if(a%2==0){
						d[a/2]=3;
						f--;
					}
				}
				else if(a>f){
					for(j=0;j<a;j++){
						if(d[j]>0){
							if(d[j+1]==0&&j+1<a){
								d[j+1]=3;
								f--;
								break;
							}
							else if(d[j-1]==0&&j-1>=0){
								d[j-1]=3;
								f--;
								break;
							}
						}
					}
				}
			}
			else if(z[0]=='D'){
				h=-1;
				c=-1;
				int v=0;
				x[0]=0;
				x[1]=0;
				for(j=a-1;j>=0;j--){
					if(d[j]>0&&v==0){
						h=j;
						if(d[0]==0){
							x[0]=h-1;
							x[1]=0;
						}
						v=1;
					}
					else if(d[j]>0&&v==1){
						c=j;
					}
					if(c>-1&&h>-1){
						if((h-c)%2==1){
							if(x[0]<=((h-c)/2-1)){
								x[0]=(h-c)/2-1;
								x[1]=h-(h-c)/2-1;
							}
						}
						else if((h-c)%2==0){
							if(x[0]<=(h-c)/2){
								x[0]=(h-c)/2;
								x[1]=h-(h-c)/2;
							}
						}
					}
					if(c>-1) h=c;
				}
				if(d[a-1]==0){
					if(x[0]<(a-1)-c){
						x[0]=(a-1)-c;
						x[1]=a-1;
					}
				}
				if(h==-1) x[1]=0;
				else if(c==-1){
					x[0]=(a-1)-h;
					x[1]=a-1;
					if(x[0]<h) x[1]=0;
				}
				d[x[1]]=4;
				f--;
			}
		}
		for(i=0;i<a;i++){
			if(d[i]==0) printf("#");
			else if(d[i]==1) printf("A");
			else if(d[i]==2) printf("B");
			else if(d[i]==3) printf("C");
			else if(d[i]==4) printf("D");
		}
		printf("\n");
	}
	return 0;
}

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

int main()
{
  int n, m;
  while (cin >> n >> m) {
    string chair(n, '#');

    while (m--) {
      string a;
      cin >> a;
      if (a == "A") {
	for (int i = 0; i < n; ++i) {
	  if (chair[i] == '#') {
	    chair[i] = 'A';
	    break;
	  }
	}
      } else if (a == "B") {
	bool sit = false;
	for (int i = n-1; i > 0; --i) {
	  if (i == 0 && chair[i+1] != 'A') {
	    chair[i] = 'B';
	    sit = true;
	    break;
	  } else if (i == n-1 && chair[i] == '#' && chair[i-1] != 'A') {
	    chair[i] = 'B';
	    sit = true;
	    break;
	  } else if (chair[i] == '#' &&  chair[i+1] != 'A' && chair[i-1] != 'A') {
	    chair[i] = 'B';
	    sit = true;
	    break;
	  }
	}
	if (sit)
	  continue;

	for (int i = 0; i < n; ++i) {
	  if (chair[i] == '#') {
	    chair[i] = 'B';
	    break;
	  }
	}
      } else if (a  == "C") {
	bool sit = false;
	for (int i = 0; i < n; ++i) {
	  if (i == 0 && chair[i] != '#' && chair[i+1] == '#') {
	    chair[i+1] = 'C';
	    sit = true;
	    break;
	  } else if (i == n-1 && chair[i] != '#' && chair[i-1] == '#') {
	    chair[i+1] = 'C';
	    sit = true;
	    break;
	  } else if (chair[i] != '#') {
	    if (chair[i+1] == '#') {
	      chair[i+1] = 'C';
	      sit = true;
	      break;
	    } else if (chair[i-1] == '#') {
	      chair[i+1] = 'C';
	      sit = true;
	      break;
	    }
	  }
	}
	if (sit)
	  continue;

	if (n&1)
	  chair[(n+1)/2-1] = 'C';
	else
	  chair[n/2] = 'C';
      } else {
	int maxIndex = -1, dist = -1;
	for (int i = 0; i < n; ++i) {
	  if (chair[i] != '#')
	    continue;

	  int right = 0;
	  if (i == n-1)
	    right = n;
	  for (int j = i+1; j < n; ++j) {
	    if (chair[j] == '#')
	      ++right;
	    else
	      break;
	  }

	  int left = 0;
	  if (i == 0)
	    left = n;
	  for (int j = i-1; j >= 0; --j) {
	    if (chair[j] == '#')
	      ++left;
	    else
	      break;
	  }

	  if (dist < min(right, left)) {
	    maxIndex = i;
	    dist = min(right, left);
	  }
	}
	chair[maxIndex] = 'D';
      }
    }

    cout << chair << endl;
  }
  return 0;
}

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;
}