timshen91

#include <vector>
#include <map>
#include <string>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <climits>

using namespace std;

timshen91

// C++0x
#include <cstring>
#include <vector>
#include <string>
#include <climits>

using namespace std;

class pairSet {
	const static unsigned int hSize = 100003;

timshen91

package main

import (
	"bufio"
	"fmt"
	"net"
	"net/http"
)

type Reader struct {

timshen91

(define (enum a)
  (cond ((null? a) '(()))
        (else (apply append (map (lambda (x) (map (lambda (y) (cons x y)) (enum (cdr a)))) (car a))))))

timshen91

#!/bin/sh
sed 's|^.*if(\(.*\)/i\.test(url)) *return.*|\1|g' |
sed 's|^[^:]*:||' |
sed 's|\\\(.\)|\1|g' |
sed 's|\.\*|*|g' |
sed 's|^[^a-zA-Z0-9]*||'

timshen91

#include <iostream>
#include <fstream>
#include <string>
#include <vector>
#include <cassert>
#include <cmath>
#include <GL/gl.h>
#include <GL/glut.h>

#define sqr(a) ((a) * (a))

timshen91

#include <cstdio>

int divImpl(int a, int b, int c, int * acc) {
	if (a < b) {
		return a;
	}
	int ret = divImpl(a, b + b, c + c, acc);
	if (ret >= b) {
		*acc += c;
		ret -= b;

timshen91

#include <cstdio>
#include <cstring>
#include <queue>

#define N 9
#define set1(a, b) a = ((a) | (1 << (b)))
#define set0(a, b) a = ((a) & (~(1 << (b))))
#define get(a, b) (((a) >> (b)) & 1)
#define fetch(a, b) ((((a) >> (2 * (b))) & 1) + (((a) >> (2 * (b))) & 2))
#define movable(p) ((((a[p]) >> 8) & 1) == 0)

timshen91

#include <cstdio>
#include <cstring>
#include <vector>

typedef unsigned int st;

int n, m;
st a[1000];
st valid1[1030];
int validCnt[1030];

timshen91

#include <cstdio>
#include <vector>

using namespace std;

int n;
vector<vector<pair<int, int> > > g;
vector<bool> vis;
int ans;
int cnt;