Skip to content

Instantly share code, notes, and snippets.

@WayOfTheQway
WayOfTheQway / main.c
Last active July 25, 2017 19:52
Given n points within the unit square, calculate the smallest circle that lies completely within the unit square and contains exactly half of the given points.
#include <stdio.h>
#include <stdlib.h>
#include <math.h>
#define PRECISION "10"
typedef struct __point point;
typedef struct __circle circle;
struct __point
#include <iostream>
#include <ios>
#include <vector>
#include <algorithm>
#include <cmath>
#include <utility>
#include <tuple>
#define EIGEN_DONT_VECTORIZE
#define EIGEN_FAST_MATH 0