BYVoid

/* 
 * Problem: 线性规划与网络流24题 #2 太空飞行计划问题
 * Author: Guo Jiabao
 * Time: 2009.6.26 18:09
 * State: Solved
 * Memo: 网络最大流 最小割
*/
#include <iostream>
#include <cstdio>
#include <cstdlib>

BYVoid

import pycassa
import time
from pycassa.pool import ConnectionPool
from pycassa.columnfamily import ColumnFamily

servers = [
  '', 
]

pool = ConnectionPool('Keyspace1', servers, pool_size=1)

BYVoid

import random
import json
import hashlib
import threading
import pycassa
import time
from pycassa.pool import ConnectionPool
from pycassa.columnfamily import ColumnFamily

reg = True