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

  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(chair[i] == '#' && 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';
    }
    return;
  }
  else{
    for(int i = 0 ; i < n-1 ; i++){

      if(chair[i] != '#'){

	if(chair[i+1] == '#'){
	  chair[i+1] = 'C';
	  return;
	}
	else{

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

	}

      }

    }
  }

}

void D(){
  int Breadth = 0,pos;

  for(int i = 0 ; i < n ; i++){
    int dist = (1<<29);
    for(int j = 0 ; j < n ; j++){
      if(chair[j] != '#'){
	dist = min(dist,abs(i-j));
      }
    }
    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;
}

C++: #include<bits/stdc++.h>
using namespace std;
int main()
{
	int N,M;
	while(true){
		scanf("%d%d",&N,&M);
		if(N==0&&M==0)return 0;
		int seats[10009];
		for(int i=0;i<10009;i++){
			seats[i]=0;
		}
		
		for(int i=0;i<M;i++){
			string S;
			cin >> S;
			if(S=="A"){
				for(int j=0;j<N;j++){
					if(seats[j]==0){
						seats[j]=1;
						break;
					}
				}
			}
			else if(S=="B"){
				bool F=true;
				for(int j=N-1;j>=0;j--){
					if(F&&(j==0||seats[j-1]!=1)&&(j==N-1||seats[j+1]!=1)&&seats[j]==0){
						seats[j]=2;F=false;
					}
				}
				if(F){
					for(int j=0;j<N;j++){
						if(seats[j]==0){
							seats[j]=2;
							break;
						}
					}
				}
			}
			else if(S=="C"){
				bool F=true;bool FF=true;
				for(int j=0;j<N;j++){
					if(seats[j]!=0){
						FF=false;
					}
				}
				if(FF){
					seats[N/2]=3;
					F=false;
				}
				if(!F)continue;
				for(int j=0;j<N;j++){
					if(seats[j]!=0){
						if(F&&j!=N-1&&seats[j+1]==0){
							seats[j+1]=3;F=false;
						}
						else if(F&&j!=0&&seats[j-1]==0){
							seats[j-1]=3;F=false;
						}
					}
				}
			}
			else{
				int maxd=-1,maxi;
				bool F=true;
				for(int i=0;i<N;i++){
					if(seats[i]!=0)F=false;
				}
				if(F){
					seats[0]=4;
					continue;
				}
				for(int i=0;i<N;i++){
					int d=0;
					if(seats[i]!=0)d=-114;
					int l=i;int r=i;
					while((l<0||seats[l]==0)&&(r>=N||seats[r]==0)){
						d++;l--;r++;
					}
					if(maxd<d){
						maxd=d;
						maxi=i;
					}
				}
				seats[maxi]=4;
			}
			
		}
		for(int i=0;i<N;i++){
				if(seats[i]==0)printf("#");
				if(seats[i]==1)printf("A");
				if(seats[i]==2)printf("B");
				if(seats[i]==3)printf("C");
				if(seats[i]==4)printf("D");
			}
			printf("\n");
	}
}

C++: #include <cstdio>
#include <cstring>
#include <algorithm>
#include <string>
#include <cmath>
#include <stack>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <list>
#include <iostream>
#include <sstream>
#include <climits>
#include <cfloat>
#include <complex>

using namespace std;

int main()
{
	int n, m;
	while (scanf("%d %d", &n, &m), n | m)
	{
		char t[102];	// 1~n
		memset(t, '#', sizeof(t));
		for (int w = 0; w < m; ++w)
		{
			char c;
			scanf(" %c", &c);
			if (c == 'A')
			{
				int i;
				for (i = 1; t[i] != '#'; ++i)
					;
				t[i] = 'A';
			}
			else if (c == 'B')
			{
				int i;
				for (i = n; i >= 1; --i)
					if (t[i-1] != 'A' && t[i] == '#' && t[i+1] != 'A')
						break;
				if (i == 0)
					for (i = 1; t[i] != '#'; ++i)
						;
				t[i] = 'B';
			}
			else if (c == 'C')
			{
				int i;
				if (w == 0)
					i = n / 2 + 1;
				else
				{
					for (i = 1; ; ++i)
						if (t[i] != '#')
							if (t[i+1] == '#')
							{
								++i;
								break;
							}
							else if (t[i-1] == '#' && i > 1)
							{
								--i;
								break;
							}
				}
				t[i] = 'C';
			}
			else
			{
				int i;
				if (w == 0)
					i = 1;
				else
				{
					int dis[102];
					for (int j = 0; j < 102; ++j)
						dis[j] = 100000000;
					for (int j = 1; j <= n; ++j)
					{
						if (t[j] != '#')
							for (int k = 1; k <= n; ++k)
								dis[k] = min(dis[k], abs(j-k));
					}
					int d = 0;
					for (int j = 1; j <= n; ++j)
					{
						if (dis[j] > d)
						{
							i = j;
							d = dis[j];
						}
					}
				}
				t[i] = 'D';
			}
		}
		for (int i = 1; i <= n; ++i)
			putchar(t[i]);
		printf("\n");
	}

	return 0;
}