SDUT - 2240 织女的红线

import java.util.Scanner;
class Line
{
	double r, x, y, ans;
	int num;
	Line(int n, double ri, double xi, double yi)
	{
		num = n;
		r = ri;
		x = xi;
		y = yi;
		ans = 0;
	}
	void AddPoint(double xi, double yi)
	{
		ans += Math.sqrt((x - xi)*(x - xi) + (y - yi)*(y - yi));
		num++;
		x = xi;
		y = yi;
	}
	void Print()
	{
		System.out.printf("%.2f\n", ans + Math.PI * r * 2);
	}
}
public class Main {

	public static void main(String[] args) {
		// TODO Auto-generated method stub
		Scanner cin = new Scanner(System.in);
		int n = cin.nextInt();
		double r = cin.nextDouble();
		double asd = cin.nextDouble();
		double qwe = cin.nextDouble();
		Line line = new Line(0, r, asd, qwe);
		for(int i = 1; i < n; i++)
		{
			line.AddPoint(cin.nextDouble(), cin.nextDouble());
		}
		line.AddPoint(asd, qwe);
		line.Print();
		cin.close();
	}

}