11265专题

uva 11265 - The Sultan's Problem(多边形切割)

题目链接:uva 11265 - The Sultan's Problem 对于每条切线,取点在那侧。 #include <cstdio>#include <cstring>#include <cmath>#include <vector>#include <complex>#include <algorithm>using namespace std;typede