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[101],f,g,h,i,j,aa,k,ss,dd,ff,gg,xx,cc;
	char z[2];
	while(1){
		scanf("%d %d",&a,&s);
		if(a==0&&s==0) break;
		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;
						break;
					}
				}
			}
			else if(z[0]=='B'){
				aa=0;
				for(j=a-1;j>=0;j--){
					if(d[j]==0){
						if(j==a-1){
							if(d[j-1]!=1){
								d[j]=2;
								aa=1;
								break;
							}
						}
						else if(j==0){
							if(d[1]!=1){
								d[j]=2;
								aa=1;
								break;
							}
						}
						else{
							if(d[j-1]!=1&&d[j+1]!=1){
								d[j]=2;
								aa=1;
								break;
							}
						}
					}
				}
				if(aa==0){
					for(j=0;j<a;j++){
						if(d[j]==0){
							d[j]=2;
							break;
						}
					}
				}
			}
			else if(z[0]=='C'){
				aa=0;
				for(j=0;j<a;j++){
					if(d[j]!=0){
						aa=1;
						break;
					}
				}
				if(aa==0) d[a/2]=3;
				else if(aa==1){
					for(j=0;j<a;j++){
						if(d[j]!=0){
							if(j!=0&&d[j-1]==0){
								d[j-1]=3;
								break;
							}
							else if(d[j+1]==0){
								d[j+1]=3;
								break;
							}
						}
					}
				}
			}
			else if(z[0]=='D'){
				aa=0;
				ss=0;
				ff=0;
				gg=0;
				for(j=0;j<a;j++){
					if(d[j]!=0){
						gg=1;
						break;
					}
				}
				if(gg==0) d[0]=4;
				else{
					for(j=a-1;j>=0;j--){
						dd=0;
						xx=0;
						if(d[j]==0){
							ss=j;
							for(k=j;k>=0;k--){
								if(k==a-1) xx=2;
								if(d[k]!=0){
									break;
								}
								if(k==0) xx=1;
								dd++;
							}
						}
						//printf("%d  %d\n",j,dd);
						if(xx==2&&aa<=dd*2){
							aa=dd*2;
							ff=ss;
							cc=1;
						}
						if(xx==1&&aa<=dd*2){
							aa=dd*2;
							ff=ss;
							cc=2;
						}
						if(xx==0){
							if(aa<=dd){
								aa=dd;
								ff=ss;
								cc=0;
							//	printf("%d %d %d\n\n",ff,dd,dd/2);
							}
						}
					}
				//	printf("%d %d %d\n\n",aa,dd,cc);
					if(cc==2) d[0]=4;
					if(cc==1) d[aa/2]=4;
					if(cc==0) d[ff-(aa/2)]=4;
				}
			}
			/*for(j=0;j<a;j++){
				if(d[j]==0) printf("#");
				else if(d[j]==1) printf("A");
				else if(d[j]==2) printf("B");
				else if(d[j]==3) printf("C");
				else if(d[j]==4) printf("D");
			}
			printf("\n");*/
		}
		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 <string>
#include <iostream>
#include <algorithm>
using namespace std;
int n, q; char c; bool flag, flag1, flag2;
int main() {
	while (cin >> n >> q, n) {
		string s(n, '#');
		for(int l = 0; l < q; l++) {
			cin >> c;
			switch (c) {
			case 'A':
				for (int i = 0; i < n; i++) {
					if (s[i] == '#') {
						s[i] = 'A'; break;
					}
				}
				break;
			case 'B':
				flag = false;
				for (int i = n - 1; i >= 0; i--) {
					if (s[i] != '#') continue;
					flag2 = true;
					for (int j = -1; j <= 1; j += 2) {
						if (0 <= i + j && i + j < n && s[i + j] == 'A') flag2 = false;
					}
					if (flag2) {
						s[i] = 'B'; flag = true; break;
					}
				}
				if (!flag) {
					for (int i = 0; i < n; i++) {
						if (s[i] == '#') {
							s[i] = 'B'; break;
						}
					}
				}
				break;
			case 'C':
				flag1 = false;	
				if (l == 0) {
					s[n / 2] = false; break;
				}
				for (int i = 0; i < n; i++) {
					for (int j = 1; j >= -1; j -= 2) {
						if (0 <= i + j && i + j < n && s[i + j] == '#') {
							s[i + j] = 'C'; flag1 = true; break;
						}
					}
					if (flag1) break;
				}
				break;
			case 'D':
				int ptr = -1, ret = -1;
				for (int i = 0; i < n; i++) {
					int res = 999999999;
					for (int j = 0; j < n; j++) {
						if (s[j] != '#') res = min(res, abs(i - j));
					}
					if (ret < res) ptr = i, ret = res;
				}
				s[ptr] = 'D';
				break;
			}
			cout << s << endl;
		}
	}
}