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 <sstream>
#include <string>
#include <algorithm>
#include <vector>
#include <iomanip>
#include <queue>
#include <set>
#include <map>
#include <cstdlib>
#include <cstdio>
#include <cmath>
using namespace std;


const double EPS = 1e-9;
const double PI = 3.1415926535897932384626433832795;

class UFO{
public:
	double x;
	double y;
	int r;
	double vx;
	double vy;
	bool dead;
	bool invalid;
};

double dist_sq(UFO u){
	return (u.x*u.x+u.y*u.y);
}

double Cross(UFO a, UFO b){
	return a.x*b.y-b.x*a.y;
}

int main(){
	int R, N;
	while(cin >> R >> N, N){
		vector<UFO> ufo(N);

		for(int i = 0; i < N; i++){
			int v;
			cin >> ufo[i].x >> ufo[i].y >> ufo[i].r >> v;
			double theta = atan2(ufo[i].y, ufo[i].x)-PI;
			ufo[i].vx = v*cos(theta);
			ufo[i].vy = v*sin(theta);
		}

		while(true){
			double min = R*R;
			int target = -1;
			for(int i = 0; i < N; i++){
				if(!ufo[i].dead && !ufo[i].invalid){
					// 位置更新
					double p = ufo[i].x;
					ufo[i].x += ufo[i].vx;
					ufo[i].y += ufo[i].vy;
					if(p*ufo[i].x < 0 || min >= dist_sq(ufo[i])){
						ufo[i].invalid = true;
					}else{
						// ターゲット選定
						if(target == -1){
							target = i;
						}
						else if(dist_sq(ufo[i]) < dist_sq(ufo[target])){
							target = i;
						}
					}
				}
			}

			// 続行判定
			if(target == -1){
				break;
			}

			// レーザー判定
			ufo[target].dead = true;
			for(int i = 0; i < N; i++){
				if(!ufo[i].dead && !ufo[i].invalid){
					double cr = Cross(ufo[target], ufo[i]);
					if(cr*cr/dist_sq(ufo[target]) <= ufo[i].r*ufo[i].r){
						ufo[i].dead = true;
					}
				}
			}
			
		}

		int count = 0;
		for(int i = 0; i < N; i++){
			if(ufo[i].invalid){
				count++;
			}
		}
		cout << count << endl;
	}
	return 0;
}

C++: #include <bits/stdc++.h>
using namespace std;
#define MP make_pair
#define PB push_back
#define FOR(i,a,b) for (int i=(a);i<(b);i++)
#define REP(i,n) for (int i=0;i<(n);i++)
int main() {
	int n;
	double r;
	while(cin>>r>>n&&n){
		priority_queue<pair<double,int> ,vector<pair<double,int> >,greater<pair<double,int> > > dat,tmp;
		int a,b,c;
		double d[100];
		for(int i=0;i<n;i++){
			cin>>a>>b>>c>>d[i];
			dat.push(MP(sqrt(a*a+b*b),i));
		}
		int ans=0;
//		cout<<dat.size()<<endl;
//		cout<<r<<endl;
		while(dat.size()||tmp.size()){
//			if(tmp.size()>0)cout<<"tmp "<<tmp.top().first<<endl;
//			if(dat.size()>0)cout<<"dat "<<dat.top().first<<endl;
			if((dat.size()>0&&dat.top().first<=r)||(tmp.size()>0&&tmp.top().first<=r)){
				if(dat.size()>0)dat.pop();
				if(tmp.size()>0)tmp.pop();
//				cout<<"NO"<<ans<<endl;
				ans++;
				continue;
			}
//			cout<<dat.size()<<endl;
			if(dat.size()>0){
//				cout<<"OK"<<endl;
				dat.pop();
				while(dat.size()){
					pair<double,int> h=dat.top();
					dat.pop();
					tmp.push(MP(h.first-d[h.second],h.second));
				}
			}else if(tmp.size()>0){
				tmp.pop();
				while(tmp.size()){
					pair<double,int> h=tmp.top();
					tmp.pop();
					dat.push(MP(h.first-d[h.second],h.second));
				}
			}
//			cout<<dat.size()<<" "<<tmp.size()<<" "<<ans<<endl;
		}
		cout<<ans<<endl;
	}
}

C++: #include<iostream>
#include<complex>
#include<vector>
#include<algorithm>
#include<cmath>

using namespace std;

template<class T> T sqr(T x){
  return x*x;
}

const double eps=1e-9;

int main(){
  for(int R,N;cin>>R>>N,R;){
    int x0[100],y0[100],r[100],v[100];
    vector<int> rem(N);
    for(int i=0;i<N;i++){
      cin>>x0[i]>>y0[i]>>r[i]>>v[i];
      rem[i]=i;
    }
    int ans=0;
    for(int i=1;;i++){
      auto d=[&](int x){
	return sqrt(sqr(x0[x])+sqr(y0[x]))-i*v[x];
      };
      auto it=remove_if(begin(rem),end(rem),[&](int x){
	  return d(x)<=R+eps;
	});
      ans+=end(rem)-it;
      rem.erase(it,end(rem));
      if(rem.empty())break;
      auto cl=min_element(begin(rem),end(rem),[&](int a,int b){
	  return d(a)<d(b);
	});
      double arg=atan2(y0[*cl],x0[*cl]);
      double xc=d(*cl);
      rem.erase(remove_if(begin(rem),end(rem),[&](int x){
	    complex<double> rp=polar(d(x),atan2(y0[x],x0[x])-arg);
	    return r[x]>=fabs(rp.imag())&&sqrt(sqr(r[x])-sqr(rp.imag()))+rp.real();
	  }),end(rem));
    }
    cout<<ans<<endl;
  }
}