kinssang

#include <stdio.h>
#include <vector>
#include <algorithm>

int main()
{
	int n, d, input[100000][2], cursor = -100000001, answer = 0;
	std::vector<int> st, ed;
	scanf("%d", &n);
	for (int i = 0; i < n; i++) scanf("%d %d", &input[i][0], &input[i][1]);

kinssang

#include <stdio.h>
//#include <crtdbg.h>

int power_2[30];

struct Trie
{
	Trie *child[2];

	Trie()

kinssang

#include <stdio.h>
#include <queue>
#include <math.h>
#include <algorithm>

struct point
{
	double x;
	double y;
};