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;
typedef long long ll;
typedef pair<ll, ll> l_l;
typedef pair<int, int> i_i;
template<class T>
inline bool chmax(T &a, T b) {
    if(a < b) {
        a = b;
        return true;
    }
    return false;
}

template<class T>
inline bool chmin(T &a, T b) {
    if(a > b) {
        a = b;
        return true;
    }
    return false;
}

const long double EPS = 1e-10;
const long long INF = 1e18;
const long double PI = acos(-1.0L);
//const ll mod = 1000000007;
int N;

int x[100], y[100];
bool checked[100];

void check(int h, int w) {
    for(int i = 0; i < N; i++) {
        if(h == y[i] and w == x[i]) checked[i] = true;
    }
}

void solve() {
    int h = 10;
    int w = 10;
    for(int i = 0; i < N; i++) {
        cin >> x[i] >> y[i];
        checked[i] = false;
    }
    check(h, w);
    int M;
    cin >> M;
    while(M--) {
        char d;
        int k;
        cin >> d >> k;
        while(k--) {
            if(d == 'N') h++;
            if(d == 'S') h--;
            if(d == 'E') w++;
            if(d == 'W') w--;
            check(h, w);
        }
    }
    string ans = "Yes";
    for(int i = 0; i < N; i++) {
        if(!checked[i]) ans = "No";
    }
    cout << ans << endl;
}

int main() {
    //cout.precision(10);
    cin.tie(0);
    ios::sync_with_stdio(false);
    while(cin >> N) {
        if(N == 0) break;
        solve();
    }
    return 0;
}

C++: #include <bits/stdc++.h>
using namespace std;

int main(){
    int n,m;
    while(cin>>n,n){
        set<pair<int,int> > sp;

        for(int i=0;i<n;i++){
            int x,y;
            cin>>x>>y;
            sp.insert(make_pair(y,x));
        }

        cin>>m;
        int c=0;
        pair<int,int> now(10,10);

        for(int i=0;i<m;i++){
            char d;
            int len;

            cin>>d>>len;
            cin.ignore();

            for(int j=0;j<len;j++){
                switch(d){
                    case 'N':
                        now.first++;
                        break;
                    case 'S':
                        now.first--;
                        break;
                    case 'E':
                        now.second++;
                        break;
                    case 'W':
                        now.second--;
                        break;
                }

                decltype(sp.end()) it;
                if((it=sp.find(now)) != sp.end()){
                    c++;
                    sp.erase(it);
                }
            }
        }

        cout << (c==n ? "Yes" : "No") << endl;
    }
}

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 char Move[] = { 'E', 'W', 'N', 'S' };

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 < 4; 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 <stdio.h>
int main()
{
  char sute,h;
  int scood[21][2],i,j,m,rx,ry,t,cou,k,s;
  while(1){
    scanf("%d",&s);
    if(s==0)break;
    for(i=0;i<s;i++){
      scanf("%d %d",&scood[i][0],&scood[i][1]);
    }
    scanf("%d%c",&m,&sute);
    rx=10;
    ry=10;
    cou=0;
    //    printf("%d",m);
    for(i=0;i<m;i++){
      scanf("%c %d%c",&h,&k,&sute);

      //printf("%c %d\n",h,k);
      for(j=0;j<k;j++){
	if(h=='N')ry++;
	if(h=='E')rx++;
	if(h=='S')ry--;
	if(h=='W')rx--;


	//printf("%d %d \n",rx,ry);///
	for(t=0;t<s;t++){
	  if(scood[t][0]==rx&&scood[t][1]==ry){
	    cou++;
	    scood[t][0]=100;
	    scood[t][1]=100;
	}
      }
    }
    //printf("%d",cou);///
    if(cou==s)printf("Yes\n");
    else if(cou!=s)printf("No\n");
  }
  return 0;
}