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 <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 isIntoC(const L& l, const C& c)
{
	return dist(l[0], c.p) < c.r+EPS && dist(l[1], c.p) < c.r+EPS;
}

int CrossPtNum(const C& c, const L& l)
{
	P LV=l[0]-l[1];
	double A=(LV.real()*LV.real())+(LV.imag()*LV.imag());
	double B=(LV.real()*l[0].real())-(LV.real()*c.p.real())+(LV.imag()*l[0].imag())-(LV.imag()*c.p.imag());
	double C=(l[0].real()-c.p.real())*(l[0].real()-c.p.real())+(l[0].imag()-c.p.imag())*(l[0].imag()-c.p.imag())-(c.r*c.r);

	if(fabs(B*B-A*C) < EPS) return 1;
	if(B*B-A*C  > 0) return 2;
	
	return 0;
}

class UFO
{
public:
	C c;
	int v;
	double d;
	UFO(C c, int v, double d)
	:c(c),v(v),d(d)
	{}
	
	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;
			q.push(UFO(C(P(x,y),r),v, dist(P(0,0), P(x,y))-v));
		}
		
		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()*10000, u.c.p.imag()*10000));
			while(!q.empty())
			{
				UFO uf=q.top(); q.pop();
				if(CrossPtNum(uf.c,s) > 0 || isIntoC(s,uf.c)) continue;
				tq.push(UFO(uf.c, uf.v, uf.d-uf.v));
			}
			
			while(!tq.empty())
			{
				q.push(tq.top()); tq.pop();
			}
		}
		
		cout << cnt << endl;
	}
}

C++: #include<bits/stdc++.h>
using namespace std;
int main()
{
	while(true){
		double R;int N;
		double X[101];double Y[101];double R0[101];double V[101];double X0[101];double Y0[101];
		scanf("%lf%d",&R,&N);
		if(N==0)return 0;
		for(int i=0;i<N;i++){
			scanf("%lf%lf%lf%lf",&X[i],&Y[i],&R0[i],&V[i]);
			X0[i]=X[i];
			Y0[i]=Y[i];
		}
		int F[101];
		//-1:<R,1:survive,0:dead
		for(int i=0;i<N;i++){
			if(X[i]*X[i]+Y[i]*Y[i]<R*R)F[i]=-1;
			else F[i]=1;
		}
		//int sssss=10;
		while(true){
			bool FF=true;
			for(int i=0;i<N;i++){
				if(F[i]==1)FF=false;
			}
			if(FF)break;
			double mind=10000001;
			int mini;
			for(int i=0;i<N;i++){
				if(F[i]==1){
					double X1=X[i]-(X[i]*V[i])/sqrt(X[i]*X[i]+Y[i]*Y[i]);
					double Y1=Y[i]-(Y[i]*V[i])/sqrt(X[i]*X[i]+Y[i]*Y[i]);
					if(X1*X1+Y1*Y1<R*R)F[i]=-1;
					X[i]=X1;Y[i]=Y1;
					if(X1*X0[i]<=0&&Y1*Y0[i])F[i]=-1;
					
					else{
						if(mind>X[i]*X[i]+Y[i]*Y[i]){
							mind=X[i]*X[i]+Y[i]*Y[i];
							mini=i;
						}
					}
				}
			}
			
			if(mind==-1)continue;
			for(int i=0;i<N;i++){
				if(F[i]==1){
					double a=X[mini];double b=Y[mini];
					double D=(b*X[i]-a*Y[i])/sqrt(a*a+b*b);
					if(abs(D)<R0[i]&&a*X[i]>0){
						F[i]=0;
					}
				}
			}
			/*
			if(sssss>=0){
				sssss--;
				printf("%.4d %.4d\n",X[8],Y[8]);
				
			}*/
		}
		int cou=0;
		for(int i=0;i<N;i++){
			if(F[i]==-1)cou++;
		}
		printf("%d\n",cou);
	}
}