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, now_x, M, move_many, cnt;
char moves;
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() );
		now_y = 10;
		now_x = 10;
		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 ) {
					for ( int k = 0; k < move_many; k++ ) {
						now_x += dx[ j ];
						now_y += dy[ j ];
						for ( int i = 0; i < gems.size(); i++ ) {
							if ( gems[ i ] == PII( now_x, now_y ) ) {
								swap( gems[ i ], gems[ gems.size() - 1 ] );
								gems.pop_back();
								sort( gems.begin(), gems.end() );
								cnt++;
							}
						}
					}
					
				}
			}
		}
		if ( cnt == N ) {
			printf( "Yes\n" );
		}
		else {
			printf( "No\n" );
		}
	}
	return 0;
}

C++: #include <iostream>
#include <algorithm>
#define L_MAX 21
using namespace std;
int gem[L_MAX][L_MAX] = {};
int main(void)
{
  int n,m;
  int x,y;
  while(cin>>n,n)
  {
    int px = 10,py = 10;
    for(int i = 0;i < L_MAX;i++)
      for(int j = 0; j < L_MAX;j++)
        gem[i][j] = 0;
    for(int i = 0;i < n;i++){
      cin>>x>>y;
      gem[y][x] = 1;
    }
    cin>>m;
    char dist;int l;
    for(int i = 0;i < m;i++)
    {
      int dx = 0,dy = 0;
      cin>>dist>>l;
      switch(dist)
      {
        case 'N':
          dy = 1;
          break;
        case 'S':
          dy = -1;
          break;
        case 'E':
          dx = 1;
          break;
        case 'W':
          dx = -1;
      }
      if(gem[py][px])n--;
      for(int j = 0;j < l;j++)
      {
        px+=dx;
        py+=dy;
        if(gem[py][px])n--;
      }
    }
    if(!n)
      cout<<"Yes"<<endl;
    else
      cout<<"No"<<endl;
  }
  return 0;
}

C++: #include <iostream>
using namespace std;
int main(){
	int n;
	while(cin>>n){
		if(n==0)break;
		int m,count=n,p[21][21];
		for(int i=0;i<21;++i)for(int j=0;j<21;++j)p[i][j]=0;
		for(int i=0,x,y;i<n;++i){
			cin>>x>>y;
			p[x][y]=1;
		}
		cin>>m;
		for(int i=0,d,cx=10,cy=10;i<m;++i){
			string s;
			cin>>s;
			cin>>d;
			if(s=="N"){
				for(int j=0;j<d;++j){
					++cy;
					if(p[cx][cy]==1){
						count--;
						p[cx][cy]=0;
					}
				}
			}else if(s=="E"){
				for(int j=0;j<d;++j){
					++cx;
					if(p[cx][cy]==1){
						count--;
						p[cx][cy]=0;
					}
				}
			}else if(s=="S"){
				for(int j=0;j<d;++j){
					--cy;
					if(p[cx][cy]==1){
						count--;
						p[cx][cy]=0;
					}
				}
			}else if(s=="W"){
				for(int j=0;j<d;++j){
					--cx;
					if(p[cx][cy]==1){
						count--;
						p[cx][cy]=0;
					}
				}
			}
		}
		if(count==0)cout<<"Yes\n";
		else cout<<"No\n";
	}
	return 0;
}

C++: #include <bits/stdc++.h>

using namespace std;

int main()
{
  int N, M;
  while(cin >> N, N){
    int plane[21][21] = {{0}};
    int dx[] = {0, 1, 0, -1}, dy[] = {1, 0, -1, 0};
    int X = 10, Y = 10, get = 0;
    for(int i = 0; i < N; i++){
      int x, y;
      cin >> x >> y;
      plane[x][y] = 1;
    }
    cin >> M;
    while(M--){
      char d; int l, D;
      cin >> d >> l;
      switch(d){
      case 'N': D = 0; break;
      case 'E': D = 1; break;
      case 'S': D = 2; break;
      case 'W': D = 3; break;
      }
      for(int i = 0; i < l; i++){
	X += dx[D], Y += dy[D];
	get += plane[X][Y];
      }
    }
    cout << (get == N ? "Yes":"No") << endl;
  }
  return 0;
}

C++: #include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
int main() {
	int n;
	while (cin >> n, n) {
		vector<pair<int, int> > v;
		for (int i = 0; i < n; i++) {
			int x, y; cin >> x >> y;
			v.push_back(make_pair(x, y));
		}
		cin >> n;
		int x = 10, y = 10;
		for (int i = 0; i < n; i++) {
			char c; int l; cin >> c >> l;
			for (int j = 0; j < l; j++) {
				if (c == 'E') x++;
				else if (c == 'W')x--;
				else if (c == 'N')y++;
				else if (c == 'S')y--;
				auto itr = std::find(v.begin(), v.end(), make_pair(x, y));
				if (itr != v.end())v.erase(itr);
			}
		}
		if (v.size() == 0)cout << "Yes\n";
		else cout << "No\n";
	}
}