Go: package main

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

var scanner = bufio.NewScanner(os.Stdin)

const (
	INF = 0x7FFFFFFF
	EPS = 1e-10
)

type Point struct {
	x, y float64
}
func (p *Point) plus(q *Point) *Point {
	return &Point{p.x + q.x, p.y + q.y}
}
func (p *Point) minus(q *Point) *Point {
	return &Point{p.x - q.x, p.y - q.y}
}
func (p *Point) multi(a float64) *Point {
	return &Point{p.x * a, p.y * a}
}
func (p *Point) div(a float64) *Point {
	return &Point{p.x / a, p.y / a}
}
func (p *Point) abs() float64 {
	return math.Sqrt(p.norm())
}
func (p *Point) norm() float64 {
	return p.x*p.x + p.y*p.y
}
func (p *Point) isLessThan(q *Point) bool {
	if p.x != q.x {
		return p.x < q.x && p.y < q.y
	}
	return true
}
func (p *Point) isEqual(q *Point) bool {
	return math.Abs(p.x - q.x) < EPS && math.Abs(p.y - q.y) < EPS
}

type Segment struct {
	p1, p2 *Point
}
func (s *Segment) norm() float64 {
	return (s.p2.x - s.p1.x)*(s.p2.x - s.p1.x) +
		(s.p2.y - s.p1.y)*(s.p2.y - s.p1.y)
}
func (s *Segment) abs() float64 {
	return math.Sqrt(s.norm())
}

func norm(a *Point) float64 {
	return a.x*a.x + a.y*a.y
}

func abs(a *Point) float64 {
	return math.Sqrt(norm(a))
}

func polar(a, r float64) *Point {
	return &Point{math.Cos(r)*a, math.Sin(r)*a}
}

func getDistance(a, b *Point) float64 {
	return abs(a.minus(b))
}

func dot(a, b *Point) float64 {
	return a.x*b.x + a.y*b.y
}

func cross(a, b *Point) float64 {
	return a.x*b.y - a.y*b.x
}

func getDistanceLP(s Segment, p *Point) float64 {
	return cross(s.p2.minus(s.p1), p.minus(s.p1))/ abs(s.p2.minus(s.p1))
}

func getDistanceSP(s Segment, p *Point) float64 {
	if dot(s.p2.minus(s.p1), p.minus(s.p1)) < 0 {
		return abs(p.minus(s.p1))
	}
	if dot(s.p1.minus(s.p2), p.minus(s.p2)) < 0 {
		return abs(p.minus(s.p2))
	}
	return getDistanceLP(s, p)
}

func main() {
	for scanner.Scan() {
		buf := strings.Split(scanner.Text(), " ")
		R, _ := strconv.Atoi(buf[0])
		N, _ := strconv.Atoi(buf[1])
		if R == 0 && N == 0 {
			break
		}
		p := make([]*Point, N)
		r := make([]float64, N)
		v := make([]float64, N)
		d := make([]float64, N)
		nd := make([]float64, N)
		die := make([]bool, N)
		for i := 0; i < N; i++ {
			scanner.Scan()
			buf_ := strings.Split(scanner.Text(), " ")
			_x, _ := strconv.ParseFloat(buf_[0], 64)
			_y, _ := strconv.ParseFloat(buf_[1], 64)
			_r, _ := strconv.ParseFloat(buf_[2], 64)
			_v, _ := strconv.ParseFloat(buf_[3], 64)
			tmp := &Point{_x, _y}
			p[i] = tmp
			r[i] = _r
			v[i] = _v
			nd[i] = getDistance(p[i], &Point{0, 0})
			d[i] = getDistance(p[i], &Point{0, 0})
			die[i] = false
		}
		for {
			for i := 0; i < N; i++ {
				nd[i] = math.Max(float64(R), nd[i]-v[i])
			}
			mini := float64(INF)
			id := -1
			for i := 0; i < N; i++ {
				if die[i] {
					continue
				}
				if nd[i] < EPS+float64(R) {
					continue
				}
				if nd[i] > mini {
					continue
				}
				mini = nd[i]
				id = i
			}
			if id == -1 {
				break
			}
			s := Segment{p[id], p[id]}
			s.p1 = s.p1.div(d[id])
			s.p1 = s.p1.multi(float64(R))
			s.p2 = s.p2.div(d[id])
			s.p2 = s.p2.multi(10000000.0)
			for i := 0; i < N; i++ {
				if nd[i] < EPS + float64(R) {
					continue
				}
				a := p[i]
				a = a.div(d[i])
				a = a.multi(nd[i])
				if getDistanceSP(s, a) < EPS + r[i] {
					die[i] = true
				}
			}
		}
		ans := 0
		for i := 0; i < N; i++ {
			if !die[i] {
				ans++
			}
		}
		fmt.Println(ans)
	}
}

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

struct Point {
  double x, y;
  Point(double x=0, double y=0) : x(x), y(y) {}
  Point operator + (Point p) { return Point(x + p.x, y + p.y); }
  Point operator - (Point p) { return Point(x - p.x, y - p.y); }
  Point operator * (double a) { return Point(x * a, y * a); }
  Point operator / (double a) { return Point(x / a, y / a); }
};
typedef Point Vector;
struct Segment {
  Point p1, p2;
};
typedef Segment Line;

double norm(Vector a) { return a.x*a.x + a.y*a.y; }
double abs(Vector a) { return sqrt(norm(a)); }
double dot(Vector a, Vector b) { return a.x*b.x + a.y*b.y; }
double cross(Vector a, Vector b) { return a.x*b.y - a.y*b.x; }
double getDistanceLP(Line s, Point p) {
  return fabs(cross(s.p2 - s.p1, p - s.p1))/abs(s.p2 - s.p1);
}

double getDistanceSP(Segment s, Point p) {
  if(dot(s.p2 - s.p1, p - s.p1) < 0.0) return abs(p - s.p1);
  if(dot(s.p1 - s.p2, p - s.p2) < 0.0) return abs(p - s.p2);
  return getDistanceLP(s, p);
}

const int N_MAX = 101;
struct Ufo {
  Point p;
  int r, v;
  double dist() { return abs(p); }
};

int R, N;
vector<Ufo> U;

void init() {
  U.clear();
}

int solve() {
  int ans = 0;
  while(!U.empty()) {
    double mini = -1;
    vector<Ufo>::iterator v;
    for(vector<Ufo>::iterator it = U.begin(); it != U.end(); ) {
      double D = it->dist();
      it->p.x -= it->p.x * it->v/D;
      it->p.y -= it->p.y * it->v/D;
      double D2 = it->dist();
      if(D <= it->v || D2 <= R) {
	ans++;
	it = U.erase(it);
      } else {
	if(mini == -1 || D2 < mini) {
	  mini = D2;
	  v = it;
	}
	it++;
      }
    }

    if(U.size() <= 1) break;

    Segment s;
    s.p1 = Point(0, 0);
    s.p2 = v->p * 1000;
    U.erase(v);

    for(vector<Ufo>::iterator it = U.begin(); it != U.end(); ) {
      if(getDistanceSP(s, it->p) <= it->r) {
	it = U.erase(it);
      } else {
	it++;
      }
    }
  }
  return ans;
}

main() {
  while((cin >> R >> N) && (R || N)) {
    init();
    for(int i = 0; i < N; i++) {
      Ufo u;
      int x, y;
      cin >> u.p.x >> u.p.y >> u.r >> u.v;
      U.push_back(u);
    }
    cout << solve() << endl;
  }
}

C++: #include <iostream>
#include <complex>
#include <vector>
#include <algorithm>
#include <cmath>
#include <queue>
using namespace std;

#define EPS 1e-10
typedef complex<double> P;

struct L : public vector<P> {
  L(const P &a, const P &b) {
    push_back(a); push_back(b);
  }
};

struct C {
  P p; double r;
  C(const P &p, double r) : p(p), r(r) { }
};

double cross(const P& a, const P& b) {
  return imag(conj(a)*b);
}

double dot(const P& a, const P& b) {
  return real(conj(a)*b);
}

double dist(const P& a, const P& b)
{
	return sqrt((a.real()-b.real())*(a.real()-b.real())+(a.imag()-b.imag())*(a.imag()-b.imag()));
}

bool intersectSC(const L& l, const C& c)
{	
	double vc=dot(l[1]-l[0], c.p-l[0]);
	if(vc+EPS<0)
	{
		return dist(l[0], c.p)<c.r+EPS;
	}
	
	double vv=dot(l[1]-l[0], l[1]-l[0]);
	
	if(vc > vv)
	{
		double d=dist(l[1], c.p);
		
		return d*d<c.r*c.r+EPS;
	}
	
	double cc=dot(c.p-l[0], c.p-l[0]);
	
	return cc-(vc/vv)*vc < c.r*c.r+EPS;
}


class UFO
{
public:
	C c;
	int v;
	double d,dx,dy;
	UFO(C c, int v, double d, double dx, double dy)
	:c(c),v(v),d(d),dx(dx),dy(dy)
	{}
	
	bool operator<(const UFO& u) const
	{
		return d>u.d;
	}
};

int main()
{
	int R,N;
	while(cin >> R >> N,(R||N))
	{
		priority_queue<UFO> q;
		while(N--)
		{
			int x,y,r,v;
			cin >> x >> y >> r >> v;
			double dx=1.0*v*x/sqrt(x*x+y*y), dy=1.0*v*y/sqrt(x*x+y*y);
			double tx=x-dx, ty=y-dy;
			double d=dist(P(0,0),P(x,y));
			q.push(UFO(C(P(tx,ty),r), v, d-v, dx,dy));
		}
		
		int cnt=0;
		while(!q.empty())
		{
			UFO u=q.top(); q.pop();
			if(u.d < R+EPS)
			{
				cnt++;
				continue;
			}
			
			priority_queue<UFO> tq;
			L s(P(0,0),P(u.c.p.real()*3000, u.c.p.imag()*3000));
			while(!q.empty())
			{
				UFO uf=q.top(); q.pop();
				if(intersectSC(s,uf.c)) continue;
				
				double tx=uf.c.p.real()-uf.dx, ty=uf.c.p.imag()-uf.dy;
				tq.push(UFO(C(P(tx,ty), uf.c.r), uf.v, uf.d-uf.v, uf.dx, uf.dy));
			}
			
			while(!tq.empty())
			{
				q.push(tq.top()); tq.pop();
			}
		}
		
		cout << cnt << endl;
	}
}