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<cstdio>
#include<algorithm>
#include<map>
#include<vector>
#include<queue>
#include<cstring>
#include<iostream>
using namespace std;
typedef pair<int,int> P;
typedef pair<int,bool> B;
typedef pair<P,B> PP;
int W,H,N;
char fie[33][33];
int mie[33][33];
int ine[33][33];
vector<PP> q;
int dx[]={0,1,0,-1};
int dy[]={1,0,-1,0};
void prfie(){
  for(int i=0;i<(int)q.size();i++){
    cout << q[i].first.first << " "<<q[i].first.second<<" : "<<q[i].second.first<<endl; 
  }
  for(int i=0;i<H;i++){
    for(int j=0;j<W;j++)
      cout << mie[j][i] << " ";
    cout << endl;
  }
  cout << endl;
  getchar();
}
int solve(){
  int turn=0;
  while(turn<=180 && N>0){
    ++turn;
    //    prfie();
    memset(ine,-1,sizeof(ine));
    for(int i=0;i<(int)q.size();i++){
      if(q[i].second.second) continue;
      for(int j=0;j<4;j++){
	PP p = q[i];
	int nx=(p.first.first)+dx[(p.second.first+j)%4];
	int ny=-p.first.second+dy[(p.second.first+j)%4];
	if(fie[nx][ny]!='#' && mie[nx][ny]==0){
	  q[i].second.first=(p.second.first+j+3)%4;
	  mie[p.first.first][-p.first.second]=q[i].second.first+1;
	  int nw=q[i].second.first;
	  if(nw==2) ine[nx][ny]=nw;
	  else if(ine[nx][ny]==2){}
	  else if(nw==3) ine[nx][ny]=nw;
	  else if(ine[nx][ny]==3){}
	  else if(nw==0) ine[nx][ny]=nw;
	  else if(ine[nx][ny]==0){}
	  else ine[nx][ny]=nw;
	  //	  cout << q[i].first.first << " "<<q[i].first.second<<" : "<<q[i].second.first<<endl;   
	  break;
	}
      }
    }
    sort(q.rbegin(),q.rend());
    for(int i=0;i<(int)q.size();i++){
      if(q[i].second.second) continue;
      PP p = q[i];
      int nx=(p.first.first)+dx[(p.second.first+1)%4];
      int ny=-p.first.second+dy[(p.second.first+1)%4];
      if(!mie[nx][ny] && ine[nx][ny]==p.second.first){
	mie[p.first.first][-p.first.second]=0;
	if(fie[nx][ny]=='X'){
	  --N;
	  q[i].second.second=true;
	  continue;
	}
	mie[nx][ny]=p.second.first+1;
	q[i]=PP(P(nx,-ny),B(p.second.first,false));
      }
    }
    
  }
  q.clear();
  return turn;
}
main(){
  while(1){
    cin >> W >> H;
    if(!W && !H) break;
    N=0;
    memset(mie,0,sizeof(mie));
    for(int i=0;i<H;i++){
      for(int j=0;j<W;j++){
	cin >>fie[j][i];
	if(fie[j][i]=='#')
	  mie[j][i]=9;
	if(fie[j][i]=='E'){
	  q.push_back(PP(P(j,-i),B(0,false)));
	  mie[j][i]=1;
	}else if(fie[j][i]=='N'){
	  q.push_back(PP(P(j,-i),B(1,false)));
	  mie[j][i]=2;
	}else if(fie[j][i]=='W'){
	  q.push_back(PP(P(j,-i),B(2,false)));
	  mie[j][i]=3;
	}else if(fie[j][i]=='S'){
	  q.push_back(PP(P(j,-i),B(3,false)));
	  mie[j][i]=4;
	}
      }
    }
    N=(int)q.size();
    int res=solve();
    if(res>180) cout <<"NA"<<endl;
    else cout << res << endl;
  }
}

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

class Maze {
public:
	map<char, char> next;
	map<char, char> prev;
	map<char, pair<int,int>> xy;

	Maze(vector<string> maze) : maze(maze), rest(-1) {
		next = { {'N','E'}, {'E','S'}, {'S','W'}, {'W','N'} };
		prev = { {'E','N'}, {'S','E'}, {'W','S'}, {'N','W'} };
		xy = { {'N', {0, -1}}, {'E', {1, 0}}, {'S', {0, 1}}, {'W', {-1, 0}} };
		H = maze.size();
		W = maze[0].size();
		rest = countPeople();
	}

	void move() {
		changeDirection();
		goAhead();
	}

	int countPeople() {
		if (0 <= rest) return rest;
		int count = 0;
		for (string str : maze) {
			for (char c : str) {
				count += isPerson(c);
			}
		}
		return count;
	}

private:
	vector<string> maze;
	int H, W;
	int rest;

	bool isPerson(char c) {
		return (isalpha(c) && c != 'X');
	}

	bool isPassable(char c) {
		return (c == '.' || c == 'X');
	}

	void changeDirection() {
		for (int i=0; i<H; ++i) {
			for (int j=0; j<W; ++j) {
				if ( ! isPerson(maze[i][j])) continue;
				char dir = next[maze[i][j]];
				for (int k=0; k<4; ++k) {
					int x = j + xy[dir].first;
					int y = i + xy[dir].second;
					if (maze[y][x] == '.' || maze[y][x] == 'X') {
						maze[i][j] = dir;
						break;
					}
					dir = prev[dir];
				}
			}
		}
	}

	void goAhead () {
		for (int i=0; i<H; ++i) {
			for (int j=0; j<W; ++j) {
				if ( ! isPassable(maze[i][j])) continue;
				char dir = 'E';
				for (int k=0; k<4; ++k) {
					int x = j + xy[dir].first;
					int y = i + xy[dir].second;
					if (0 <= x && x < W && 0 <= y && y < H && maze[y][x] == next[next[dir]]) {
						maze[y][x] = '.';
						if (maze[i][j] == '.') {
							maze[i][j] = tolower(next[next[dir]]);
						} else {
							rest --;
						}
						break;
					}
					dir = prev[dir];
				}
			}
		}
		for (int i=0; i<(int)maze.size(); ++i) {
			for (int j=0; j<(int)maze[i].size(); ++j) {
				maze[i][j] = toupper(maze[i][j]);
			}
		}
	}
};

int main() {
	int W, H;
	while (cin >> W >> H && (W || H)) {
		vector<string> input(H);
		for (int i=0; i<H; ++i) cin >> input[i];

		Maze maze(input);

		int second = 0;
		while (0 < maze.countPeople() && second <= 180) {
			maze.move();
			second ++;
		}
		if (second <= 180) cout << second << endl;
		else cout << "NA" << endl;
	}
	return 0;
}