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<complex>
#include<vector>
#include<cmath>
#define EPS 1e-8
using namespace std;

typedef complex<double> P;

class ufo{
public:
  P u;
  double r,v;
  ufo(void){}
  ufo(double x,double y, double z,double w){u.real()=x;u.imag()=y;r=z;v=w;}
};

double dot(P a,P b){return a.real()*b.real()+a.imag()*b.imag();}

double cross(P a,P b){return a.real()*b.imag()-a.imag()*b.real();}

bool on_line(P a,P b,P c){return (abs(a-c)+abs(c-b)<abs(a-b)+EPS);}

bool cross_l_c(P a,P b,ufo c){
  double dis = abs(cross(b-a,c.u-a))/abs(b-a);
  if(dis>c.r+EPS)return false;
  //cout << "{" << c.u.real() << " " << c.u.imag() << "}" << endl; 
  P n = b*P(0,1) + c.u;
  P u = b/abs(b);
  P cp = a + (b-a)*cross(n-c.u,c.u-a) / cross(n-c.u,b-a);
  //cout << "[" << cp.real() << " " << cp.imag() << "]" << endl;
  double len = sqrt(c.r*c.r-dis*dis);
  P p1 = cp+len*u,p2 = cp-len*u;
  /*
  cout << "[" << p1.real() << " " << p1.imag() << "]" << endl;
  cout << "[" << p2.real() << " " << p2.imag() << "]" << endl;
  cout << on_line(a,b,p1) << on_line(a,b,p2) << endl;
  */
  return (on_line(a,b,p1) || on_line(a,b,p2));
}

int main(){
  int n;
  double R,x,y,r,v;

  for(;;){
    cin >> R >> n;
    if(!R && !n)break;

    vector<ufo> ob;
    for(int i=0;i<n;i++){
      cin >> x >> y >> r >>v;
      ob.push_back(ufo(x,y,r,v));
    }

    int ans = 0;
    while(ob.size()){
      P m(10000,10000);
      for(int i=0;i<(int)ob.size();i++){
	P tmp = ob[i].u;
	ob[i].u.real() -= ob[i].v*dot(P(1,0),tmp)/abs(tmp);
	ob[i].u.imag() -= ob[i].v*cross(P(1,0),tmp)/abs(tmp);
      }
      //for(int i=0;i<(int)ob.size();i++)cout << ob[i].u.real() << " " << ob[i].u.imag() << endl;
      for(int i=0;i<(int)ob.size();i++){
	if(abs(ob[i].u) < R+EPS){
	  ans++;
	  ob.erase(ob.begin()+i--);
	}else if(abs(ob[i].u)<abs(m)+EPS)m = ob[i].u;
      }
      //cout << ob.size() << " " << m.real() << " " << m.imag() << endl;
      //cout << ob.size() << endl;
      m.real()*=2000;
      m.imag()*=2000;
      P l = m*R/abs(m);
      for(int i=0;i<(int)ob.size();i++){
	if(cross_l_c(l,m,ob[i]))ob.erase(ob.begin()+i--);
      }
      //cout << ob.size() << endl;
    }
    cout << ans << endl;
  }
}

C++: #include <iostream>
#include <algorithm>
#include <cmath>
#include <complex>
#include <vector>
using namespace std;
typedef complex<double> P;
const double eps = 1e-10;


bool equals(double a, double b) {
  return abs(a-b) < eps;
}

double dot(P a, P b) {
  return a.real()*b.real() + a.imag()*b.imag();
}
double cross(P a, P b) {
  return a.real()*b.imag() - a.imag()*b.real();
}
double norm(P a) {
  return a.real()*a.real() + a.imag()*a.imag();
}
double abs(P a) {
  return sqrt(norm(a));
}
double getDistanceLP(P s1, P s2, P p) {
  return fabs(cross(s2 - s1, p - s1)/abs(s2 - s1));
}
double getDistanceSP(P s1, P s2, P p) {
  if(dot(s2 - s1, p - s1) < 0.0) return abs(p - s1);
  if(dot(s1 - s2, p - s2) < 0.0) return abs(p - s2);
  return getDistanceLP(s1, s2, p);
}

struct UFO {
  double r, rad, d, v;
  UFO() {}
  UFO(P p, double r, double v)
    : r(r), rad(atan2(p.imag(),p.real())), d(abs(p)), v(v) {}
  bool operator < (const UFO &u) const {
    if(d != u.d) return d < u.d;
    return false;
  }
  void move() {
    d -= v;
  }
  P getP() {
    return P(d*cos(rad), d*sin(rad));
  }
};

int R, N;
vector<UFO> V;

int solve() {
  int in;
  in = 0;

  while(V.size()) {
    for(vector<UFO>::iterator it = V.begin(); it != V.end();) {
      it->move();
      if(equals(it->d, R) || it->d < R) {
	it = V.erase(it);
	++in;
      } else {
	++it;
      }
    }
    sort(V.begin(), V.end());
    P a(0,0), b((V[0].getP())*1000000.0);
    for(vector<UFO>::iterator it = V.begin(); it != V.end();) {
      double d = getDistanceSP(a,b,it->getP());
      if(equals(d, it->r) || d < it->r) {
	it = V.erase(it);
      } else {
	++it;
      }
    }
  }
  return in;
}

int main() {
  while(cin >> R >> N && (R | N)) {
    V.clear();
    for(int i = 0; i < N; ++i) {
      double r, v;
      P p;
      cin >> p.real() >> p.imag() >> r >> v;
      V.push_back(UFO(p,r,v));
    }
    cout << solve() << endl;
  }
  return 0;
}