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<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;
		double minute=0;
		while(true){
			minute+=1;
			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,Y1;
					if(X0[i]>0)X1=X0[i]-minute*sqrt((X[i]*X[i])/(X[i]*X[i]+Y[i]*Y[i])*(V[i]*V[i]));
					else X1=X0[i]+minute*sqrt((X[i]*X[i])/(X[i]*X[i]+Y[i]*Y[i])*(V[i]*V[i]));
					if(Y0[i]>0)Y1=Y0[i]-minute*sqrt((Y[i]*Y[i])/(X[i]*X[i]+Y[i]*Y[i])*(V[i]*V[i]));
					else Y1=Y0[i]+minute*sqrt((Y[i]*Y[i])/(X[i]*X[i]+Y[i]*Y[i])*(V[i]*V[i]));
					//if(minute<=5)printf("%.0f %d %.8f %.8f\n",minute,i,X1,Y1);
					if(X1*X1+Y1*Y1<R*R)F[i]=-1;
					if(X1*X0[i]<=0&&Y1*Y0[i]<=0)F[i]=-1;
					
					else{
						if(mind>X1*X1+Y1*Y1){
							mind=X1*X1+Y1*Y1;
							mini=i;
						}
					}
				}
			}
			
			if(mind==-1)continue;
			for(int i=0;i<N;i++){
				if(F[i]==1){
					double X1=X0[i]-minute*sqrt((X[i]*X[i])/(X[i]*X[i]+Y[i]*Y[i])*(V[i]*V[i]));
					double Y1=Y0[i]-minute*sqrt((Y[i]*Y[i])/(X[i]*X[i]+Y[i]*Y[i])*(V[i]*V[i]));
					double a=X[mini];double b=Y[mini];
					double D=(b*X1-a*Y1)*(b*X1-a*Y1)/(a*a+b*b);
					if(D<R0[i]*R0[i]){
						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);
	}
}

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

typedef complex<double> P;

#define INF 999999999
#define EPS (1e-10)
#define EQ(a,b) (abs((a)-(b)) < EPS)

//àÏ
double dot(P a, P b){
	return (a.real() * b.real() + a.imag() * b.imag());
}

//OÏ
double cross(P a,P b){
	return (a.real() * b.imag() - a.imag() * b.real());
}

//üªabÆ_cÌ£
double distance_ls_p(P a, P b, P c) {
  if ( dot(b-a, c-a) < EPS ) return abs(c-a);
  if ( dot(a-b, c-b) < EPS ) return abs(c-b);
  return abs(cross(b-a, c-a)) / abs(b-a);
}

//üªabãÉ_cª é©
int is_point_on_line(P a, P b, P c) {
	return EQ( cross(b-a, c-a), 0.0 ) &&
	       (dot(b-a, c-a) > -EPS) &&
	       (dot(a-b, c-b) > -EPS);
}

//pÌÚ®ãÌÊuðßé
P move(P p,double v){
	P b = -p / abs(-p); //-p ÌPÊxNg
	return p + b * v;
}

int main(void){
	int n;
	double R;

	while(cin>>R>>n && (R||n)){
		int ans = 0;
		vector<P> p(n);
		vector<double> r(n),v(n);

		for(int i=0;i<n;i++){
			cin>>p[i].real()>>p[i].imag()>>r[i]>>v[i];
		}

		while(p.size() != 0){
			int minIdx = -1;
			double minDist = INF;

			for(int i=0;i<p.size();i++){
				//r[ª ½çÈ¢êÈçJEg
				if(abs(p[i]) < R + EPS){
					ans++;
					p.erase(p.begin()+i);
					r.erase(r.begin()+i);
					v.erase(v.begin()+i);
					i--;
					continue;
				}

				P aft = move(p[i],v[i]);
				double dist = abs(aft);

				//(0,0)ðÊßµÄµÜ¤©,¼aRÌÍÍàÈçJEg
				if(is_point_on_line(p[i],aft,P(0,0)) || dist < R + EPS){
					ans++;
					p.erase(p.begin()+i);
					r.erase(r.begin()+i);
					v.erase(v.begin()+i);
					i--;
					continue;
				}

				p[i] = aft;
				if(minDist > dist){
					minIdx = i;
					minDist = dist;
				}
			}

			if(minIdx == -1) break;

			P pp = p[minIdx];
			for(int i=0;i<p.size();i++){
				//´_©çppûüÖ·­LÑéüªÆ p[i] Ì£ª r[i] ÈºÈç ½é
				if(distance_ls_p(P(0,0),pp*1000000.0,p[i]) < r[i] + EPS){
					p.erase(p.begin()+i);
					r.erase(r.begin()+i);
					v.erase(v.begin()+i);
					i--;
				}
			}
		}

		cout<<ans<<endl;
	}

	return 0;
}