ftiasch

from fractions import gcd

def read():
    return map(int, raw_input().split())

if __name__ == "__main__":
    while True:
        try:
            a, b = read()
        except EOFError:

ftiasch

#include <cstdio>
#include <cstring>
#include <climits>
#include <vector>
#include <queue>
#include <algorithm>

const int M = 200;

int a[M], b[M], c[M];

ftiasch

#include <cassert>
#include <cstdio>
#include <cstring>
#include <climits>
#include <vector>
#include <functional>
#include <algorithm>

const int N = 50000;

ftiasch

#include <cstdio>
#include <cstring>
#include <algorithm>

const int N = 1000;

int n, graph[N][N], match[N];
bool visit[N];

bool find(int u) {

ftiasch

#include <cassert>
#include <cstdio>
#include <cstring>
#include <set>
#include <string>
#include <queue>
#include <utility>
#include <algorithm>

const int MAX_NODE     = 123456;

ftiasch

~/Dropbox/homeworks/combinatorics-cs477/09 brew --config
HOMEBREW_VERSION: 0.9.5
ORIGIN: https://github.com/mxcl/homebrew
HEAD: aee75f1898c0628523e41fdd665abadc647209d7
HOMEBREW_PREFIX: /usr/local
HOMEBREW_CELLAR: /usr/local/Cellar
CPU: quad-core 64-bit sandybridge
OS X: 10.9-x86_64
Xcode: 5.0.2
CLT: 5.0.1.0.1.1382131676

ftiasch

#include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>

const int N = 100000;

int n, m, w[N], a[N], b[N], order[N];

ftiasch

require 'rexml/document'
require 'open-uri'

task :default => :run

task :run do
    sh '(java -classpath "lib/*" com.topcoder.client.contestApplet.runner.generic www.topcoder.com 5001 >/dev/null 2>&1 &)'
end

task :update do

ftiasch

import java.io.*;
import java.math.*;
import java.util.*;

public class Brute {
    public void run() {
        try {
            int testCount = reader.nextInt();
            for (int t = 1; t <= testCount; ++ t) {
                int n = reader.nextInt();

ftiasch

CCFLAGS=-w
main: main.c
	${CC} ${CCFLAGS} main.c -o main