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 <iostream>
#include <vector>

int main()
{
	int numGems = 0;;

	std::cin >> numGems;
	const int gridSize = 21;
	std::vector<bool> gems(gridSize * gridSize, false);
	int gemPointX = 0;
	int gemPointY = 0;
	if (numGems == 0)
	{
		std::cerr << "NO" << std::endl;
		return 0;
	}

	//for (int i = 0; i < numGems; i++)
	//{
	//	std::cin >> gemPointX;
	//	std::cin >> gemPointY;

	//	gems[gemPointY * gridSize + gemPointX] = true;
	//}

	int numOrders = 0;
	std::cin >> numOrders;

	char direction = ' ';
	int distance = 0;
	//std::pair<int, int> currentPoint(10, 10);

	//for (int i = 0; i < numOrders; i++)
	//{
	//	std::cin >> direction;
	//	std::cin >> distance;

	//	switch (direction)
	//	{
	//	case 'N':
	//		for (int i = 0; i < distance; i++)
	//		{
	//			currentPoint.second += 1;
	//			gems[currentPoint.second * gridSize + currentPoint.first] = false;
	//		}
	//		break;
	//	case 'E':
	//		for (int i = 0; i < distance; i++)
	//		{
	//			currentPoint.first += 1;
	//			gems[currentPoint.second * gridSize + currentPoint.first] = false;
	//		}
	//		break;
	//	case 'S':
	//		for (int i = 0; i < distance; i++)
	//		{
	//			currentPoint.second -= 1;
	//			gems[currentPoint.second * gridSize + currentPoint.first] = false;
	//		}
	//		break;
	//	case 'W':
	//		for (int i = 0; i < distance; i++)
	//		{
	//			currentPoint.first -= 1;
	//			gems[currentPoint.second * gridSize + currentPoint.first] = false;
	//		}
	//		break;
	//	default:
	//		break;
	//	}
	//}
	

	return 0;
}

C++: #include<stdio.h>
int main(void)
{
  int n,i,m,j,k,robo,robox,roboy,sum;
  char news;
  robox=10;
  roboy=10;
  for(;;)
    {
      scanf("%d",&n);
      if(n==0){break;}
      int x[n],y[n],xy[n];
      for(i=0;i<n;i++){xy[i]=0;}
      sum=0;
      for(i=0;i<n;i++){scanf("%d %d",&x[i],&y[i]);}
      scanf("%d",&m);
      for(i=0;i<m;i++)
	{
	  scanf(" %c %d",&news,&robo);
	  for(k=0;k<robo;k++)
	    {
	    if(news=='N'){roboy=roboy+1;}
	    if(news=='W'){robox=robox-1;}
	    if(news=='S'){roboy=roboy-1;}
	    if(news=='E'){robox=robox+1}
	    for(j=0;j<n;j++){if(x[j]==robox && y[j]==roboy){xy[j]=1}}
	    }
	}
      for(j=0;j<n;j++){sum=sum+xy[j];}
      if(sum==n){printf("Yes\n");}
      else{printf("No\n");}
    }
  return 0;
}

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

int N, M, cnt;
int Map[21][21];

struct Position{
	int x;
	int y;
}robot;

void initMap(void){
	int i, j;
	for(i = 0; i < 21; i++){
		for(j = 0; j < 21; j++){
			Map[i][j] = 0;
		}
	}
}

void setGems(int x, int y){
	Map[x][y] = 1;
}

int main(){
	int x, y, step;
	char dir;
	while(true){
		initMap();
		cnt = 0;
		robot.x = 10; robot.y = 10;
		cin >> N;
		if(N == 0)	break;
		for(int i = 0; i < N; i++){
			cin >> x >> y;
			setGems(x, y);
		}
		cin >> M;
		for(int i = 0; i < M; i++){
			cin >> dir >> step;
			switch(dir){
				case 'N':
					for(int i = 0; i < step; i++){
						robot.y++;
						if(Map[robot.x][robot.y] == 1)	cnt++;
					}
					break;
				case 'E':
					for(int i = 0; i < step; i++){
						robot.x++;
						if(Map[robot.x][robot.y] == 1)	cnt++;
					}
					break;
				case 'S':
					for(int i = 0; i < step; i++){
						robot.y--;
						if(Map[robot.x][robot.y] == 1)	cnt++;
					}
					break;
				case 'W':
					for(int i = 0; i < step; i++){
						robot.x--;
						if(Map[robot.x][robot.y] == 1)	cnt++;
					}
					break;
				default:
					break;

			}
		}
		if(cnt == N){
			cout << "Yes" << endl;
		}else{
			cout << "No" << endl;	
		}
	}
	return 0;
}

C++: #include <iostream>
#include <algorithm>
#include <stdlib.h>
#include <string>
#include <queue>
using namespace std;

int main(){
string s;
int n,m,x,y;
while(cin>>n && n!=0){
int c=0;
int ma[22][22]={0};
for(int aa=0;aa<n;aa++){
cin>>x>>y;
ma[x][y]=1;
}
cin>>m;
int nx=10,ny=10,w;
for(int aa=0;aa<m;aa++){
cin>>s>>w;
if(s=="N"){
while(w>0){
ny++;
if(ma[nx][ny]==1){
ma[nx][ny]=0;
c++;
}
w--;
}
}
if(s=="S"){
while(w>0){
ny--;
if(ma[nx][ny]==1){
ma[nx][ny]=0;
c++;
}
w--;
}
}
if(s=="E"){
while(w>0){
nx++;
if(ma[nx][ny]==1){
ma[nx][ny]=0;
c++;
}
w--;
}
}

if(s=="W"){
while(w>0){
nx--;
if(ma[nx][ny]==1){
ma[nx][ny]=0;
c++;
}
w--;
}
}

}

if(n==c)cout<<"YES"<<endl;
else cout<<"NO"<<endl;

}
return 0;
}