Problem:
MathJax.Hub.Config({ tex2jax: { inlineMath: [["$","$"], ["\\(","\\)"]], processEscapes: true }});

Intersection of Circles

For given two circles $c1$ and $c2$, print

4

if they do not cross (there are 4 common tangent lines),

3

if they are circumscribed (there are 3 common tangent lines),

2

if they intersect (there are 2 common tangent lines),

1

if a circle is inscribed in another (there are 1 common tangent line),

0

if a circle includes another (there is no common tangent line).

Input

Coordinates and radii of $c1$ and $c2$ are given in the following format.

$c1x \; c1y \; c1r$

$c2x \; c2y \; c2r$

$c1x$, $c1y$ and $c1r$ represent the center coordinate and radius of the first circle.
$c2x$, $c2y$ and $c2r$ represent the center coordinate and radius of the second circle.
All input values are given in integers.

Output

Print "4", "3", "2", "1" or "0" in a line.

Constraints

$-1,000 \leq c1x, c1y, c2x, c2y \leq 1,000$

$1 \leq c1r, c2r \leq 1,000$

$c1$ and $c2$ are different

Sample Input 1

1 1 1
6 2 2

Sample Output 1

4

Sample Input 2

1 2 1
4 2 2

Sample Output 2

3

Sample Input 3

1 2 1
3 2 2

Sample Output 3

2

Sample Input 4

0 0 1
1 0 2

Sample Output 4

1

Sample Input 5

0 0 1
0 0 2

Sample Output 5

0

Solution in C# (judge verdict: Accepted)

using System;
using System.Collections.Generic;
using System.Linq;
using System.Text;

namespace ConsoleApplication1
{
    enum ST { Bottom, Left, Right, Top }

    class Program
    {
        static void Main(string[] args)
        {
            Circle[] C = new Circle[2];
            for (int i = 0; i < 2; i++)
            {
                double[] input = Array.ConvertAll(Console.ReadLine().Split(' '), double.Parse);
                C[i] = new Circle(new Point(input[0], input[1]), input[2]);
            }
            Console.WriteLine(Intersect(C[0], C[1]));
        }

        static int Intersect(Circle c1, Circle c2)
        {
            double distP, distR;
            distP = (c1.p - c2.p).Norm;

            distR = (c1.r + c2.r) * (c1.r + c2.r);
            if (distP > distR) return 4;
            if (distP == distR) return 3;

            distR = (c1.r - c2.r) * (c1.r - c2.r);
            if (distP > distR) return 2;
            if (distP == distR) return 1;

            return 0;
        }
    }

    class EndPoint : IComparable
    {
        internal Point p;
        internal int seg;
        internal ST st;

        public EndPoint(Point p, int seg, ST st)
        {
            this.p = p;
            this.seg = seg;
            this.st = st;
        }

        public int CompareTo(object obj)
        {
            EndPoint other = obj as EndPoint;

            if (p.y < other.p.y) return -1;
            if (p.y > other.p.y) return 1;
            if (st < other.st) return -1;
            if (st > other.st) return 1;
            return 0;
        }
    }

    class Point : IComparable
    {
        static readonly double EPS = 1E-10;

        internal double x, y;

        public Point(double x, double y)
        {
            this.x = x;
            this.y = y;
        }

        public double Abs { get { return Math.Sqrt(Norm); } }
        public double Norm { get { return x * x + y * y; } }

        public double Dot(Point p) { return x * p.x + y * p.y; }
        public double Cross(Point p) { return x * p.y - y * p.x; }
        public double Distance(Point p) { return (this - p).Abs; }

        public static Point operator +(Point a, Point b) { return new Point(a.x + b.x, a.y + b.y); }
        public static Point operator -(Point a, Point b) { return new Point(a.x - b.x, a.y - b.y); }
        public static Point operator *(Point p, double d) { return new Point(p.x * d, p.y * d); }
        public static Point operator /(Point p, double d) { return new Point(p.x / d, p.y / d); }
        public static bool operator <(Point a, Point b) { return Math.Abs(a.x - b.x) > EPS ? a.x < b.x : a.y < b.y; }
        public static bool operator >(Point a, Point b) { return Math.Abs(a.x - b.x) > EPS ? a.x > b.x : a.y > b.y; }
        public static bool operator ==(Point a, Point b) { return Math.Abs(a.x - b.x) < EPS && Math.Abs(a.y - b.y) < EPS; }
        public static bool operator !=(Point a, Point b) { return Math.Abs(a.x - b.x) >= EPS || Math.Abs(a.y - b.y) >= EPS; }

        public int CompareTo(object obj)
        {
            var other = obj as Point;
            if (other == null) return -1;

            ComparerX compX = new ComparerX();
            return compX.Compare(this, other);
        }

        public override bool Equals(object obj)
        {
            var other = obj as Point;
            return Math.Abs(x - other.x) < EPS && Math.Abs(y - other.y) < EPS;
        }

        public override int GetHashCode()
        {
            return x.GetHashCode() ^ y.GetHashCode();
        }

        public override string ToString()
        {
            return string.Format("{0} {1}", x, y);
        }
    }

    class ComparerX : IComparer<Point>
    {
        static readonly double EPS = 1E-10;

        public int Compare(Point a, Point b)
        {
            if (a.x - b.x < -EPS) return -1;
            if (a.x - b.x > EPS) return 1;
            if (a.y - b.y < -EPS) return -1;
            if (a.y - b.y > EPS) return 1;
            return 0;
        }
    }

    class ComparerY : IComparer<Point>
    {
        static readonly double EPS = 1E-10;

        public int Compare(Point a, Point b)
        {
            if (a.y - b.y < -EPS) return -1;
            if (a.y - b.y > EPS) return 1;
            if (a.x - b.x < -EPS) return -1;
            if (a.x - b.x > EPS) return 1;
            return 0;
        }
    }

    class Segment
    {
        internal Point p1, p2;

        public Segment(Point p1, Point p2)
        {
            this.p1 = p1;
            this.p2 = p2;
        }
    }

    class Circle
    {
        internal Point p;
        internal double r;

        public Circle(Point p, double r)
        {
            this.p = p;
            this.r = r;
        }
    }
}