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<vector>
#include<utility>
#include<cmath>
using namespace std;
#define X first
#define Y second

typedef long double ld;
typedef long long ll;
typedef ld P_type;
//typedef pair<P_type,P_type> P;
typedef pair<int,int> P;
const ld INF = 1e39;
const ld EPS = 1e-8;
const ld  PI = acos(-1);

P operator-(P a,P b) {
  return P(a.X - b.X, a.Y - b.Y);
}

P_type out_pro(P a,P b) {
  return (a.X * b.Y - b.X * a.Y);
}

P_type in_pro(P a,P b){
  return (a.X * b.X + a.Y *b.Y);
}

P_type pow_len(P a) {
  return a.X * a.X + a.Y * a.Y;
}

ld len(P a){
  return sqrt(ld(pow_len(a)));
}

struct UFO{
  UFO(){};
  UFO(ld xx,ld yy,int rr,int vv){
    pos.X=xx;
    pos.Y=yy;
    r=rr;
    v=vv;
  }
  P pos;
  int r,v;
};
ld distance(UFO a,int time){
  return len(a.pos)-double(time*a.v);
}
int t;//now time
bool operator<(UFO a,UFO b){
  return distance(a,t)<distance(b,t);
}


int R;
vector<UFO> ufos;
void init(){
  t=1;
  R=0;
  ufos.clear();
}

bool input(){
  int n;
  cin>>R>>n;
  if(R==0&&n==0)return false;
  for(int i=0;i<n;i++){
    ld x,y;
    int r,v;
    cin>>x>>y>>r>>v;
    ufos.push_back(UFO(x,y,r,v));
  }
  return true;
}

bool shot(UFO target,UFO aa){
  P tar = target.pos;
  P a = aa.pos;
  ld dist = abs(out_pro(tar,a));
  return (aa.r >= dist/len(a))&&(in_pro(tar,a)>=0)&&(distance(aa,t)>R);
}


int solve(){
  int res=0;
  while(ufos.size()!=0){
    vector<UFO> tmp;
    sort(ufos.begin(),ufos.end());
    UFO target;
    bool j=false;
    for(int i=0;i<ufos.size();i++){
      if(distance(ufos[i],t)<=R){
        res++;
      }else{
        if(j){
          if(!shot(target,ufos[i])){
            tmp.push_back(ufos[i]);
          }
        }else{
          target=ufos[i];
          j=true;
        }
      }
    }
    ufos=tmp;t++;
  }
  return res;
}

int main(){
  while(init(),input()){
    cout<<solve()<<endl;
  }
}

C++: #include <cstdio>
#include <cstring>
#include <algorithm>
#include <string>
#include <cmath>
#include <stack>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <list>
#include <iostream>
#include <sstream>
#include <climits>
#include <cfloat>
#include <complex>

using namespace std;

typedef complex<double> Point;

const double Eps = 1e-8;

double dot(const Point& a, const Point& b)
{
	return a.real()*b.real() + a.imag()*b.imag();
}
double cross(const Point& a, const Point& b)
{
	return a.real()*b.imag() - a.imag()*b.real();
}
double distance_line_point(const Point& point, const Point& a, const Point& b)
{
	return abs(cross(a-b, point-b) / (a-b));
}
int main()
{
	int R, N;
	while (scanf("%d %d", &R, &N), R | N)
	{
		double r[100], v[100], d[100], angle[100];
		for (int i = 0; i < N; ++i)
		{
			double x, y;
			scanf("%lf %lf %lf %lf", &x, &y, r+i, v+i);
			d[i] = sqrt(x*x + y*y);
			angle[i] = atan2(y, x);
		}

		int ans = 0;
		bool used[100];
		fill(used, used+N, false);
		while (true)
		{
			double shot_angle;
			double near = 1e30;
			for (int i = 0; i < N; ++i)
			{
				if (used[i])
					continue;

				d[i] -= v[i];
				if (d[i] < R + Eps)
				{
					++ans;
					used[i] = true;
				}
				else if (d[i] < near)
				{
					near = d[i];
					shot_angle = angle[i];
				}
			}
			if (near > 1e29)
				break;

			for (int i = 0; i < N; ++i)
				if (!used[i]
				&& distance_line_point(Point(d[i]*cos(angle[i]), d[i]*sin(angle[i])), Point(cos(shot_angle), sin(shot_angle)), Point(0, 0)) < r[i] + Eps)
					used[i] = true;
		}
		printf("%d\n", ans);
	}

	return 0;
}