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<cfloat>
#include<cmath>
#include<vector>
#include<algorithm>
#include<stdio.h>
using namespace std;
 
#define EPS (1e-10)
#define equals(a, b) (fabs((a) - (b)) < EPS )
#define dle(a, b) (equals(a, b) || a < b )
#define PI 3.14159265359
#define PI2 6.28318530718
#define INF 99999999.9999

class Point{
public:
  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); }
  double abs() { return sqrt(norm());}
  double norm() { return x*x + y*y; }
  bool operator < ( const Point &p ) const {
    return x != p.x ? x < p.x : y < p.y;
  }
  bool operator == ( const Point &p ) const {
    return fabs(x-p.x) < EPS && fabs(y-p.y) < EPS;
  }
};

class Segment{
public:
  Point p1, p2;
  Segment ( Point p1 = Point(), Point p2 = Point() ): p1(p1), p2(p2){}
  double abs() { return sqrt(norm());}
  double norm() { return (p2.x - p1.x)*(p2.x - p1.x) + (p2.y - p1.y)*(p2.y - p1.y); }
};

typedef Segment Line;
typedef Point Vector;

double norm( Vector a ){ return a.x*a.x + a.y*a.y; }
double abs( Vector a ){ return sqrt(norm(a)); }
Point polar( double a, double r ){ return Point(cos(r)*a, sin(r)*a);}
double getDistance( Vector a, Vector b ){ return abs(a - b); }
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 abs(cross(s.p2-s.p1,p-s.p1)/abs(s.p2-s.p1));
}

double R;
int N,ans,id;
Point p[100];
double r[100],v[100],d[100];
bool die[100];
Segment s;
int main(){
  while(1){
    cin>>R>>N;
    if(R==0&&N==0)break;
    for(int i=0;i<N;i++){
      cin>>p[i].x>>p[i].y>>r[i]>>v[i];
      d[i]=getDistance(p[i],Point());
      die[i]=false;
      r[i]+=EPS;
    }
    R+=EPS;

    while(1){
      //１分進める
      for(int i=0;i<N;i++){
	if(d[i] < R)continue;
	p[i]=p[i]/d[i];
	d[i]-=v[i];
	p[i]=p[i]*d[i];
      }

      //最も近くにいる敵を探す
      double mini=INF;
      id=-1;
      for(int i=0;i<N;i++){
	if(die[i]==true)continue;
	if(d[i] < R)continue;
	if(d[i]>mini)continue;
	mini=d[i];
	id=i;
      }
      if(id==-1)break;
      //レーザー発射の処理
      s = Segment( Point() , p[id] );
      for(int i=0;i<N;i++){
	if( die[i] ) continue;
	if( d[i] < R ) continue;
	if( dot(p[i],p[id]) < 0) continue;

	if( getDistanceLP( s , p[i] ) < r[i] )die[i]=true;
	
	Point a = (p[i] / d[i]) * max(R,d[i]-v[i]);
	if( getDistanceLP( s, a ) < r[i] )die[i]=true;
	
      }
      //１ターン終了
    }
    ans=0;
    for(int i=0;i<N;i++){
      if(die[i]==false)ans++;
    }
    cout<<ans<<endl;
  }
    
  
  return 0;
}

C++: #include <algorithm>
#include <cctype>
#include <cstdio>
#include <cmath>
#include <iostream>
#include <functional>
#include <queue>
#include <string>
#include <map>
#include <vector>

using namespace std;

struct ufo {
  double x, y, r, v, l;
  bool alive;
};

struct ufo ufos[100];

double sq(double x) {
  return x * x;
}

int main() {
  for (;;) {
    int R, N;
    cin >> R >> N;
    if (!R && !N) return 0;
    for (int i = 0; i < N; i++) {
      cin >> ufos[i].x >> ufos[i].y >> ufos[i].r >> ufos[i].v;
      ufos[i].l = sqrt(sq(ufos[i].x)+sq(ufos[i].y));
      ufos[i].x /= ufos[i].l;
      ufos[i].y /= ufos[i].l;
      ufos[i].alive = true;
    }
    int alive = N, result = 0;
    while (alive) {
      double m = 1500;
      int f = 0;
      for (int i = 0; i < N; i++)
        if (ufos[i].alive) {
          ufos[i].l -= ufos[i].v;
          if (ufos[i].l <= R) {
            ufos[i].alive = false;
            alive--;
            result++;
          } else if (ufos[i].l <= m) {
            m = ufos[i].l;
            f = i;
          }
        }
      if (!alive) break;
      for (int i = 0; i < N; i++)
        if (ufos[i].alive &&
            (ufos[i].l <= ufos[i].r ||
             (ufos[i].x*ufos[f].x+ufos[i].y*ufos[f].y >= 0 &&
              ufos[i].l*sqrt(abs(1-sq(ufos[i].x*ufos[f].x+ufos[i].y*ufos[f].y))) <= ufos[i].r))) {
          ufos[i].alive = false;
          alive--;
        }
    }
    cout << result << endl;
  }
}