henrybear327

#include <stdio.h>
#include <string.h>

#define BUFFER_SIZE 10000

int isValid(char c)
{
    return ('A' <= c && c <= 'Z') || ('0' <= c && c <= '9');
}

henrybear327

#include <bits/stdc++.h>

using namespace std;

typedef long long ll;

int main()
{	
	int ncase;
	scanf("%d", &ncase);

henrybear327

/*405415039 ������*/
#include <memory.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>

int main()
{
    FILE *HW = fopen("input.txt", "r");
    FILE *hw = fopen("output.txt", "w");

henrybear327

#include <iostream>

using namespace std;

class Test
{
	public:
		Test();
		Test(int num);
	private:

henrybear327

#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <math.h>


#define N 10000

double dist(int a, int b)
{

henrybear327

// assumes you add a timestamp field to each record (see Firebase.ServerValue.TIMESTAMP)
// pros: fast and done server-side (less bandwidth, faster response), simple
// cons: a few bytes on each record for the timestamp
var ref = new Firebase(...);
ref.orderByChild('timestamp').startAt(Date.now()).on('child_added', function(snapshot) {
  console.log('new record', snap.key());
});

henrybear327

#include <stdio.h>

struct data {
	int a;
};

typedef struct data2 {
    int aa;
} hello; //以後不用打struct data2，直接叫他hello就好了!!

henrybear327

#include <bits/stdc++.h>

using namespace std;

int main()
{		
	int n;
	while(scanf("%d", &n) == 1) {
		// read input
		int data[n + 1][n + 1];

henrybear327

Tested on Ubuntu 16.04.2

• wget http://ftp.tsukuba.wide.ad.jp/software/gcc/releases/gcc-6.3.0/gcc-6.3.0.tar.gz

• tar xzf gcc-6.3.0.tar.gz # decompress

• cd gcc-6.3.0

• ./contrib/download_prerequisites # recent compiler binaries have this handy script :)

• cd ..

• mkdir gcc63

henrybear327

/* 
使用前调用init静态建树，然后模仿query进行类Binary Search Tree式的访问即可 
Obj是点的类型，如果追求效率或者在点上除了坐标还有其它信息，可以自己写一个Obj类，然后重载[]运算符
*/
namespace KDTree {
    int K;
    typedef vector <int> Obj;
    template <int T> bool cmpT(const Obj &a, const Obj &b) { return a[T] < b[T]; }
    bool (*cmp[])(const Obj &, const Obj &) = {cmpT <0>, cmpT <1>, cmpT <2>}; //填到所需要的最大维度数目为止，这里表示的是最大3维
    struct Filter {