Go: package main

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

var (
	sc = bufio.NewScanner(os.Stdin)
)

type Point struct {
	X, Y int
}

type Gem struct {
	ID int
	Point
}

type Map struct {
	Current       *Point
	Gems          map[int]*Gem
	CollectedGems map[int]*Gem
}

func (m *Map) Move(dir string, l int) {
	switch {
	case dir == "N" || dir == "S":
		a := 1
		if dir == "S" {
			a = -1
		}
		for i := 0; i < l; i++ {
			m.Current.Y += a
			for _, g := range m.Gems {
				m.TryToTakeGem(g)
			}
		}
	case dir == "E" || dir == "W":
		a := 1
		if dir == "W" {
			a = -1
		}
		for i := 0; i < l; i++ {
			m.Current.X += a
			for _, g := range m.Gems {
				m.TryToTakeGem(g)
			}
		}
	}
}

func (m *Map) HasCompleted() bool {
	return len(m.Gems) == 0
}

func (m *Map) TryToTakeGem(g *Gem) {
	if m.Current.X == g.X && m.Current.Y == g.Y {
		m.CollectedGems[g.ID] = g
		delete(m.Gems, g.ID)
	}
}

func main() {
	for sc.Scan() {
		n, _ := strconv.Atoi(sc.Text())
		if n == 0 {
			break
		}
		m := &Map{
			Current:       &Point{X: 10, Y: 10},
			Gems:          map[int]*Gem{},
			CollectedGems: map[int]*Gem{},
		}
		for i := 0; i < n; i++ {
			sc.Scan()
			chunks := strings.Split(sc.Text(), " ")
			x, _ := strconv.Atoi(chunks[0])
			y, _ := strconv.Atoi(chunks[1])
			m.Gems[i+1] = &Gem{ID: i + 1, Point: Point{X: x, Y: y}}
		}
		sc.Scan()
		opCnt, _ := strconv.Atoi(sc.Text())
		for i := 0; i < opCnt; i++ {
			sc.Scan()
			chunks := strings.Split(sc.Text(), " ")
			dir := chunks[0]
			v, _ := strconv.Atoi(chunks[1])
			m.Move(dir, v)
		}
		msg := "No"
		if m.HasCompleted() {
			msg = "Yes"
		}
		fmt.Println(msg)
	}
}

C++: #include <bits/stdc++.h>
using namespace std;
#define FOR(i, s, n) for(int i = s; i < (int)n; i++)
#define per(i, n) for(int i = n; i >= 0; i--)
#define ROF(i, s, n) for(int i = s; i >= (int)n; i--)
#define FORIT(i, A) for (auto i : A)
#define PRINT(x) cout << (x) << "\n"
#define ALL(a) (a).begin(),(a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define MP make_pair
#define EACH(i, n) for (__typeof((n).begin()) i = (n).begin(); i != (n).end(); ++i)
#define SZ(a) int((a).size())
#define EXIST(s,e) ((s).find(e)!=(s).end())
#define SORT(c) sort((c).begin(),(c).end())
#define CLR(a) memset((a), 0 ,sizeof(a))
#define dump(x) cout << #x << " = " << (x) << "\n";
#define debug(x) cout << #x << " = " << (x) << " (L" << __LINE__ << ")" << " " << __FILE__ << "\n";
#define sq(n) (n) * (n)
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef long long LL;
typedef vector<LL> VLL;
typedef vector<VLL> VVLL;
typedef unsigned int uint;
typedef unsigned long long ull;
typedef priority_queue<int> maxpq;
typedef priority_queue< int, vector<int>, greater<int> > minpq;
static const double EPS = 1e-10;
static const double PI = acos( -1.0 );
static const int mod = 10007;
static const int INF = 1 << 25;
static const LL LL_INF = 1152921504606846976;
static const int dx[] = { 1, -1, 0, 0,  1, -1,  1, -1 };
static const int dy[] = { 0, 0, 1, -1 , 1,  1, -1, -1 };
static const string Move = "EWNS";

int N, now_y = 10, now_x = 10, M, move_many, cnt;
char moves[ 1 ];
vector<PII> gems;

int gcd( int m, int n ) {
	if ( n == 0 ) return m;
	return gcd( n, m % n );
}

int main() {
	while ( ~scanf( "%d", &N ) && N ) {
		gems.resize( N );
		
		for ( int i = 0; i < N; i++ ) {
			scanf( "%d %d", &gems[ i ].first, &gems[ i ].second );
		}
		cnt = 0;
		sort( gems.begin(), gems.end() );
		
		scanf( "%d", &M );
		for ( int i = 0; i < M; i++ ) {
			scanf( "%c %d", moves, &move_many );
			for ( int j = 0; j < Move.size(); j++ ) {
				if ( Move[ j ] == moves[ 0 ] ) {
					for ( int k = 0; k < move_many; k++ ) {
						now_x += dx[ j ];
						now_y += dy[ j ];
						//printf( "X = %d Y = %d\n", now_x, now_y );
						for ( int l = 0; l < gems.size(); l++ ) {
							if ( gems[ l ] == PII( now_x, now_y ) ) {
								gems.erase( gems.begin() + l );
								cnt++;
								break;
							}
						}
					}
					break;
				}
			}
		}
		if ( !gems.size() || cnt == N ) {
			printf( "Yes\n" );
		}
		else {
			printf( "No\n" );
		}
		now_x = now_y = 10;
	}
	return 0;
}

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

int main()
{
	int N, M, x, y, l, rx, ry;
	char d;
	while (cin >> N, N) {
		vector< vector<bool> > a(21, vector<bool>(21, false));
		rx = ry = 10;
		for (int i = 0; i < N; i++) {
			cin >> x >> y;
			a[x][y] = true;
		}
		cin >> M;
		for (int i = 0; i < M; i++) {
			cin >> d >> l;
			switch (d) {
			case 'N':
				for (int j = 0; j < l; j++) {
					ry++;
					if (a[rx][ry])
						a[rx][ry] = false;
				}
				break;
			case 'S':
				for (int j = 0; j < l; j++) {
					ry--;
					if (a[rx][ry])
						a[rx][ry] = false;
				}
				break;
			case 'E':
				for (int j = 0; j < l; j++) {
					rx++;
					if (a[rx][ry])
						a[rx][ry] = false;
				}
				break;
			case 'W':
				for (int j = 0; j < l; j++) {
					rx--;
					if (a[rx][ry])
						a[rx][ry] = false;
				}
				break;
			}
		}
		for (int i = 0; i < 21; i++) {
			for (int j = 0; j < 21; j++) {
				if (a[i][j]) {
					cout << "NO" << endl;
					goto rabel;
				}
			}
		}
		cout << "YES" << endl;
	rabel:
		;
	}
	return 0;
}

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

int x,y,cnt;
int mas[21][21];
void move(char muki,int mv){
  for(int i=0;i<mv;i++){
    if(muki == 'N') y--;
    else if(muki == 'W') x--;
    else if(muki == 'S') y++;
    else if(muki == 'E') x++;
    if(mas[y][x] == 1) cnt++;
  }
}

int main(){
  char muki;
  int n,m,mo;
  while(cin >> n,n){
    memset(mas,0,sizeof(mas));
    for(int i=0;i<n;i++){
      cin >> x >> y;
      mas[20-y][x] = 1;
    }
    y = 10; x = 10;
    cnt = 0;
    cin >> m;
    for(int i=0;i<m;i++){
      cin >> muki >> mo;
      move(muki,mo);
    }
    cout << ((cnt == n)? "Yes":"No") << endl;
  }
}