Go: package main

import (
	"bufio"
	"os"
	"strconv"
	"strings"
	"fmt"
)

var scanner = bufio.NewScanner(os.Stdin)

type Point struct {
	x, y int
}

func main() {
	dx := []int{1, 0, -1, 0}
	dy := []int{0, -1, 0, 1}
	maze := make([][]rune, 30)
	for i := range maze {
		maze[i] = make([]rune, 30)
	}
	next := make([][]rune, 30)
	for i := range next {
		next[i] = make([]rune, 30)
	}
	check := make([][]int, 30)
	for i := range check {
		check[i] = make([]int, 30)
	}
	for scanner.Scan() {
		buf := strings.Split(scanner.Text(), " ")
		W, _ := strconv.Atoi(buf[0])
		H, _ := strconv.Atoi(buf[1])
		if W == 0 && H == 0 {
			break
		}
		for i := 0; i < H; i++ {
			scanner.Scan()
			buf_ := scanner.Text()
			for j, v := range buf_ {
				maze[i][j] = v
			}
		}
		man := 0
		for i := 0; i < H; i++ {
			for j := 0; j < H; j++ {
				if maze[i][j] != '.' && maze[i][j] != 'X' && maze[i][j] != '#' {
					switch maze[i][j] {
					case 'E':
						maze[i][j] = 0
						man++
					case 'N':
						maze[i][j] = 1
						man++
					case 'W':
						maze[i][j] = 2
						man++
					case 'S':
						maze[i][j] = 3
						man++
					}
				}
			}
		}
		ans := -1
		for t := 0; t <= 180; t++ {
			if man == 0 {
				ans = t
				break
			}
			for i := 0; i < H; i++ {
				for j := 0; j < W; j++ {
					check[i][j] = 0x7FFFFFFF
				}
			}
			for i := 0; i < H; i++ {
				for j := 0; j < W; j++ {
					if maze[i][j] > 3 {
						continue
					}
					l := (maze[i][j] + 3) % 4
					for k := 0; k < 4; k++ {
						y := i + dy[l]
						x := j + dx[l]
						if 0 <= y && y < H && 0 <= x && x < W && (maze[y][x] == '.' || maze[y][x] == 'X') {
							maze[i][j] = l
							check[y][x] = min(check[y][x], int((l+2)%4))
							break
						}
						l = (l + 1) % 4
					}
				}
			}
			for i := 0; i < H; i++ {
				for j := 0; j < W; j++ {
					next[i][j] = maze[i][j]
				}
			}
			for i := 0; i < H; i++ {
				for j := 0; j < W; j++ {
					if maze[i][j] > 3 {
						continue
					}
					y := i + dy[maze[i][j]]
					x := j + dx[maze[i][j]]
					if 0 <= y && y < H && 0 <= x && x < W && check[y][x] == int((maze[i][j]+2)%4) {
						if maze[y][x] == '.' {
							next[y][x] = maze[i][j]
						} else if maze[y][x] == 'X' {
							man--
						}
						next[i][j] = '.'
					}
				}
			}
			for i := 0; i < H; i++ {
				for j := 0; j < W; j++ {
					maze[i][j]=next[i][j]
				}
			}
		}
		if ^ans != 0 {
			fmt.Println(ans)
		} else {
			fmt.Println("NA")
		}
	}
}

func min(a, b int) int {
	if a < b {
		return a
	}
	return b
}

C++: #include <iostream>
#include <cstring>

using namespace std;

const int max_size = 30;

void p(char a[max_size][max_size], int sizei, int sizej = 0, int offseti = 0, int offsetj = 0){
	if(!sizej) sizej = sizei;
	for(int i = 0; i < sizei; i++){
		for(int j = 0; j < sizej; j++){
			cout << a[offseti+i][offsetj+j] << ' ';
		}
		cout << endl;
	}
}

char dirchr[] = "ENWS";
int dx[] = {1, 0, -1, 0};
int dy[] = {0, -1, 0, 1};

int dirnum(char d){
	for(int i = 0; i < 4; i++){
		if(dirchr[i] == d) return i;
	}
	//cout << "invalid char" << d << endl;
	//exit(0);
	return -1;
}

void changeDirection(char (*_map)[max_size], int i, int j){
	int startdir = dirnum(_map[i][j]) + 3; // 現在の向きの右から
	for(int k = 0; k < 4; k++){
		int dir = (startdir+k)%4;
		char destchar = _map[i+dy[dir]][j+dx[dir]];
		if(destchar == '.' || destchar == 'X'){
			//cout << "(" << i << ", " << j << "): " << _map[i][j] << "->" << dirchr[dir] << endl;
			_map[i][j] = dirchr[dir];
			return;
		}
	}
}

void move(char (*_map)[max_size], int i, int j){
	int dir = dirnum(_map[i][j]);
	char destchar = _map[i+dy[dir]][j+dx[dir]];
	if(destchar == '.'){
		_map[i+dy[dir]][j+dx[dir]] = _map[i][j];
		_map[i][j] = '.';
	}
	if(destchar == 'X'){
		_map[i+dy[dir]][j+dx[dir]] = 'Y'; // 同時脱出制限用
		_map[i][j] = '.';
	}
}

void peopleAct(char (*_map)[max_size], int i, int j, void (*func)(char (*)[max_size],int, int), char* filter = "ENWS", int filtersize = 4){
	for(int k = 0; k < filtersize; k++){
		if(_map[i][j] == filter[k]){
			(*func)(_map, i, j);
			break;
		}
	}
}

int main(){
	char square[max_size][max_size];

	int w, h;
	while(cin >> w >> h){
		if(!w && !h) break;
		for(int i = 0; i < h; i++){
			for(int j = 0; j < w; j++){
				cin >> square[i][j];
			}
		}
		int time = 0;
		for(time = 0; time <= 180; time++){
			for(int i = 0; i < h; i++){
				for(int j = 0; j < w; j++){ // 左から
					if(square[i][j] == 'Y'){
						square[i][j] = 'X';
					}
				}
			}


			// 人がいなければ避難終了
			for(int i = 0; i < h; i++){
				for(int j = 0; j < w; j++){
					char c = square[i][j];
					if(c != '.' && c != '#' && c != 'X'){
						goto nextloop;
					}
				}
			}
			break;

nextloop: ;
			// 向きを変える処理
			for(int i = 0; i < h; i++){
				for(int j = 0; j < w; j++){
					peopleAct(square, i, j, changeDirection);
					//for(int k = 0; k < 4; k++){
					//	if(square[i][j] == dirchr[k]){
					//		changeDirection(square, i, j);
					//		break;
					//	}
					//}
				}
			}

			// 移動する処理
			// 左、下、右、上の順に処理

			for(int i = 0; i < h; i++){
				for(int j = 0; j < w; j++){ // 左から
					peopleAct(square, i, j, move, "W", 1);
				}
			}

			for(int i = h-1; i >= 0; i--){ // 下から
				for(int j = 0; j < w; j++){
					peopleAct(square, i, j, move, "S", 1);
				}
			}

			for(int i = 0; i < h; i++){
				for(int j = w-1; j >= 0; j-- ){ // 右から
					peopleAct(square, i, j, move, "E", 1);
				}
			}

			for(int i = 0; i < h; i++){ // 上から
				for(int j = 0; j < w; j++){
					peopleAct(square, i, j, move, "N", 1);
				}
			}

			//p(square, h, w);
			//getchar();
		}

		//p(square, h, w);

		if(time <= 180){
			cout << time << endl;
		}else{
			cout << "NA" << endl;
		}
	}

	return 0;
}

C++: #include<iostream>
#include<vector>
#include<map>
#include<string>
using namespace std;
typedef pair < int , int > Pi;
typedef pair < int , Pi > Pii;
#define fr first
#define sc second
const int dy[][4] = {{1,0,-1,0},{0,-1,0,1},{-1,0,1,0},{0,1,0,-1}};
const int dx[][4] = {{0,1,0,-1},{1,0,-1,0},{0,-1,0,1},{-1,0,1,0}};
const int dm[][4] = {{3,0,1,2},{0,1,2,3},{1,2,3,0},{2,3,0,1}};
const int my[] = { 0, -1, 0, 1}, mx[] = { 1, 0, -1, 0};
const int md[] = { 2, 3, 0, 1};
int w, h;
char mas[30][30];
vector< Pii > vc;
string tmp = "ENWS";
int search( int y , int x){
  for(int i = 0 ; i < vc.size() ; i++ ){
    if(Pi(y,x) == vc[i].sc){
      return i;
    }
  }
  return -1;
}
vector< Pii >  solve(){
  //向き変えるじゃん
  vector< Pii > java;
  for(int i = 0 ; i < vc.size() ; i++ ){
    //向きは毎回変えるじゃん(震え声)
    for(int j = 0 ; j < 4 ; j++ ){
      int yy = vc[i].sc.fr + dy[vc[i].fr][j];
      int xx = vc[i].sc.sc + dx[vc[i].fr][j];
      if(mas[yy][xx] != '#' && search(yy,xx) == -1){
        vc[i].fr = dm[vc[i].fr][j];
        break;
      }
    }
  }
  for(int i = 0 ; i < h ; i++ ){
    for(int j = 0 ; j < w ; j++ ){
      if(mas[i][j] == '#') continue;
      for(int k = 0 ; k < 4 ; k++ ){
        int ny = i + my[k], nx = j + mx[k], iti;
        if((iti = search(ny,nx)) == -1) continue;
        if(vc[iti].fr == md[k]){
          if(mas[i][j] != 'X') java.push_back(Pii(vc[iti].fr,Pi(i,j)));
          break;
        }
      }
    }
  }
  return java;
}
int main(){
  while(cin >> w >> h , w){
    for(int i = 0 ; i < h ; i++ ){
      for(int j = 0 ; j < w ; j++ ){
        cin >> mas[i][j];
        if(tmp.find(mas[i][j]) != string::npos){
          vc.push_back(Pii( tmp.find(mas[i][j]), Pi( i, j)));
        }
      }
    }
    int ret = 0;
    while(ret <= 180 && !vc.empty()){
      vc = solve();
      ret++;
    }
    if(ret == 181) cout << "NA" << endl;
    else cout << ret << endl;
    vc.clear();
  }
}