Regular Convex Polygon

A regular convex polygon is a polygon where each side has the same length, and all interior angles are equal and less than 180 degrees. A square, for example, is a regular convex polygon. You are given three points which are vertices of a regular convex polygon R; can you determine the minimum number of vertices that R must have?

Input 

Each test case consists of three lines. Line i consists of two floating point values x_i and y_i ( -10⁴x₁, y₁10⁴) where (x_i, y_i) are the coordinates of a vertex of R. The coordinates are given with a precision of 10^-6, i.e., they differ from the exact coordinates by at most 10^-6. You may assume that for each test case the Euclidean distance between any two given points is at least 1, and R has at most 1000 vertices. The input will finish with a line containing the word END.

Output 

For each test case, print one line with the minimum number of vertices that R must have.

Sample Input 

-1385.736326 -146.954822
430.000292 -2041.361203
1162.736034 478.316025
0.000000 4147.000000
-4147.000000 0.000000
0.000000 -4147.000000
END

Sample Output 

3
4

#include <stdio.h>
#include <math.h>
using namespace std;
int mod0(double a, double b) {
    return fmod(a, b) < 1e-8 || fabs(fmod(a, b) - b) < 1e-8;
}
int main() {
    double x1, x2, x3;
    double y1, y2, y3;
    const double pi = acos(-1);
    while(scanf("%lf %lf", &x1, &y1) == 2) {
        scanf("%lf %lf", &x2, &y2);
        scanf("%lf %lf", &x3, &y3);
        double a, b, c, ta, tb, tc;
        a = hypot(x1 - x2, y1 - y2);
        b = hypot(x3 - x2, y3 - y2);
        c = hypot(x1 - x3, y1 - y3);
        ta = acos((b*b + c*c - a*a) / (2*b*c));
        tb = acos((a*a + c*c - b*b) / (2*a*c));
        tc = acos((a*a + b*b - c*c) / (2*a*b));
        ta = ta * 2;
        tb = tb * 2;
        tc = tc * 2;
        for(int i = 3; i <= 1000; i++) {
            double theta = 2 * pi / i;
            if(mod0(ta, theta) && mod0(tb, theta) && mod0(tb, theta))
                printf("%d\n", i), i = 1024;
        }
    }
    return 0;
}