hellman

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

#include <gmp.h>
#include <pthread.h>
#include <semaphore.h>

/*

hellman

#!/usr/bin/python
#-*- coding:utf-8 -*-

"""
xor strings
options:
    -s  -  string with \\xAF escapes
    -r  -  raw string
    -h  -  hex-encoded string (non-letterdigit chars are stripped)
    -f  -  read data from file (- for stdin)

hellman

from z3.z3 import *

s = Solver()

V = 683
vs = []
for v in range(1, V + 1):
    vs.append(Int("v%03d" % v))
    s.add(vs[-1] >= 1)
    s.add(vs[-1] <= 3)

hellman

Keybase proof

I hereby claim:

• I am hellman on github.
• I am hellman (https://keybase.io/hellman) on keybase.
• I have a public key ASAKsf-3olqWdsVlBn7KV6yJ_qKKO-O2as2_XdCCm-xuCgo

To claim this, I am signing this object:

hellman

#!/usr/bin/env python
#-*- coding:utf-8 -*-

import random, zlib, re
from struct import *
from base64 import *
from commands import getoutput
from sock import *
from z3.z3 import *

hellman

#!/usr/bin/env python
#-*- coding:utf-8 -*-

from sock import Sock

def find_greedy(s):
    a, b = [], []
    sa = sb = 0
    for x in sorted(s, reverse=True, key=abs):
        if abs(sa + x - sb) < abs(sb + x - sa):

hellman

#!/usr/bin/env python
#-*- coding:utf-8 -*-

from sock import Sock

f = Sock("52.197.160.186 31337")

def read_map():
    res = []
    print " ", "".join("%2d" % i for i in xrange(19))

hellman

#include <bits/stdc++.h>

using namespace std;

typedef long long LL;
typedef unsigned long long ULL;
typedef unsigned int uint;
typedef unsigned short ushort;
typedef pair<int, int> PII;

hellman

#!/usr/bin/env python
#-*- coding:utf-8 -*-

from itertools import combinations, product
from collections import defaultdict
from aes import AES as AESCLS

AES = AESCLS()

hellman

from sage.all import *

import re

active_bits = [
    0, 3, 4, 7, 8, 9, 10, 11, 14, 20, 21, 24, 25, 26,
    35, 40, 41, 43, 45, 46, 47,
]

code = """