cocodrips

n_combination: (sets, n) ->
  if sets.length < n or n <= 0
    return []

  if sets.length == n
    return [sets]

  if n == 1
    return (c for c in sets)

cocodrips

n, m = map(int, raw_input().split())
print max(n, m)

cocodrips

class UnionFind:
    def __init__(self, n):
        self.par = range(n)
        self.rank = [0 for i in xrange(n)]

    def find(self, x):
        if self.par[x] == x:
            return x
        self.par[x] = self.find(self.par[x])
        return self.par[x]

cocodrips

class Point:
    def __init__(self, x, y):
        self.x = x
        self.y = y


def cross(p1, p2, p3, p4):
    if (((p1.x - p2.x) * (p3.y - p1.y) + (p1.y - p2.y) * (p1.x - p3.x)) *
        ((p1.x - p2.x) * (p4.y - p1.y) + (p1.y - p2.y) * (p1.x - p4.x)) < 0):
        if (((p3.x - p4.x) * (p1.y - p3.y) + (p3.y - p4.y) * (p3.x - p1.x)) *

cocodrips

class Point:
    def __init__(self, x, y):
        self.x = x
        self.y = y

class Line:
    def __init__(self, start, end):
        self.start = start
        self.end = end

cocodrips

Cookie

参考:casperjsでのクッキーの保存、読み込み
基本的にはこれで動く。casperなのに、かすかに見え隠れするphantom.js...

Save

var fs = require('fs')
var cookies = JSON.stringify(phantom.cookies)
fs.write("cookie.txt", cookies, 644)

cocodrips

0 : ( 24 48 68 73 74 89 99 )
1 : ( 20 34 46 47 54 71 78 )
2 : ( 6 13 14 16 23 25 28 29 30 37 41 43 50 51 53 55 58 59 60 61 65 66 69 70 72 75 79 83 84 85 86 88 90 92 94 97 )
3 : ( 1 7 15 26 33 36 38 64 76 80 81 91 96 100 )
4 : ( 3 17 35 44 45 52 67 77 )
5 : ( 9 10 21 27 87 )
6 : ( 4 62 82 95 98 )
7 : ( 5 18 31 39 40 56 )
8 : ( 8 12 22 32 42 57 63 )
9 : ( 2 11 19 49 93 )

cocodrips

import Queue


class Axis(object):
    def __init__(self, x, y):
        self.x = x
        self.y = y

    def __eq__(self, other):
        return self.x == other.x and self.y == other.y

cocodrips

import numpy as np

"""
o-o-o-o-o
"""

m = np.matrix([
    [1, 1, 0, 0, 0],
    [1, 1, 1, 0, 0],
    [0, 1, 1, 1, 0],

cocodrips

#include <algorithm>
class UnionFind{
public:
    int *par;
    int *rank;
    UnionFind(int n) {
        par = new int[n]; rank = new int[n];
        for (int i = 0; i < n; ++i){ par[i] = i; rank[i] = 0;}
    }