https://cn.vjudge.net/problem/Gym-102222B
#include <iostream>
#include <cstring>
#include <queue>
#include <vector>
#include <algorithm>
#include <cstdio>
#include <set>
#include <map>
#include <stack>
//#include <tr1/unordered_map>
#include <cmath>
//#include<bits/stdc++.h>
using namespace std;
#define sfi(i) scanf("%d",&i)
#define sfl(i) scanf("%I64d",&i)
#define sfs(i) scanf("%s",(i))
#define pri(i) printf("%d\n",i)
#define prl(i) printf("%I64d\n",i)
#define sff(i) scanf("%lf",&i)
#define ll long long
#define ull unsigned long long
#define mem(x,y) memset(x,y,sizeof(x))
#define INF 0x3f3f3f3f
#define inf 1e18
#define eps 1e-10
#define PI acos(-1.0)
#define lowbit(x) ((x)&(-x))
#define fl() printf("flag\n")
#define MOD(x) ((x%mod)+mod)%mod
#define endl '\n'
#define pb push_back
#define lson (rt<<1)
#define rson (rt<<1|1)
#define FAST_IO ios::sync_with_stdio(false);cin.tie(0);cout.tie(0)
template<typename T>inline void read(T &x)
{
x=0;
static int p;p=1;
static char c;c=getchar();
while(!isdigit(c)){if(c=='-')p=-1;c=getchar();}
while(isdigit(c)) {x=(x<<1)+(x<<3)+(c-48);c=getchar();}
x*=p;
}
//-----------------------------------------------
const int maxn=1e5+9;
const int mod=1e9+7;
struct point
{
double x,y;
}p[maxn];
double dis(point a,point b)
{
return sqrt((a.x-b.x)*(a.x-b.x)+(a.y-b.y)*(a.y-b.y));
}
double deg(point a,point b,point c)
{
double x1=a.x-b.x;
double y1=a.y-b.y;
double x2=c.x-b.x;
double y2=c.y-b.y;
double zi=x1*x2+y1*y2;
double mu=sqrt(x1*x1+y1*y1)*sqrt(x2*x2+y2*y2);
double d=acos(zi/mu);
return PI-d;
}
int main()
{
//FAST_IO;
//freopen("input.txt","r",stdin);
int cas=0;
int T;
scanf("%d",&T);
while(T--)
{
int n;
scanf("%d",&n);
for(int i=0;i<=n;i++) cin>>p[i].x>>p[i].y;
double ans=0;
for(int i=0;i<n;i++)
{
double d=deg(p[(i-1+n)%n],p[i],p[(i+1)%n]);
ans=ans+dis(p[n],p[i])*(d);
}
printf("Case #%d: ",++cas);
printf("%.3lf\n",ans);
}
return 0;
}